The kernel semi-least squares method for sparse distance approximation

DOI10.1162/NECO_A_00401MaRDI QIDQ5327182zbMATH OpenWikidataFDO

Authors Samuel Epstein, Margrit Betke

Publication date 7 August 2013

Published in Neural Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1162/NECO_A_00401

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10)

Recommendations

• Kernel regression with sparse metric learning
• Sparse distance metric learning
• Learning Theory
• On the Nyström method for approximating a gram matrix for improved kernel-based learning
• A sparse least squares support vector machine

Cites work

• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation

Cited in

(4)

• Sparse Sourcewise and Pairwise Distance Preservers
• Sparse Approximation of a Kernel Mean
• A kernel distance-based representative subset selection method
• scientific article; zbMATH DE number 7758314 (Why is no real title available?)

This page was built for publication: The kernel semi-least squares method for sparse distance approximation

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