Semi-Supervised Clustering Algorithm Based on Small Size of Labeled Data
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 and KNN, the experimental results confirm that accuracy of our clustering algorithm is close to that of KNN classification algorithm.
Dongye Sun, Wen-Pei Sung and Ran Chen
M. W. Leng et al., "Semi-Supervised Clustering Algorithm Based on Small Size of Labeled Data", Applied Mechanics and Materials, Vols. 121-126, pp. 4675-4679, 2012