FGC\_SS: fast graph clustering method by joint spectral embedding and improved spectral rotation

DOI10.1016/j.ins.2022.08.109OpenAlexW4295016343MaRDI QIDQ6125220

No author found.

Publication date: 11 April 2024

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2022.08.109

zbMATH Keywords

bipartite graphclusteringgraph theoryspectral clusteringlarge scalecoordinate descentspectral rotation

Mathematics Subject Classification ID

Statistics (62-XX)

Cites Work

• Algorithm AS 136: A K-Means Clustering Algorithm
• Learning a Mahalanobis distance metric for data clustering and classification
• A Nyström spectral clustering algorithm based on probability incremental sampling
• GraphLSHC: towards large scale spectral hypergraph clustering
• A new distance with derivative information for functional \(k\)-means clustering algorithm
• Iteratively reweighted least squares minimization for sparse recovery
• Fast spectral clustering with self-weighted features

This page was built for publication: FGC\_SS: fast graph clustering method by joint spectral embedding and improved spectral rotation