A semi-supervised clustering algorithm based on must-link set

8Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Clustering analysis is traditionally considered as an unsupervised learning process. In most cases, people usually have some prior or background knowledge before they perform the clustering. How to use the prior or background knowledge to imporve the cluster quality and promote the efficiency of clustering data has become a hot research topic in recent years. The Must-Link and Cannot-Link constraints between instances are common prior knowledge in many real applications. This paper presents the concept of Must-Link Set and designs a new semi-supervised clustering algorithm MLC-KMeans using Musk-Link Set as assistant centroid. The preliminary experiment on several UCI datasets confirms the effectiveness and efficiency of the algorithm. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Huang, H., Cheng, Y., & Zhao, R. (2008). A semi-supervised clustering algorithm based on must-link set. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5139 LNAI, pp. 492–499). Springer Verlag. https://doi.org/10.1007/978-3-540-88192-6_48

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free