4009 search results - page 25 / 802 » Clustering on Complex Graphs |
ESCAPE
2007
Springer
15 years 3 months ago
2007
Springer
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...
112
click to vote
ICPR
2008
IEEE
16 years 29 days ago
2008
IEEE
Many existing spectral clustering algorithms share a conventional graph partitioning criterion: normalized cuts (NC). However, one problem with NC is that it poorly captures the g...
PRL
1998
14 years 11 months ago
1998
In this paper we propose an encoding scheme and ad hoc operators for a genetic approach to hierarchical graph clustering. Given a connected graph whose vertices correspond to poin...
112
click to vote
SSDBM
2007
IEEE
15 years 6 months ago
2007
IEEE
In high dimensional data, clusters often only exist in arbitrarily oriented subspaces of the feature space. In addition, these so-called correlation clusters may have complex rela...
BIBE
2009
IEEE
15 years 3 months ago
2009
IEEE
—The Possibilistic Latent Variable (PLV) clustering algorithm is a powerful tool for the analysis of complex datasets due to its robustness toward data distributions of different...