Fast Spectral Clustering via the Nyström Method

DOI10.1007/978-3-642-40935-6_26zbMath1407.62225OpenAlexW137313310MaRDI QIDQ2859233

Claire Monteleoni, Hyungtae Kim, Tony Jebara, Mahesh Mohan, Anna Choromanska

Publication date: 6 November 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40935-6_26

zbMATH Keywords

samplingperformance guaranteeserror boundsunsupervised learningNyström methodsparsityspectral clusteringlarge-scale clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (4)

Fast spectral clustering with self-weighted features ⋮ Algebraic multiscale grid coarsening using unsupervised machine learning for subsurface flow simulation ⋮ Feature uncertainty bounds for explicit feature maps and large robust nonlinear SVM classifiers ⋮ Constrained spectral clustering via multi-layer graph embeddings on a Grassmann manifold

This page was built for publication: Fast Spectral Clustering via the Nyström Method