42 search results - page 1 / 9 » A fast kernel-based multilevel algorithm for graph clusterin... |
KDD
2005
ACM
14 years 4 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...
PAMI
2007
13 years 4 months ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
ICCS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. The divisive MinMaxCut algorithm of Ding et al. [3] produces more accurate clustering results than existing document cluster methods. Multilevel algorithms [4, 1, 5, 7] h...
SYNASC
2006
IEEE
13 years 10 months ago
2006
IEEE
Mining relational data often boils down to computing clusters, that is finding sub-communities of data elements forming cohesive sub-units, while being well separated from one an...
KDD
2009
ACM
14 years 5 months ago
2009
ACM
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...