Paper Title:
Semi-Supervised Clustering Algorithm Based on Small Size of Labeled Data
  Abstract

In many data mining domains, labeled data is very expensive to generate, how to make the best use of labeled data to guide the process of unlabeled clustering is the core problem of semi-supervised clustering. Most of semi-supervised clustering algorithms require a certain amount of labeled data and need set the values of some parameters, different values maybe have different results. In view of this, a new algorithm, called semi-supervised clustering algorithm based on small size of labeled data, is presented, which can use the small size of labeled data to expand labeled dataset by labeling their k-nearest neighbors and only one parameter. We demonstrate our clustering algorithm with three UCI datasets, compared with SSDBSCAN[4] and KNN, the experimental results confirm that accuracy of our clustering algorithm is close to that of KNN classification algorithm.

  Info
Periodical
Chapter
Chapter 8: System Modeling and Simulation
Edited by
Dongye Sun, Wen-Pei Sung and Ran Chen
Pages
4675-4679
DOI
10.4028/www.scientific.net/AMM.121-126.4675
Citation
M. W. Leng, X. Y. Chen, J. J. Cheng, L. J. Li, "Semi-Supervised Clustering Algorithm Based on Small Size of Labeled Data", Applied Mechanics and Materials, Vols. 121-126, pp. 4675-4679, 2012
Online since
October 2011
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Zhong Ping Zhang, Yong Xin Liang
Abstract:This paper proposes a new data stream outlier detection algorithm SODRNN based on reverse nearest neighbors. We deal with the sliding window...
1032
Authors: Ming Ji, Fei Wang, Jia Ning Wan, Yuan Liu
Chapter 5: Numerical Methods, Computation Methods and Algorithms for Modeling, Simulation and Optimization, Data Mining and Data Processing
Abstract:The purpose of this report is to investigate current existing algorithm to cluster sequential data based on hidden Markov model (HMM)....
1750