Convex and Semi-Nonnegative Matrix Factorizations
Top Cited Papers
- 21 November 2008
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 32 (1) , 45-55
- https://doi.org/10.1109/tpami.2008.277
Abstract
We present several new variations on the theme of nonnegative matrix factorization (NMF). Considering factorizations of the form X = FGT, we focus on algorithms in which G is restricted to containing nonnegative entries, but allowing the data matrix X to have mixed signs, thus extending the applicable range of NMF methods. We also consider algorithms in which the basis vectors of F are constrained to be convex combinations of the data points. This is used for a kernel extension of NMF. We provide algorithms for computing these new factorizations and we provide supporting theoretical analysis. We also analyze the relationships between our algorithms and clustering algorithms, and consider the implications for sparseness of solutions. Finally, we present experimental results that explore the properties of these new methods.Keywords
This publication has 23 references indexed in Scilit:
- Ensemble non-negative matrix factorization methods for clustering protein–protein interactionsBioinformatics, 2008
- Algorithms and applications for approximate nonnegative matrix factorizationComputational Statistics & Data Analysis, 2007
- Sparse non-negative matrix factorizations via alternating non-negativity-constrained least squares for microarray data analysisBioinformatics, 2007
- Sparse Principal Component AnalysisJournal of Computational and Graphical Statistics, 2006
- Learning spatially localized, parts-based representationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A general model for clustering binary dataPublished by Association for Computing Machinery (ACM) ,2005
- IFD: Iterative Feature and Data ClusteringPublished by Society for Industrial & Applied Mathematics (SIAM) ,2004
- K-means clustering via principal component analysisPublished by Association for Computing Machinery (ACM) ,2004
- Low-Rank Approximations with Sparse Factors II: Penalized Methods with Discrete Newton-Like IterationsSIAM Journal on Matrix Analysis and Applications, 2004
- Positive matrix factorization applied to a curve resolution problemJournal of Chemometrics, 1998