.png){kind=icon}
Return
Semi-supervised classification with pairwise constraints
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2014.02.053.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Graph-based semi-supervised learning has been intensively investigated for a long history. However, existing algorithms only utilize the similarity information between examples for graph construction, so their discriminative ability is rather limited. In order to overcome this limitation, this paper considers both similarity and dissimilarity constraints, and constructs a signed graph with positive and negative edge weights to improve the classification performance. Therefore, the proposed algorithm is termed as Constrained Semi-supervised Classifier (CSSC). A novel smoothness regularizer is proposed to make the must-linked examples obtain similar labels, and cannot-linked examples get totally different labels. Experiments on a variety of synthetic and real-world datasets demonstrate that CSSC achieves better performances than some state-of-the-art semi-supervised learning algorithms, such as Harmonic Functions, Linear Neighborhood Propagation, LapRLS, LapSVM, and Safe Semi-supervised Support Vector Machines. (C) 2014 Elsevier B.V. All rights reserved.
Keywords:
Semi-supervised learning
Pairwise constraints
Smoothness regularizer
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W
Organization
Cited Papers
A review of the Irish crustal structure and signatures from the Caledonian and Variscan Orogenies.png)
Terra Nova
Terra NovaIF0
PREAI
ShareSavePairwise constraints based multiview features fusion for scene classificationPATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
ShareSaveShareSaveShareSaveShareSave
View more