Multiple graph regularized nonnegative matrix factorization
DOI10.1016/j.patcog.2013.03.007zbMath1323.68460OpenAlexW1994251758MaRDI QIDQ888579
Jim Jing-Yan Wang, Halima Bensmail, Xin Gao
Publication date: 2 November 2015
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2013.03.007
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Medical applications (general) (92C50) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (11)
Cites Work
- Group coordinate descent algorithms for nonconvex penalized regression
- Using underapproximations for sparse nonnegative matrix factorization
- Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
- Inexact block coordinate descent methods with application to non-negative matrix factorization
- NeNMF: An Optimal Gradient Method for Nonnegative Matrix Factorization
This page was built for publication: Multiple graph regularized nonnegative matrix factorization