Approximating a Gram Matrix for Improved Kernel-Based Learning
Authors:
- 1 January 2005
- book chapter
- Published by Springer Nature
- p. 323-337
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms2005
- Spectral grouping using the nystrom methodIEEE Transactions on Pattern Analysis and Machine Intelligence, 2004
- Laplacian Eigenmaps for Dimensionality Reduction and Data RepresentationNeural Computation, 2003
- Hessian eigenmaps: Locally linear embedding techniques for high-dimensional dataProceedings of the National Academy of Sciences, 2003
- Fast computation of low rank matrix approximations2001
- Spectral analysis of data2001
- Fast Monte-Carlo algorithms for approximate matrix multiplication2001
- An Introduction to Support Vector Machines and Other Kernel-based Learning Methods2000
- 10.1162/15324430260185619Applied Physics Letters, 2000
- Computational Methods for Integral Equations1985