Spectral Subspace Clustering for Attributed Graphs

2024/11/17 by Lin, Xiaoyang, Yang, Renchi, Zheng, Haoran +1 · 1 citation
#FOS: Computer and information sciences #Machine Learning (cs.LG) #Social and Information Networks (cs.SI)

paper · doi:10.48550/arxiv.2411.11074

Abstract

Subspace clustering seeks to identify subspaces that segment a set of n data points into k (k<

Cited by

• Effective Clustering for Large Multi-Relational Graphs

Related

• Partitioning Well-Clustered Graphs: Spectral Clustering Works!
• Subspace Clustering via Thresholding and Spectral Clustering
• The Mathematics Behind Spectral Clustering And The Equivalence To PCA
• Subspace Clustering through Sub-Clusters
• Certifying Global Optimality of Graph Cuts via Semidefinite Relaxation: A Performance Guarantee for Spectral Clustering