Sciweavers

Share
PAKDD
2007
ACM

Graph Nodes Clustering Based on the Commute-Time Kernel

9 years 12 days ago
Graph Nodes Clustering Based on the Commute-Time Kernel
This work presents a kernel method for clustering the nodes of a weighted, undirected, graph. The algorithm is based on a two-step procedure. First, the sigmoid commute-time kernel (KCT), providing a similarity measure between any couple of nodes by taking the indirect links into account, is computed from the adjacency matrix of the graph. Then, the nodes of the graph are clustered by performing a kernel kmeans or fuzzy k-means on this CT kernel matrix. For this purpose, a new, simple, version of the kernel k-means and the kernel fuzzy kmeans is introduced. The joint use of the CT kernel matrix and kernel clustering appears to be quite successful. Indeed, it provides good results on a document clustering problem involving the newsgroups database.
Luh Yen, François Fouss, Christine Decaeste
Added 09 Jun 2010
Updated 09 Jun 2010
Type Conference
Year 2007
Where PAKDD
Authors Luh Yen, François Fouss, Christine Decaestecker, Pascal Francq, Marco Saerens
Comments (0)
books