Pairwise constrained concept factorization for data representation

doi:10.1016/j.neunet.2013.12.007

2014-04-01

PRE

DOI：10.1016/j.neunet.2013.12.007

原文链接

原文求助

摘要

En 中文

Concept factorization (CF) is a variant of non-negative matrix factorization (NMF). In CF, each concept is represented by a linear combination of data points, and each data point is represented by a linear combination of concepts. More specifically, each concept is represented by more than one data point with different weights, and each data point carries various weights called membership to represent their degrees belonging to that concept. However, CF is actually an unsupervised method without making use of prior information of the data. In this paper, we propose a novel semi-supervised concept factorization method, called Pairwise Constrained Concept Factorization (PCCF), which incorporates pairwise constraints into the CF framework. We expect that data points which have pairwise must-link constraints should have the same class label as much as possible, while data points with pairwise cannot-link constraints will have different class labels as much as possible. Due to the incorporation of the pairwise constraints, the learning quality of the CF has been significantly enhanced. Experimental results show the effectiveness of our proposed novel method in comparison to the state-of-the-art algorithms on several real world applications. Crown Copyright (C) 2013 Published by Elsevier Ltd. All rights reserved.

Keyword:

Concept factorization

Clustering

Pairwise constraints

Data representation