Abstract

Semi-supervised clustering algorithms aim to significantly improve the clustering results using limited supervision in the form of labelled instances or pairwise constraints. But few of these algorithms are specially and well-designed both for multi-density and complex shape datasets. However, such complex data are usual in the real world. In this paper, an improved semi-supervised clustering algorithm is proposed based on SCMD algorithm. Our new algorithm can deal with the multi-density problems, including not only the inter-cluster density variety but also the intra-cluster density difference; and it can yield superior performance with fewer constraints. We test our new algorithm on several synthetic datasets of varying shapes, sizes, and densities. Experimental results show that our algorithm has manifest superior performance in comparison with SCMD algorithm, even when the constraints are not sufficient.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.