By Topic

A Novel K-Means Clustering Algorithm Based on Positive Examples and Careful Seeding

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
$31 $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

5 Author(s)
Qinchao Liu ; Sch. of Comput. Sci. & Inf. Technol., Northeast Normal Univ., Changchun, China ; Bangzuo Zhang ; Haichao Sun ; Yu Guan
more authors

Positive and unlabeled learning (PU Learning) is a special semi-supervise learning method. Its most important feature is that training set only includes two parts: positive examples and unlabeled examples. Many real-world classification applications appeal to PU Learning problem. The K-means++ clustering algorithm proposed a new seeding method. This paper describes a semi-supervised learning algorithm for positive and unlabeled examples (PU learning). Our approach extends K-means++, an enhancement to K-means that seeds the algorithm with suitably chosen cluster centers, to such situations. The experiments on the Spam and 20-newsgroup data sets shown that our proposed algorithm has better performances.

Published in:

Computational and Information Sciences (ICCIS), 2010 International Conference on

Date of Conference:

17-19 Dec. 2010