961 search results - page 27 / 193 » Significance-Driven Graph Clustering |
133
Voted
CVPR
2012
IEEE
13 years 3 months ago
2012
IEEE
Constructing a good graph to represent data structures is critical for many important machine learning tasks such as clustering and classification. This paper proposes a novel no...
117
Voted
ASUNAM
2011
IEEE
14 years 17 days ago
2011
IEEE
—In this paper, we study the problem of evolutionary clustering of multi-typed objects in a heterogeneous bibliographic network. The traditional methods of homogeneous clustering...
123
click to vote
COLT
2004
Springer
15 years 6 months ago
2004
Springer
Given a set of n randomly drawn sample points, spectral clustering in its simplest form uses the second eigenvector of the graph Laplacian matrix, constructed on the similarity gra...
112
click to vote
PAMI
2007
15 years 2 days ago
2007
—We develop a new graph-theoretic approach for pairwise data clustering which is motivated by the analogies between the intuitive concept of a cluster and that of a dominant set ...
90
Voted
MST
2010
14 years 11 months ago
2010
We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. In the unweighted...