2011
DOI: 10.1007/s10700-011-9097-2
|View full text |Cite
|
Sign up to set email alerts
|

Genetic algorithm-tuned entropy-based fuzzy C-means algorithm for obtaining distinct and compact clusters

Abstract: A modified approach had been developed in this study by combining two well-known algorithms of clustering, namely fuzzy c-means algorithm and entropybased algorithm. Fuzzy c-means algorithm is one of the most popular algorithms for fuzzy clustering. It could yield compact clusters but might not be able to generate distinct clusters. On the other hand, entropy-based algorithm could obtain distinct clusters, which might not be compact. However, the clusters need to be both distinct as well as compact. The presen… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
6
2
1

Relationship

1
8

Authors

Journals

citations
Cited by 22 publications
(7 citation statements)
references
References 24 publications
0
7
0
Order By: Relevance
“…Finally, the utilization of the exponential transformation of other types of distance measures (Xu 2012) in a fuzzy partitioning around medoids procedure or in other typologies of fuzzy clustering, e.g. entropy-based fuzzy clustering (Dey et al 2011) and bi-objective fuzzy clustering (Hung 2007), will be considered for the intervalvalued data case.…”
Section: Final Remarksmentioning
confidence: 99%
“…Finally, the utilization of the exponential transformation of other types of distance measures (Xu 2012) in a fuzzy partitioning around medoids procedure or in other typologies of fuzzy clustering, e.g. entropy-based fuzzy clustering (Dey et al 2011) and bi-objective fuzzy clustering (Hung 2007), will be considered for the intervalvalued data case.…”
Section: Final Remarksmentioning
confidence: 99%
“…This visualization tool is applicable for 3-D data. For visualization purpose, higherdimensional data are projected or mapped to either 2-D or 3-D [24]. Hence, dimension reduction techniques are applied to this purpose.…”
Section: Visualization Of High Dimensional Clustersmentioning
confidence: 99%
“…To ensure this, a new clustering algorithm may be proposed, in which the cluster centers will be selected initially using the EFC algorithm from a set of data points to be clustered and then, they will be locally (within the cluster) updated to ensure compactness of the clusters using the FCM algorithm. An early version of this new proposal of clustering algorithm has recently been reported by Dey et al (2011), but there is a chance of further improvement of its performance. It will be studied in future.…”
Section: Scope For Future Studymentioning
confidence: 99%