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

DOI10.1002/SAM.10148OpenAlexW1989612325MaRDI QIDQ4969817FDOQ4969817

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

matrix factorizationscalabilitynon-negativitygraph mining

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

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

Uses Software

• Colibri
• OddBall

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)