Graph nodes clustering based on the commute-time kernel

Authors:
Luh Yen;Francois Fouss;Christine Decaestecker;Pascal Francq;Marco Saerens
Affiliations:
Université catholique de Louvain, ISYS, IAG, Louvain-la-Neuve, Belgium;Université catholique de Louvain, ISYS, IAG, Louvain-la-Neuve, Belgium;Université libre de Bruxelles, Institut de Pharmacie, Bruxelles, Belgium;Université libre de Bruxelles, STIC, Bruxelles, Belgium;Université catholique de Louvain, ISYS, IAG, Louvain-la-Neuve, Belgium
Venue:
PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
Year:
2007

Citing 14
Cited 9

Concept decompositions for large sparse text data using clustering

Machine Learning
Bipartite graph partitioning and data clustering

Proceedings of the tenth international conference on Information and knowledge management
Fuzzy C-Means Clustering Algorithm Based on Kernel Method

ICCIMA '03 Proceedings of the 5th International Conference on Computational Intelligence and Multimedia Applications
Survey of Text Mining

Survey of Text Mining
Kernel Methods for Pattern Analysis

Kernel Methods for Pattern Analysis
Clustering Large Graphs via the Singular Value Decomposition

Machine Learning
Kernel k-means: spectral clustering and normalized cuts

Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Linearized cluster assignment via spectral ordering

ICML '04 Proceedings of the twenty-first international conference on Machine learning
Text Mining: Predictive Methods for Analyzing Unstructured Information

Text Mining: Predictive Methods for Analyzing Unstructured Information
Random-Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation

IEEE Transactions on Knowledge and Data Engineering
Cluster Analysis

Cluster Analysis
Rapid and brief communication: Evaluation of the performance of clustering algorithms in kernel-induced feature space

Pattern Recognition
A novel kernelized fuzzy C-means algorithm with application in medical image segmentation

Artificial Intelligence in Medicine
Mercer kernel-based clustering in feature space

IEEE Transactions on Neural Networks

A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances

Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Graph nodes clustering with the sigmoid commute-time kernel: A comparative study

Data & Knowledge Engineering
WIT: web people search disambiguation using random walks

SemEval '07 Proceedings of the 4th International Workshop on Semantic Evaluations
Affinity measures based on the graph Laplacian

TextGraphs-3 Proceedings of the 3rd Textgraphs Workshop on Graph-Based Algorithms for Natural Language Processing
Interior distance using barycentric coordinates

SGP '09 Proceedings of the Symposium on Geometry Processing
Biharmonic distance

ACM Transactions on Graphics (TOG)
Semi-supervised classification and betweenness computation on large, sparse, directed graphs

Pattern Recognition
An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification

Neural Networks
A novel material-aware feature descriptor for volumetric image registration in diffusion tensor space

ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part IV

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 k-means 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.