scientific article; zbMATH DE number 7049775
From MaRDI portal
Publication:4633078
zbMath1485.68215MaRDI QIDQ4633078
Publication date: 2 May 2019
Full work available at URL: http://jmlr.csail.mit.edu/papers/v20/18-875.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational methods for sparse matrices (65F50) Learning and adaptive systems in artificial intelligence (68T05) Online algorithms; streaming algorithms (68W27)
Related Items (2)
Cites Work
- Unnamed Item
- Frequent Directions: Simple and Deterministic Matrix Sketching
- Computational Advertising: Techniques for Targeting Relevant Ads
- Dimensionality Reduction for k-Means Clustering and Low Rank Approximation
- Low-Rank Approximation and Regression in Input Sparsity Time
- Extensions of Lipschitz mappings into a Hilbert space
- Input Sparsity Time Low-rank Approximation via Ridge Leverage Score Sampling
- Stability of the Lanczos Method for Matrix Function Approximation
- Numerical linear algebra in the streaming model
- Optimal principal component analysis in distributed and streaming models
- Online Principal Components Analysis
- Relative Errors for Deterministic Low-Rank Matrix Approximations
- Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
- Turning Big data into tiny data: Constant-size coresets for k-means, PCA and projective clustering
This page was built for publication:
