.png){kind=icon}
返回
Nonnegative Matrix Factorization on Orthogonal Subspace
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2009.12.023.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Nonnegative Matrix Factorization (NMF), a parts-based representation using two small factor matrices to approximate an input data matrix, has been widely used in data mining, pattern recognition and signal processing. Orthogonal NMF which imposes orthogonality constraints; on the factor matrices can improve clustering performance. However, the existing orthogonal NMF algorithms are either computationally expensive or have to incorporate prior information to achieve orthogonality. In our research, we propose an algorithm called Nonnegative Matrix Factorization on Orthogonal Subspace (NMFOS), in which the generation of orthogonal factor matrices is part of objective function minimization. Thus, orthogonality is achieved without resorting to additional constraints, and the computational complexity is decreased. We develop two algorithms based on the Euclidean distance metric and the generalized Kullback-Leibler divergence, respectively. Experiments on 10 document datasets show that NMFOS improves clustering accuracy. On a facial image database, NMFOS achieves a better parts-based representation with a significant reduction in computational complexity. (c) 2010 Elsevier B.V. All rights reserved.
Keyword:
Nonnegative Matrix Factorization
Orthogonality
Clustering
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
8.0K
被引数:
1.6W
机构
引用论文
.png){kind=icon}
分享收藏Physiological Arousal of Beginning Counselors In Relation To Disabled And Non-Disabled Clients与残疾和非残疾客户有关的初级辅导员的生理唤醒
PREAI
分享收藏
查看更多内容