Non‐negative residual matrix factorization: problem definition, fast solutions, and applications

DOI10.1002/sam.10148OpenAlexW1989612325MaRDI QIDQ4969817

Ching-Yung Lin, Hanghang Tong

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.10148

zbMATH Keywords

scalabilitymatrix factorizationnon-negativitygraph mining

Mathematics Subject Classification ID

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

Uses Software

• Colibri
• OddBall

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• A note on the strong polynomiality of convex quadratic programming
• Fast computation of low-rank matrix approximations
• A Generalized Divergence Measure for Nonnegative Matrix Factorization
• The Structure and Function of Complex Networks
• Community structure in social and biological networks
• Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition

This page was built for publication: Non‐negative residual matrix factorization: problem definition, fast solutions, and applications