A review of Nyström methods for large-scale machine learning

This publication has 38 references indexed in Scilit:

• Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions
  SIAM Review, 2011
• CUR matrix decompositions for improved data analysis
  Proceedings of the National Academy of Sciences, 2009
• Spectral methods in machine learning and new strategies for very large datasets
  Proceedings of the National Academy of Sciences, 2009
• Density-Weighted Nyström Method for Computing Large Kernel Eigensystems
  Neural Computation, 2009
• Large-scale manifold learning
  2008
• Improved Nyström low-rank approximation and error analysis
  2008
• Matrix approximation and projective clustering via volume sampling
  2006
• Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
  SIAM Journal on Computing, 2006
• Spectral grouping using the nystrom method
  IEEE Transactions on Pattern Analysis and Machine Intelligence, 2004
• Fast Monte-Carlo algorithms for finding low-rank approximations
  2002