Multilevel Hierarchical Kernel Spectral Clustering for Real-Life Large Scale Complex Networks
Raghvendra Mall, Rocco Langone, Johan A.K. Suykens

TL;DR
This paper introduces a multilevel hierarchical kernel spectral clustering method tailored for large-scale complex networks, enabling efficient detection of multi-level community structures with high quality at various granularities.
Contribution
The paper presents a novel hierarchical clustering approach based on kernel spectral clustering that automatically determines multiple hierarchy levels in large networks.
Findings
Effective detection of multi-level hierarchies in real-world networks
Outperforms state-of-the-art methods like Louvain, OSLOM, and Infomap
Identifies high-quality clusters at multiple scales
Abstract
Kernel spectral clustering corresponds to a weighted kernel principal component analysis problem in a constrained optimization framework. The primal formulation leads to an eigen-decomposition of a centered Laplacian matrix at the dual level. The dual formulation allows to build a model on a representative subgraph of the large scale network in the training phase and the model parameters are estimated in the validation stage. The KSC model has a powerful out-of-sample extension property which allows cluster affiliation for the unseen nodes of the big data network. In this paper we exploit the structure of the projections in the eigenspace during the validation stage to automatically determine a set of increasing distance thresholds. We use these distance thresholds in the test phase to obtain multiple levels of hierarchy for the large scale network. The hierarchical structure in the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
