Fast Nyström for Low Rank Matrix Approximation

Huaxiang Zhang; Zhichao Wang; Linlin Cao

doi:10.1007/978-3-642-35527-1_38

ScienceGate Book Chapters

BOOK-CHAPTER

Fast Nyström for Low Rank Matrix Approximation

Huaxiang Zhang Zhichao Wang Linlin Cao

Year: 2012 Lecture notes in computer science Pages: 456-464 Publisher: Springer Science+Business Media

DOI: 10.1007/978-3-642-35527-1_38

Get Full-Text PDF Get Analytical Report

Keywords:

Kernel (algebra) Nyström method Rank (graph theory) Computer science Low-rank approximation Matrix (chemical analysis) Algorithm Kernel method Approximation algorithm Mathematical optimization Mathematics Artificial intelligence Support vector machine Discrete mathematics Combinatorics Integral equation

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.01

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Sparse and Compressive Sensing Techniques

Physical Sciences → Engineering → Computational Mechanics

Matrix Theory and Algorithms

Physical Sciences → Computer Science → Computational Theory and Mathematics

Statistical and numerical algorithms

Physical Sciences → Mathematics → Applied Mathematics

Fast Nyström for Low Rank Matrix Approximation

Metrics

Topics

Related Documents

Graph-Regularized Fast Low-Rank Matrix Approximation Using The NystrÖM Method for Clustering

Fast multiple rank-constrained matrix approximation

Deterministic Column Sampling for Low-Rank Matrix Approximation: Nyström vs. Incomplete Cholesky Decomposition

Adaptive Sampling and Fast Low-Rank Matrix Approximation

Improved Nyström low-rank approximation and error analysis