Abstract
Fuzzy C-means is an efficient algorithm for data clustering. The fuzzy local information C-means (FLICM) algorithm was introduced by Krinidis and Chatzis for image clustering and it was proved that it has very good properties. Presented is a generalisation of the fuzzy local information C-means clustering algorithm, in order to be applicable to any kind of input data sets instead of images. The generalisation of FLICM maintains the properties of the original algorithm, and it is also effective and efficient, providing robustness against noise. Furthermore, it is fully free of any kind of empirically adjusted parameters, contrary to all other fuzzy C-means algorithms that have been proposed in the literature.
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.