By Topic

A novel support vector and K-Means based hybrid clustering algorithm

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

3 Author(s)
Liang Sun ; Coll. of Comput. Sci. & Technol., Jilin Univ., Changchun, China ; Yoshida, S. ; Yanchun Liang

Data clustering is a hot problem and has been studied extensively. In this paper, we propose a novel support vector and K-Means based hybrid algorithm for data clustering. Firstly, we identify the outliers and overlapping data points through the support vector approach. Secondly, we remove the outliers and overlapping data points and then run the K-Means on the rest data points to obtain clustered data set. Finally, we build support vector description for each cluster, and then assign the removed data points to the cluster with the smallest distance, thus resulting in labeling the whole data set. Simulation results demonstrate that the proposed algorithm is effective, which exploits the advantages of both support vector clustering and K-Means.

Published in:

Information and Automation (ICIA), 2010 IEEE International Conference on

Date of Conference:

20-23 June 2010