Sciweavers

3068 search results - page 9 / 614
» Clustering with Multiple Graphs
Sort
View
IJON
2010
94views more  IJON 2010»
13 years 6 months ago
Optimizing an organized modularity measure for topographic graph clustering: A deterministic annealing approach
This paper proposes an organized generalization of Newman and Girvan’s modularity measure for graph clustering. Optimized via a deterministic annealing scheme, this measure prod...
Fabrice Rossi, Nathalie Villa-Vialaneix
JDA
2006
98views more  JDA 2006»
13 years 8 months ago
Completely connected clustered graphs
Abstract. Planar drawings of clustered graphs are considered. We introduce the notion of completely connected clustered graphs, i.e. hierarchically clustered graphs that have the p...
Sabine Cornelsen, Dorothea Wagner
PKDD
2004
Springer
138views Data Mining» more  PKDD 2004»
14 years 1 months ago
Combining Multiple Clustering Systems
Three methods for combining multiple clustering systems are presented and evaluated, focusing on the problem of finding the correspondence between clusters of different systems. ...
Constantinos Boulis, Mari Ostendorf
MM
2004
ACM
195views Multimedia» more  MM 2004»
14 years 1 months ago
Hierarchical clustering of WWW image search results using visual, textual and link information
We consider the problem of clustering Web image search results. Generally, the image search results returned by an image search engine contain multiple topics. Organizing the resu...
Deng Cai, Xiaofei He, Zhiwei Li, Wei-Ying Ma, Ji-R...
WG
2010
Springer
13 years 6 months ago
Generalized Graph Clustering: Recognizing (p, q)-Cluster Graphs
Cluster Editing is a classical graph theoretic approach to tackle the problem of data set clustering: it consists of modifying a similarity graph into a disjoint union of cliques,...
Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlo...