A Nyström spectral clustering algorithm based on probability incremental sampling

DOI10.1007/s00500-016-2160-8OpenAlexW2346765529MaRDI QIDQ1746805

Ming-Jing Du, Shifei Ding, HongJie Jia

Publication date: 26 April 2018

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-016-2160-8

zbMATH Keywords

Nyström methodspectral clusteringeigen-decompositionincremental sampling

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Related Items (2)

Non-convex low-rank representation combined with rank-one matrix sum for subspace clustering ⋮ FGC\_SS: fast graph clustering method by joint spectral embedding and improved spectral rotation

Cites Work

• Low-rank incremental methods for computing dominant singular subspaces
• Sparse spectral clustering method based on the incomplete Cholesky decomposition
• Semi-supervised Eigenvectors for Large-scale Locally-biased Learning
• Fast monte-carlo algorithms for finding low-rank approximations
• Selective sampling for approximate clustering of very large data sets

This page was built for publication: A Nyström spectral clustering algorithm based on probability incremental sampling