Active learning for semi-supervised clustering based on locally linear propagation reconstruction

被引:4
作者
Chang, Chin-Chun [1 ]
Lin, Po-Yi [1 ]
机构
[1] Natl Taiwan Ocean Univ, Dept Comp Sci & Engn, Keelung 202, Taiwan
关键词
Active learning; Semi-supervised clustering; Manifold learning; Locally linear embedding;
D O I
10.1016/j.neunet.2014.11.006
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The success of semi-supervised clustering relies on the effectiveness of side information. To get effective side information, a new active learner learning pairwise constraints known as must-link and cannot-link constraints is proposed in this paper. Three novel techniques are developed for learning effective pairwise constraints. The first technique is used to identify samples less important to cluster structures. This technique makes use of a kernel version of locally linear embedding for manifold learning. Samples neither important to locally linear propagation reconstructions of other samples nor on flat patches in the learned manifold are regarded as unimportant samples. The second is a novel criterion for query selection. This criterion considers not only the importance of a sample to expanding the space coverage of the learned samples but also the expected number of queries needed to learn the sample. To facilitate semi-supervised clustering, the third technique yields inferred must-links for passing information about flat patches in the learned manifold to semi-supervised clustering algorithms. Experimental results have shown that the learned pairwise constraints can capture the underlying cluster structures and proven the feasibility of the proposed approach. (C) 2014 Elsevier Ltd. All rights reserved.
引用
收藏
页码:170 / 184
页数:15
相关论文
共 42 条
[1]  
Aggarwal CC, 2011, SOCIAL NETWORK DATA ANALYTICS, P1
[2]  
[Anonymous], 2004, Proceedings, Twenty-First International Conference on Machine Learning, ICML 2004
[3]  
[Anonymous], 1991, Design and analysis of experiments
[4]  
Asuncion Arthur, 2007, UCI machine learning repository
[5]  
Basu S, 2004, SIAM PROC S, P333
[6]  
Basu S., 2004, P 10 ACM SIGKDD INT, P59, DOI DOI 10.1145/1014052.1014062
[7]   Speeded-Up Robust Features (SURF) [J].
Bay, Herbert ;
Ess, Andreas ;
Tuytelaars, Tinne ;
Van Gool, Luc .
COMPUTER VISION AND IMAGE UNDERSTANDING, 2008, 110 (03) :346-359
[8]   A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems [J].
Beck, Amir ;
Teboulle, Marc .
SIAM JOURNAL ON IMAGING SCIENCES, 2009, 2 (01) :183-202
[9]  
Belkin M, 2002, ADV NEUR IN, V14, P585
[10]   Semi-supervised clustering with discriminative random fields [J].
Chang, Chin-Chun ;
Chen, Hsin-Yi .
PATTERN RECOGNITION, 2012, 45 (12) :4402-4413