Semi-Supervised Clustering Based on Exemplars Constraints

Sailan WANG  Zhenzhi YANG  Jin YANG  Hongjun WANG  

IEICE TRANSACTIONS on Information and Systems   Vol.E100-D   No.6   pp.1231-1241
Publication Date: 2017/06/01
Publicized: 2017/03/21
Online ISSN: 1745-1361
DOI: 10.1587/transinf.2016EDP7201
Type of Manuscript: PAPER
Category: Artificial Intelligence, Data Mining
semi-supervised clustering,  mixture model,  pairwise constraints,  exemplars constraints,  

Full Text: PDF>>
Buy this Article

In general, semi-supervised clustering can outperform unsupervised clustering. Since 2001, pairwise constraints for semi-supervised clustering have been an important paradigm in this field. In this paper, we show that pairwise constraints (ECs) can affect the performance of clustering in certain situations and analyze the reasons for this in detail. To overcome these disadvantages, we first outline some exemplars constraints. Based on these constraints, we then describe a semi-supervised clustering framework, and design an exemplars constraints expectation-maximization algorithm. Finally, standard datasets are selected for experiments, and experimental results are presented, which show that the exemplars constraints outperform the corresponding unsupervised clustering and semi-supervised algorithms based on pairwise constraints.