2137 search results - page 1 / 428 » Experiments on Graph Clustering Algorithms |
ESA
2003
Springer
15 years 2 months ago
2003
Springer
A promising approach to graph clustering is based on the intuitive notion of intra-cluster density vs. inter-cluster sparsity. While both formalizations and algorithms focusing on ...
102
click to vote
WADS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Algorithms or target functions for graph clustering rarely admit quality guarantees or optimal results in general. Based on properties of minimum-cut trees, a clustering ...
WAW
2009
Springer
15 years 4 months ago
2009
Springer
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
KDD
2005
ACM
15 years 10 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
102
click to vote
APBC
2004
14 years 11 months ago
2004
Huge amount of gene expression data have been generated as a result of the human genomic project. Clustering has been used extensively in mining these gene expression data to find...