Less is More: Sparse Graph Mining with Compact Matrix Decomposition
From MaRDI portal
Publication:4969614
DOI10.1002/sam.102OpenAlexW3083538725WikidataQ59551611 ScholiaQ59551611MaRDI QIDQ4969614
Jimeng Sun, Yinglian Xie, Hui Zhang, Christos Faloutsos
Publication date: 14 October 2020
Published in: Statistical Analysis and Data Mining: The ASA Data Science Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/sam.102
Related Items
Exemplar-based low-rank matrix decomposition for data clustering ⋮ A survey of multilinear subspace learning for tensor data ⋮ Fast and Accurate Proper Orthogonal Decomposition using Efficient Sampling and Iterative Techniques for Singular Value Decomposition
Cites Work
- Unnamed Item
- Unnamed Item
- A theory of pseudoskeleton approximations
- Relaxing the uniformity and independence assumptions using the concept of fractal dimension
- Latent semantic indexing: A probabilistic analysis
- Principal component analysis.
- Low-Rank Approximations with Sparse Factors I: Basic Algorithms and Error Analysis
- Stable distributions, pseudorandom generators, embeddings, and data stream computation
- Competitive recommendation systems
- Random sampling with a reservoir
- Fast computation of low rank matrix approximations
- Algorithm 844
- Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition