Fetching the paper…
Reading the bibliography…
The Nystrom method is an efficient technique to speed up large-scale learning applications by generating low-rank approximations.
The MNIST database of handwritten digits, 1998
Yann LeCun and Corinna Cortes · 1998
Earlier work this paper cites.
Ridge regression learning algorithm in dual variables
Craig Saunders, Alexander Gammerman, and Volodya Vovk · 1998
Earlier work this paper cites.
Nonlinear component analysis as a kernel eigenvalue problem
Bernhard Schölkopf, Alexander Smola, and Klaus-Robert Müller · 1998
Earlier work this paper cites.
Random vectors in the isotropic position
Mark Rudelson · 1999
Earlier work this paper cites.
Using the Nyström method to speed up kernel machines
Christopher K. I. Williams and Matthias Seeger · 2000
Earlier work this paper cites.
On spectral clustering: analysis and an algorithm
Andrew Y. Ng, Michael I. Jordan, and Yair Weiss · 2001
Earlier work this paper cites.
The CMU pose, illumination, and expression database
Terence Sim, Simon Baker, and Maan Bsat · 2002
Earlier work this paper cites.
Global versus local methods in nonlinear dimensionality reduction
Vin de Silva and Joshua Tenenbaum · 2003
Earlier work this paper cites.
Spectral grouping using the Nyström method
Charless Fowlkes, Serge Belongie, Fan Chung, and Jitendra Malik · 2004
Earlier work this paper cites.
Fast embedding of sparse similarity graphs
John C. Platt · 2004
Cited alongside, same era.
On the Nyström method for approximating a gram matrix for improved kernel-based learning
Petros Drineas and Michael W. Mahoney · 2005
Cited alongside, same era.
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
Emmanuel J. Candès, Justin K. Romberg, and Terence Tao · 2006
Cited alongside, same era.
Compressed sensing
David L. Donoho · 2006
Cited alongside, same era.
Towards the identification of essential genes using targeted genome sequencing and comparative analysis
A. Gustafson, E. Snitkin, S. Parker, C. DeLisi, and S. Kasif · 2006
Cited alongside, same era.
UCI machine learning repository, 2007
A. Asuncion and D.J. Newman · 2007
Cited alongside, same era.
Improved Nyström low-rank approximation and error analysis
Kai Zhang, Ivor Tsang, and James Kwok · 2008
Later among the works it cites.
Spectral methods in machine learning and new strategies for very large datasets
M. A. Belabbas and P. J. Wolfe · 2009
Later among the works it cites.
Exact matrix completion via convex optimization
Emmanuel J. Candès and Benjamin Recht · 2009
Later among the works it cites.
The power of convex relaxation: Near-optimal matrix completion
Emmanuel J. Candès and Terence Tao · 2009
Later among the works it cites.
Semi-supervised learning in gigantic image collections
Rob Fergus, Yair Weiss, and Antonio Torralba · 2009
Later among the works it cites.
Ensemble Nyström method
Sanjiv Kumar, Mehryar Mohri, and Ameet Talwalkar · 2009
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Sparsity and incoherence in compressive sampling
E. J. Candès and J. Romberg · 2007
Cited alongside, same era.
Large-scale manifold learning
Ameet Talwalkar, Sanjiv Kumar, and Henry Rowley · 2008
Cited alongside, same era.
Later among the works it cites.
On sampling-based approximate spectral decomposition
Sanjiv Kumar, Mehryar Mohri, and Ameet Talwalkar · 2009
Later among the works it cites.
Sampling techniques for Nyström method
Sanjiv Kumar, Mehryar Mohri, and Ameet Talwalkar · 2009
Later among the works it cites.