961 search results - page 17 / 193 » Significance-Driven Graph Clustering |
104
click to vote
ESCAPE
2007
Springer
15 years 4 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 ...
122
Voted
ICPR
2008
IEEE
16 years 1 months 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...
117
click to vote
ICML
2004
IEEE
16 years 1 months ago
2004
IEEE
A critical problem in cluster ensemble research is how to combine multiple clusterings to yield a final superior clustering result. Leveraging advanced graph partitioning techniqu...
108
Voted
GD
2003
Springer
15 years 5 months ago
2003
Springer
We introduce an energy model whose minimum energy drawings reveal the clusters of the drawn graph. Here a cluster is a set of nodes with many internal edges and few edges to nodes ...
111
Voted
COLING
2010
14 years 7 months ago
2010
We consider the task of summarizing a cluster of related sentences with a short sentence which we call multi-sentence compression and present a simple approach based on shortest p...