By Topic

A semi-supervised k-nearest neighbor algorithm based on data editing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xie Yongfang ; Central South University Institute of Information Science and Engineering, Changsha 410083 ; Jiang Youwei ; Tang Mingzhu

YATSI may suffer more from the common problem in semi-supervised learning, i.e. the performance is badly influenced due to the unlabeled examples may often be wrongly labeled. In this paper a semi-supervised k-nearest neighbor classifier named De-YATSI (YATSI with Data Editing) is proposed. A data editing based on estimating class conditional probability is used to identify and discard mislabeled examples of the pre-labeled data set. A k-nearest neighbor classifier with weights is trained by the labeled data set and the edited “pre-labeled” data set. Experiments on UCI datasets show that DE-YATSI could more effectively and stably utilize the unlabeled examples to improve classification accuracy than YATSI.

Published in:

2011 Chinese Control and Decision Conference (CCDC)

Date of Conference:

23-25 May 2011