Low-rank matrix approximation with manifold regularization
This paper proposes a new model of low-rank matrix factorization that incorporates manifold regularization to the matrix factorization. Superior to the graph-regularized nonnegative matrix factorization, this new regularization model has globally optimal and closed-form solutions. A direct algorithm...
Publié dans: | IEEE transactions on pattern analysis and machine intelligence. - 1979. - 35(2013), 7 vom: 15. Juli, Seite 1717-29 |
---|---|
Auteur principal: | |
Autres auteurs: | |
Format: | Article en ligne |
Langue: | English |
Publié: |
2013
|
Accès à la collection: | IEEE transactions on pattern analysis and machine intelligence |
Sujets: | Journal Article Research Support, Non-U.S. Gov't |
Résumé: | This paper proposes a new model of low-rank matrix factorization that incorporates manifold regularization to the matrix factorization. Superior to the graph-regularized nonnegative matrix factorization, this new regularization model has globally optimal and closed-form solutions. A direct algorithm (for data with small number of points) and an alternate iterative algorithm with inexact inner iteration (for large scale data) are proposed to solve the new model. A convergence analysis establishes the global convergence of the iterative algorithm. The efficiency and precision of the algorithm are demonstrated numerically through applications to six real-world datasets on clustering and classification. Performance comparison with existing algorithms shows the effectiveness of the proposed method for low-rank factorization in general |
---|---|
Description: | Date Completed 30.12.2013 Date Revised 17.05.2013 published: Print Citation Status MEDLINE |
ISSN: | 1939-3539 |
DOI: | 10.1109/TPAMI.2012.274 |