非负矩阵分解
计算机科学
聚类分析
矩阵分解
光学(聚焦)
核(代数)
基质(化学分析)
正多边形
算法
非负矩阵
基础(线性代数)
人工智能
数学
模式识别(心理学)
对称矩阵
组合数学
量子力学
光学
物理
特征向量
复合材料
几何学
材料科学
作者
Chris H. Q. Ding,Tao Li,Michael I. Jordan
标识
DOI:10.1109/tpami.2008.277
摘要
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.
科研通智能强力驱动
Strongly Powered by AbleSci AI