Approximate spectral learning using Nystrom method

MaRDI QIDQ5279827zbMATH OpenFDO

Authors Aleksandar Trokicić

Publication date 19 July 2017

zbMATH Keywords

constrained clusteringNystrom methodspectral clusteringspectral learning

Mathematics Subject Classification ID

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

Recommendations

• Constrained spectral clustering via multi-layer graph embeddings on a Grassmann manifold
• On constrained spectral clustering and its applications
• Fast spectral clustering via the Nyström method
• Structural, Syntactic, and Statistical Pattern Recognition
• A semi-supervised spectral clustering algorithm based on pairwise constraints

Cited in

(7)

• Low-rank decomposition meets kernel learning: a generalized Nyström method
• 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
• On constrained spectral clustering and its applications
• Fast spectral clustering via the Nyström method
• Spectral Algorithms for Supervised Learning
• Spectral Norm in Learning Theory: Some Selected Topics

This page was built for publication: Approximate spectral learning using Nystrom method

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