Abstract
In data clustering, partition based clustering algorithms are widely used clustering algorithms. Among various partition algorithms, fuzzy algorithms, Fuzzy c-Means (FCM), Gustafson–Kessel (GK) and non-fuzzy algorithm, k-means (KM) are most popular methods. k-means and Fuzzy c-Means use standard Euclidian distance measure and Gustafson–Kessel uses fuzzy covariance matrix in their distance metrics. In this work, a comparative study of these algorithms with different famous real world data sets, liver disorder and wine from the UCI repository is presented. The performance of the three algorithms is analyzed based on the clustering output criteria. The results were compared with the results obtained from the repository. The results showed that Gustafson–Kessel produces close results to Fuzzy c-Means. Further, the experimental results demonstrate that k-means outperforms the Fuzzy c-Means and Gustafson–Kessel algorithms. Thus the efficiency of k-means is better than that of Fuzzy c-Means and Gustafson–Kessel algorithms.
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.
