Constrained neighborhood preserving concept factorization for data representation

详细信息    查看全文

• 作者：Mei Lu ; ¹ ; ² ; ^a ; ^b ; ^{louisazhaoxiaolu@sina.com.cn" class="auth_mail" title="E-mail the corresponding author} ; Li Zhang¹ ; ^a ; Xiang-Jun Zhao² ; ^b ; Fan-Zhang Li¹ ; ^a
• 关键词：Concept factorization ; Locally consistent concept factorization ; Semi-supervised document clustering ; Neighborhood preserving ; Data representation
• 刊名：Knowledge-Based Systems
• 出版年：2016
• 出版时间：15 June 2016
• 年：2016
• 卷：102
• 期：Complete
• 页码：127-139
• 全文大小：626 K

文摘

Matrix factorization based techniques, such as nonnegative matrix factorization (NMF) and concept factorization (CF), have attracted a great deal of attentions in recent years, mainly due to their ability of dimension reduction and sparse data representation. Both techniques are of unsupervised nature and thus do not make use of a priori knowledge to guide the clustering process. This could lead to inferior performance in some scenarios. As a remedy to this, a semi-supervised learning method called Pairwise Constrained Concept Factorization (PCCF) was introduced to incorporate some pairwise constraints into the CF framework. Despite its improved performance, PCCF uses only a priori knowledge and neglects the proximity information of the whole data distribution; this could lead to rather poor performance (although slightly improved comparing to CF) when only limited a priori information is available. To address this issue, we propose in this paper a novel method called Constrained Neighborhood Preserving Concept Factorization (CNPCF). CNPCF utilizes both a priori knowledge and local geometric structure of the dataset to guide its clustering. Experimental studies on three real-world clustering tasks demonstrate that our method yields a better data representation and achieves much improved clustering performance in terms of accuracy and mutual information comparing to the state-of-the-arts techniques.