The Improved Non-negative Matrix Factorization Algorithm for Document Clustering
Non-negative Matrix Factorization (NMF) is one latest presented approach for obtaining document clusters, which aimed to provide a minimum error non-negative representation of the term-document matrix. In this paper, we have extended the classical NMF approach by imposing sparseness constraints explicitly. The new model can learn much sparser matrix factorization. Also, an objective function is defined to impose the sparseness constraint, in addition to the nonnegative constraint Experimental results on realworld document datasets show that the proposed method can treat document clustering effectively and efficiently.
Weizhong Zhao Huifang Ma Qing He Zhongzhi Shi
College of Information Engineering, Xiangtan University, Hunan 411105 China Key Laboratory of Intell College of Mathematics and Information, Northwest Normal University, Gansu, China Key Laboratory of Intelligent Information Processing, Institute of Computing Technology, Chinese Aca
国际会议
上海
英文
1886-1889
2011-07-26(万方平台首次上网日期,不代表论文的发表时间)