Less is More: Sparse Graph Mining with Compact Matrix Decomposition

DOI10.1002/SAM.102MaRDI QIDQ4969614zbMATH OpenOpenAlexWikidataFDO

Authors 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

zbMATH Keywords

data mininggraph miningmatrix decomposition

Mathematics Subject Classification ID

Statistics (62-XX) Computer science (68-XX)

Cites work

• A theory of pseudoskeleton approximations
• Algorithm 844
• Competitive recommendation systems
• Data streams: algorithms and applications.
• Fast computation of low rank matrix approximations
• 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
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• Latent semantic indexing: A probabilistic analysis
• Low-rank approximations with sparse factors. I: Basic algorithms and error analysis
• Principal component analysis.
• Random sampling with a reservoir
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• Stable distributions, pseudorandom generators, embeddings, and data stream computation

Cited in

(3)

• Exemplar-based low-rank matrix decomposition for data clustering
• Fast and Accurate Proper Orthogonal Decomposition using Efficient Sampling and Iterative Techniques for Singular Value Decomposition
• A survey of multilinear subspace learning for tensor data

This page was built for publication: Less is More: Sparse Graph Mining with Compact Matrix Decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4969614)