A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Semi-Supervised Possibilistic Fuzzy c-Means Clustering Algorithm on Maximized Central Distance
2013
Proceedings of the 2nd International Conference on Computer Science and Electronics Engineering (ICCSEE 2013)
unpublished
Abandoning the constraint conditions of memberships in traditional fuzzy clustering algorithms, such as Fuzzy C-Means (FCM), Possibilistic Fuzzy c-Means (PCM) is more robust in dealing with noise and outliers. A small amount of labeled patterns guiding the clustering process are easy to be obtained in practical applications. In this study, a novel semi-supervised clustering technique titled semi-supervised possibilistic clustering (sPCM) is proposed. Because the PCM algorithm is easy to fall
doi:10.2991/iccsee.2013.342
fatcat:u7tm5isc7ngrlinczifdg4xxs4