Graph clustering by hierarchical singular value decomposition with selectable range for number of clusters members

MaRDI QIDQ5164978zbMATH OpenFDO

Authors Azam Sadeghian, S. A. S. Fazeli, Seyed Mehdi Karbassi

Publication date 15 November 2021

Full work available at URL http://ijmsi.ir/article-1-1274-en.html

zbMATH Keywords

graph clusteringhierarchical clusteringselectable clusters numbersingular value decomposition

Mathematics Subject Classification ID

Algorithms in computer science (68W99)

Recommendations

• Clustering large graphs via the singular value decomposition
• scientific article; zbMATH DE number 1305418
• Analysis of the singular value decomposition as a tool for processing microarray expression data
• Spectral methods for graph clustering - a survey
• Graph Clustering and Minimum Cut Trees

Cites work

• Accurate Singular Value Decompositions of Structured Matrices
• Data Mining and Knowledge Discovery Handbook
• Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
• Graph clustering
• Improving the Accuracy of Computed Singular Values
• Iterative methods for low rank approximation of graph similarity matrices
• Numerical linear algebra and applications
• Singular value decomposition and least squares solutions
• SVD-based incremental approaches for recommender systems

This page was built for publication: Graph clustering by hierarchical singular value decomposition with selectable range for number of clusters members

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5164978)