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 SSDBSCAN4 and KNN,the experimental results confirm that accuracy of our clustering algorithm is close to that of KNN classification algorithm.
Data Mining semi-supervised clustering label propagation
Mingwei Leng Xiaoyun Chen Jianjun Cheng Longjie Li
School of Information Science and Engineering, Lanzhou University, Lanzhou, 730000, China;School of School of Information Science and Engineering, Lanzhou University, Lanzhou, 730000, China
国际会议
台湾
英文
4675-4679
2011-12-11(万方平台首次上网日期,不代表论文的发表时间)