4009 search results - page 28 / 802 » Clustering on Complex Graphs |
IPMU
2010
Springer
15 years 4 months ago
2010
Springer
The paper offers a parallel between two approaches to conceptual clustering, namely
148
click to vote
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
In this paper, a novel hierarchical clustering method using link analysis techniques is introduced. The algorithm is formulated as an authority seeking procedure on graphs, which c...
101
click to vote
AAIM
2009
Springer
15 years 6 months ago
2009
Springer
During the last years, a wide range of huge networks has been made available to researchers. The discovery of natural groups, a task called graph clustering, in such datasets is a ...
WG
2001
Springer
15 years 4 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
122
click to vote
PAMI
2007
14 years 11 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....