Abstract
Pair-wise constraints are widely used in semi-supervised clustering to aid unsupervised learning, but traditional semi-supervised clustering algorithm lacks the ability to find the useful constraint information. This paper presents a semi-supervised affinity propagation(AP) clustering algorithm based on active learning, which can select informative pair-wise constraints to find constraint information that cannot be noticed by the clustering algorithm easily. The constraint information obtained with the active learning method is used to adjust the similarity matrix in the AP clustering algorithm and make it semi-supervised with side information. We compare our method with the AP clustering algorithm and K-means algorithm, both with constraints selected randomly. Experimental results on the UCI Machine Learning Repository indicate that the new clustering algorithm proposed in this paper can improve the clustering performance significantly.
Published Version
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 callDisclaimer: 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.
