An improved fuzzy k-medoids clustering algorithm with optimized number of clusters
- 1 December 2011
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 206-210
- https://doi.org/10.1109/his.2011.6122106
Abstract
K-medoids algorithm is one of the most prominent techniques, as a partitioning clustering algorithm, in data mining and knowledge discovery applications. However, the determined numbers of cluster as an input and the impact of initial value of cluster centers on clusters' quality are the two major challenges of this algorithm. In this paper an improved version of fuzzy k-medoids algorithm has been proposed. Applying entropy concept as a complementary factor in optimization problem of fuzzy k-medoids has become to obtain more accurate centers. Also, using this factor, number of clusters has been achieved effectively. The results show that the proposed method outperforms fuzzy k-medoids in terms of accuracy of obtained centers.Keywords
This publication has 4 references indexed in Scilit:
- Modified K-Means Clustering AlgorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2008
- FCM-Based Model Selection Algorithms for Determining the Number of ClustersPattern Recognition, 2004
- Fuzzy clustering with outliersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Pattern Recognition with Fuzzy Objective Function AlgorithmsPublished by Springer Science and Business Media LLC ,1981