Convex and semi-nonnegative matrix factorizations
Related Experiment Videos
Chris Ding1, Tao Li, Michael I Jordan
1Department of Computer Science and Engineering, University of Texas at Arlington, Nedderman Hall, Room 307, 416 YatesStreet, Arlington, TX 76019, USA. CHQDing@uta.edu
Abstract:
We present several new variations on the theme of nonnegative matrix factorization (NMF). Considering factorizations of the form X=FG(T), 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.
Related Concept Videos
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Vector Algebra: Method of Components
In many applications, the magnitudes and directions of...
Quadratic Models
Compacting Factor test
The procedure begins by placing concrete into the upper hopper without any compaction. Once filled, the bottom door of this hopper is opened,...
Gaussian Elimination: Problem Solving
Partial Fractions