Abstract

With the rapid increase in the number of collected data samples, semi-supervised clustering (SSC) has become a useful mining tool to find an intrinsic data structure with the help of prior knowledge. The common used prior knowledge includes pair-wise constraints and cluster labels. In the past decades, many relevant methods are proposed to improve clustering performance of SSC by mining prior knowledge. In general, the prior knowledge is assumed to be beneficial to yielding desirable results. However, one can gather inappropriate prior knowledge in some scenarios, such as wrong cluster labels. In this case, prior knowledge can result in degenerating clustering performance. Therefore, how to raise safe semi-supervised clustering (S3C) should be investigated. A main goal of S3C is that the corresponding result is never inferior to that of the corresponding unsupervised clustering part. To achieve the goal, we propose safe semi-supervised Fuzzy ${c}$ -Means clustering (S3FCM) which is extended from traditional semi-supervised FCM (SSFCM). In our algorithm, wrongly labeled samples are carefully explored by constraining the corresponding predictions to be those yielded by unsupervised clustering. Meanwhile, the predictions of the other labeled samples should approach to the given labels. Therefore the labeled samples are expected to be safely explored through a balance between unsupervised clustering and SSC. From the reported clustering results on different datasets, we can find that S3FCM can yield comparable, if not the best, performance among different unsupervised clustering and SSC methods even if the wrong ratio achieves 20%.

Highlights

  • With rapid increase of the number of collected data samples, Semi-Supervised Clustering (SSC) has become an useful mining tool to find the intrinsic data structure with the help of prior knowledge

  • Many SSC methods [1]–[7] have been proposed which are extended from traditional unsupervised clustering methods, such as k-means [8], Gaussian Mixture Models (GMM) [9], [10], Fuzzy c-Means (FCM) [11], [12], Affinity Propagation (AP) [13], spectral clustering, and so on

  • We propose a novel S3C method, called Safe Semi-Supervised FCM clustering (S3FCM), in which the sample labels are provided in this paper

Read more

Summary

INTRODUCTION

With rapid increase of the number of collected data samples, Semi-Supervised Clustering (SSC) has become an useful mining tool to find the intrinsic data structure with the help of prior knowledge. The common used prior knowledge includes pair-wise constraints and cluster labels. Yin et al [4] used the pair-wise constraints to introduce an adaptive metric learning method for SSC. Ding et al [16] employed the prior knowledge to adaptively learn a similarity matrix and leaded to semi-supervised spectral clustering. Different from traditional SSC which used all the prior knowledge, Sanodiya et al [17] tried to select the appropriate constraints to learn a distance through the Bregman projection and the obtained distance was used to help k-means label the datasets. Different from the metric-based approach, the constraintbased approach concentrates on initializing cluster centers or revising objective function through the prior knowledge. Basu et al [18] utilized the prior information to compute the initial cluster centers and further proposed semi-supervised k-means.

Gan: Safe Semi-Supervised Fuzzy C-Means Clustering
FORMULATION
SOLUTION
Findings
CONCLUSION
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.