Multiple graph regularized nonnegative matrix factorization
From MaRDI portal
Publication:888579
DOI10.1016/j.patcog.2013.03.007zbMath1323.68460MaRDI 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
nonnegative matrix factorization; data representation; graph Laplacian; ensemble manifold regularization
68T05: Learning and adaptive systems in artificial intelligence
68T10: Pattern recognition, speech recognition
92C50: Medical applications (general)
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Multiple graph regularized graph transduction via greedy gradient Max-Cut, Max-min distance nonnegative matrix factorization, Detecting communities in 2-mode networks via fast nonnegative matrix trifactorization, Matrixized learning machine with modified pairwise constraints, Low-rank matrix factorization with multiple hypergraph regularizer, Robust structure preserving nonnegative matrix factorization for dimensionality reduction, Adaptive multiple graph regularized semi-supervised extreme learning machine, Graph regularized nonnegative matrix factorization for temporal link prediction in dynamic networks, Multi-manifold matrix decomposition for data co-clustering, Nonnegative matrix factorization with Hessian regularizer, Orthogonal optimal reverse prediction for semi-supervised learning
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
