On landmark selection and sampling in high-dimensional data analysis

DOI10.1098/RSTA.2009.0161zbMATH Open1185.62005OpenAlexW3105846425WikidataQ33508770 ScholiaQ33508770MaRDI QIDQ3559947FDOQ3559947

Authors: Mohamed-Ali Belabbas, P. J. Wolfe 

Publication date: 8 May 2010

Published in: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL: https://europepmc.org/articles/pmc2865880

Recommendations

• Open problems in spectral dimensionality reduction
• Large-scale SVD and manifold learning
• Learning Eigenfunctions Links Spectral Embedding and Kernel PCA
• Dimension reduction: a guided tour
• Fast spectral clustering via the Nyström method

zbMATH Keywords

dimension reductionmachine learningkernel methodslow-rank approximationNyström extension

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Eigenvalues, singular values, and eigenvectors (15A18) Computing methodologies for image processing (68U10)

Cites Work

• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• Hessian eigenmaps: Locally linear embedding techniques for high-dimensional data
• Density-Weighted Nyström Method for Computing Large Kernel Eigensystems

Cited In (6)

• Optimal operator space pursuit: a framework for video sequence data analysis
• Finding representative landmarks of data on manifolds
• Optimal landmark point selection using clustering for manifold modeling and data classification
• Scalability and robustness of spectral embedding: landmark diffusion is all you need
• Making sense of big data
• Determinantal reinforcement learning with techniques to avoid poor local optima

This page was built for publication: On landmark selection and sampling in high-dimensional data analysis

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