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

DOI10.1002/SAM.10148MaRDI QIDQ4969817zbMATH OpenOpenAlexFDO

Authors Hanghang Tong, Ching-Yung Lin

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

graph miningmatrix factorizationnon-negativityscalability

Mathematics Subject Classification ID

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

Cites work

• A Generalized Divergence Measure for Nonnegative Matrix Factorization
• A note on the strong polynomiality of convex quadratic programming
• Community structure in social and biological networks
• Fast computation of low-rank matrix approximations
• Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
• scientific article; zbMATH DE number 6474901 (Why is no real title available?)
• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• Non-negative matrix factorization with sparseness constraints
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• The Structure and Function of Complex Networks

Cited in

(1)

• Non-negative matrix factorization: Ill-posedness and a geometric algorithm

Describes a project that uses

Uses Software

• OddBall
• Colibri

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

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