Integer matrix approximation and data mining
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- 10.1162/153244303322753616
- Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework
- Closest point search in lattices
- Decomposing gene expression into cellular processes
- Discrete Eckart-Young theorem for integer matrices
- Elements of Information Theory
- Fast nonnegative matrix factorization: an active-set-like method and comparisons
- Low-Dimensional Polytope Approximation and Its Applications to Nonnegative Matrix Factorization
- Non-negative matrix factorization with sparseness constraints
- Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
- Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis
- Solving ellipsoid-constrained integer least squares problems
- Using underapproximations for sparse nonnegative matrix factorization
Cited in
(4)- scientific article; zbMATH DE number 5161643 (Why is no real title available?)
- A proof of a conjecture of Gyárfás, Lehel, Sárközy and Schelp on Berge-cycles
- An Alternating Rank-k Nonnegative Least Squares Framework (ARkNLS) for Nonnegative Matrix Factorization
- Mining order-preserving submatrices from probabilistic matrices
This page was built for publication: Integer matrix approximation and data mining
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1747623)