Abstract
Abstract This paper presents an idea of evolving Gustafson-Kessel possibilistic c-means clustering (eGKPCM). This approach is extension of well known possiblilistic c-means clustering (PCM) which was proposed to address the drawbacks associated with the constrained membership functions used in fuzzy c-means algorithms (FCM). The idea of possiblistic clustering is ap- pealing when the data samples are highly noisy. The extension to Gustafson-Kessel possibilistic clustering enables us to deal with the clusters of different shapes and the evolving structure enables us to cope with the data structures which vary during the time. The evolving nature of the algorithm makes it also appropriate for dealing with big-data problems. The proposed approach is shown on a simple classification problem of unlabelled data.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.