Journal
IEEE TRANSACTIONS ON CYBERNETICS
Volume 51, Issue 5, Pages 2601-2611Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCYB.2019.2907002
Keywords
Evolutionary algorithms; fuzzy c-means (FCM); fuzzy clustering; multiobjective clustering
Ask authors/readers for more resources
This paper introduces a fuzzy clustering method called entropy c-means (ECM), which creates fuzzy clusters with different levels of fuzziness to accommodate clusters with varying degrees of overlap. Experimental results demonstrate that ECM outperforms traditional fuzzy clustering methods and previous multiobjective methods in cluster detection.
Fuzzy clustering methods identify naturally occurring clusters in a dataset, where the extent to which different clusters are overlapped can differ. Most methods have a parameter to fix the level of fuzziness. However, the appropriate level of fuzziness depends on the application at hand. This paper presents an entropy c-means (ECM), a method of fuzzy clustering that simultaneously optimizes two contradictory objective functions, resulting in the creation of fuzzy clusters with different levels of fuzziness. This allows ECM to identify clusters with different degrees of overlap. ECM optimizes the two objective functions using two multiobjective optimization methods, nondominated sorting genetic algorithm II (NSGA-II) and multiobjective evolutionary algorithm based on decomposition (MOEA/D). We also propose a method to select a suitable tradeoff clustering from the Pareto front. Experiments on challenging synthetic datasets as well as real-world datasets show that ECM leads to better cluster detection compared to the conventional fuzzy clustering methods as well as previously used multiobjective methods for fuzzy clustering.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available