Spectral Clustering
Spectral clustering is an unsupervised machine learning technique that groups data points into clusters based on their similarity, often represented as a graph. Current research focuses on improving efficiency for large datasets, extending spectral clustering to non-Euclidean spaces (like hyperbolic spaces) and complex data types (e.g., time-evolving networks, 3D point clouds, and mixed categorical/numerical data), and enhancing robustness to noise and outliers through techniques like rank statistics and graph learning. These advancements are significant because they broaden the applicability of spectral clustering to diverse real-world problems in fields such as speaker diarization, image segmentation, and network analysis, improving both accuracy and scalability.
Papers
On the Robustness of Spectral Algorithms for Semirandom Stochastic Block Models
Aditya Bhaskara, Agastya Vibhuti Jha, Michael Kapralov, Naren Sarayu Manoj, Davide Mazzali, Weronika Wrzos-Kaminska
PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms
Etienne Lasalle (OCKHAM), Rémi Vaudaine (OCKHAM), Titouan Vayer (OCKHAM), Pierre Borgnat (Phys-ENS), Rémi Gribonval (OCKHAM), Paulo Gonçalves (OCKHAM), Màrton Karsai (CEU)