Abstract
The Evidential C-Means algorithm provides a global treatment of ambiguity and uncertainty in memberships when partitioning attribute data, but still requires the number of clusters to be fixed as a priori, like most existing clustering methods do. However, the users usually do not know the exact number of clusters in advance, particularly in practical engineering. To relax this requirement, this paper proposes an Evidential Evolving C-Means (E2CM) clustering method in the framework of evolutionary computation: cluster centers are encoded in a population of variable strings (or particles) to search the optimal number and locations of clusters simultaneously. To perform such joint optimization problem well, an artificial bee colony algorithm with variable strings and interactive evaluation mode is proposed. It will be shown that the E2CM can automatically create appropriate credal partitions by just requiring an upper bound of the cluster number rather than the exact one. More interestingly, there are no restrictions on this upper bound from the theoretic point of view. Some numerical experiments and a practical application in thermal power engineering validate our conclusions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Antoine, V., Quost, B., Masson, M. H., & Denœux, T. (2012). CECM: Constrained evidential c-means algorithm. Computational Statistics and Data Analysis, 56(4), 894–914.
Denœux, T., & Kanjanatarakul, O. (2016). Evidential clustering: A review. In International symposium on integrated uncertainty in knowledge modelling and decision making (pp. 24–35). Berlin: Springer.
Denœux, T., Kanjanatarakul, O., & Sriboonchitta, S. (2015). EK-NNclus: A clustering procedure based on the evidential k-nearest neighbor rule. Knowledge-Based Systems, 88, 57–69.
Denœux, T., Li, S., & Sriboonchitta, S. (2017). Evaluating and comparing soft partitions: An approach based on Dempster–Shafer theory. IEEE Transactions on Fuzzy Systems, 26(3), 1231–1244.
Denœux, T., & Masson, M. H. (2004). EVCLUS: Evidential clustering of proximity data. IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 34(1), 95–109.
Dey, V., Pratihar, D. K., & Datta, G. L. (2011). Genetic algorithm-tuned entropy-based fuzzy c-means algorithm for obtaining distinct and compact clusters. Fuzzy Optimization and Decision Making, 10(2), 153–166.
Hancer, E., & Karaboga, D. (2017). A comprehensive survey of traditional, merge-split and evolutionary approaches proposed for determination of cluster number. Swarm and Evolutionary Computation, 32, 49–67.
Ippolito, L., Loia, V., & Siano, P. (2003). Extended fuzzy c-means and genetic algorithms to optimize power flow management in hybrid electric vehicles. Fuzzy Optimization and Decision Making, 2(4), 359–374.
Karaboga, D., & Basturk, B. (2008). On the performance of artificial bee colony (ABC) algorithm. Applied Soft Computing, 8(1), 687–697.
Karaboga, D., Gorkemli, B., Ozturk, C., & Karaboga, N. (2014). A comprehensive survey: Artificial bee colony (ABC) algorithm and applications. Artificial Intelligence Review, 42(1), 21–57.
Lelandais, B., Ruan, S., Denœux, T., Vera, P., & Gardin, I. (2014). Fusion of multi-tracer pet images for dose painting. Medical Image Analysis, 18(7), 1247–1259.
Lian, C. F., Ruan, S., Denœux, T., Li, H., & Vera, P. (2018). Joint tumor segmentation in pet-ct images using co-clustering and fusion based on belief functions. IEEE Transactions on Image Processing, 28(2), 755–766.
Liu, Z. G., Dezert, J., Mercier, G., & Pan, Q. (2012). Belief C-means: An extension of fuzzy c-means algorithm in belief functions framework. Pattern Recognition Letters, 33(3), 291–300.
Liu, Z. G., Pan, Q., Dezert, J., & Mercier, G. (2015). Credal C-means clustering method based on belief functions. Knowledge-Based Systems, 74, 119–132.
Masson, M. H., & Denœux, T. (2008). ECM: An evidential version of the fuzzy -means algorithm. Pattern Recognition, 41(4), 1384–1397.
Masson, M. H., & Denœux, T. (2009). RECM: Relational evidential c-means algorithm. Pattern Recognition Letters, 30(11), 1015–1026.
Newman, D. J., Hettich, S., Blake, C. L., & Merz, C. J. (1998). UCI repository of machine learning databases. Irvine, CA: University of California, Department of Information and Computer Science. http://www.ics.uci.edu/~mlearn/MLRepository.html.
Rodriguez, A., & Laio, A. (2014). Clustering by fast search and find of density peaks. Science, 344(6191), 1492–1496.
Saxena, A., Prasad, M., Gupta, A., Bharill, N., Patel, O. P., Tiwari, A., et al. (2017). A review of clustering techniques and developments. Neurocomputing, 267, 664–681.
Shafer, G. (1976). A mathematical theory of evidence (Vol. 42). Princeton: Princeton University Press.
Su, Z. G., Zhou, H. Y., Wang, P. H., Zhao, G., & Zhao, M. (2018). E2CM: An evolutionary version of evidential C-means clustering algorithm. In International conference on belief functions (pp. 234–242). Berlin: Springer.
Su, Z. G., & Denœux, T. (2019). BPEC: Belief-peaks evidential clustering. IEEE Transactions on Fuzzy Systems, 27(1), 111–123.
Su, Z. G., Wang, P. H., Shen, J., Li, Y. G., Zhang, Y. F., & Hu, E. J. (2012). Automatic fuzzy partitioning approach using variable string length artificial bee colony (VABC) algorithm. Applied Soft Computing, 12(11), 3421–3441.
Zhou, K., Martin, A., Pan, Q., & Liu, Z. G. (2015). Median evidential c-means algorithm and its application to community detection. Knowledge-Based Systems, 74, 69–88.
Acknowledgements
The authors are grateful to the editor and referees for their useful suggestions.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This work is supported in part by the National Natural Science Foundation of China under Grant Nos. 52076037 and 51876035. This paper is a revised and extended version of a short paper presented at the BELIEF 2018 conference (Su et al. 2018).
Rights and permissions
About this article
Cite this article
Su, Zg., Zhou, Hy. & Hao, Ys. Evidential evolving C-means clustering method based on artificial bee colony algorithm with variable strings and interactive evaluation mode. Fuzzy Optim Decis Making 20, 293–313 (2021). https://doi.org/10.1007/s10700-020-09344-7
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10700-020-09344-7