Sparse spectral clustering method based on the incomplete Cholesky decomposition

DOI10.1016/J.CAM.2012.07.019zbMATH Open1252.65075OpenAlexW2024910401MaRDI QIDQ455836FDOQ455836

Authors: Katrijn Frederix, Marc van Barel 

Publication date: 22 October 2012

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2012.07.019

Recommendations

• Fast spectral clustering via the Nyström method
• scientific article; zbMATH DE number 6907452
• Approximating spectral clustering via sampling: a review
• Spectral methods for graph clustering - a survey
• Non-negative and sparse spectral clustering

zbMATH Keywords

spectral clusteringeigenvalue problemstructured matricesgraph Laplacian

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Cited In (4)

• A Nyström spectral clustering algorithm based on probability incremental sampling
• Fast kernel \(k\)-means clustering using incomplete Cholesky factorization
• Title not available (Why is that?)
• Community detection for hierarchical image segmentation

This page was built for publication: Sparse spectral clustering method based on the incomplete Cholesky decomposition

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