By Topic

Clustering support vector machines for unlabeled data classification

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

4 Author(s)
Juanying Xie ; School of Computer Science, Shaanxi Normal University, Xian, China ; Chunxia Wang ; Yan Zhang ; Shuai Jiang

Clustering support vector machines (CSVM) is proposed in this paper for unlabeled data classification. It is often for us to deal with a large number of data which are wholly unlabeled, e.g., classifying them, and it is impractical for us to label these data manually. Clustering algorithms can be used to generate labels for this kind of data. The global k-means clustering algorithm, the fast global k-means algorithm and another global k-means clustering algorithm using k-d trees are combined respectively with the statistical method F-distribution in our paper to generate labels for those wholly unlabeled data, and then the labeled data are trained with SVM for classification. Our proposed approach (CSVM) is tested on four different synthetically generated data sets, which was wholly unlabeled. The experiment results show that our CSVM is efficient to classify the wholly unlabeled data.

Published in:

2009 International Conference on Test and Measurement  (Volume:2 )

Date of Conference:

5-6 Dec. 2009