{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,15]],"date-time":"2026-02-15T08:47:25Z","timestamp":1771145245283,"version":"3.50.1"},"reference-count":81,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2018,10,6]],"date-time":"2018-10-06T00:00:00Z","timestamp":1538784000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>We propose a novel method for adaptive K-means clustering. The proposed method overcomes the problems of the traditional K-means algorithm. Specifically, the proposed method does not require prior knowledge of the number of clusters. Additionally, the initial identification of the cluster elements has no negative impact on the final generated clusters. Inspired by cell cloning in microorganism cultures, each added data sample causes the existing cluster \u2018colonies\u2019 to evaluate, with the other clusters, various merging or splitting actions in order for reaching the optimum cluster set. The proposed algorithm is adequate for clustering data in isolated or overlapped compact spherical clusters. Experimental results support the effectiveness of this clustering algorithm.<\/jats:p>","DOI":"10.3390\/a11100151","type":"journal-article","created":{"date-parts":[[2018,10,8]],"date-time":"2018-10-08T10:44:53Z","timestamp":1538995493000},"page":"151","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["K-Means Cloning: Adaptive Spherical K-Means Clustering"],"prefix":"10.3390","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9936-5987","authenticated-orcid":false,"given":"Abdel-Rahman","family":"Hedar","sequence":"first","affiliation":[{"name":"Department of Computer Science, Faculty of Comp. &amp; Info, Assiut University, Assiut 71526, Egypt"},{"name":"Department of Computer Science in Jamoum, Umm Al-Qura University, Makkah 25371, Saudi Arabia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdel-Monem","family":"Ibrahim","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Faculty of Science, Al-Azhar University, Assiut Branch, Assiut 71524, Egypt"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0003-6914","authenticated-orcid":false,"given":"Alaa","family":"Abdel-Hakim","sequence":"additional","affiliation":[{"name":"Department of Computer Science in Jamoum, Umm Al-Qura University, Makkah 25371, Saudi Arabia"},{"name":"Electrical Engineering Department, Assiut University, Assiut 71516, Egypt"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adel","family":"Sewisy","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Faculty of Comp. &amp; Info, Assiut University, Assiut 71526, Egypt"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,10,6]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Berkhin, P. (2006). A survey of clustering data mining techniques. Grouping Multidimensional Data, Springer.","DOI":"10.1007\/3-540-28349-8_2"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1109\/TNN.2005.845141","article-title":"Survey of clustering algorithms","volume":"16","author":"Xu","year":"2005","journal-title":"IEEE Trans. Neural Netw."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1396","DOI":"10.1109\/34.895974","article-title":"Clustering by scale-space filtering","volume":"22","author":"Leung","year":"2000","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1080\/01621459.1963.10500845","article-title":"Hierarchical grouping to optimize an objective function","volume":"58","author":"Ward","year":"1963","journal-title":"J. Am. Stat. Assoc."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"3192","DOI":"10.1016\/j.patcog.2008.04.004","article-title":"Modified global K-means algorithm for minimum sum-of-squares clustering problems","volume":"41","author":"Bagirov","year":"2008","journal-title":"Pattern Recognit."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Hammerly, G., and Elkan, C. (2002, January 4\u20139). Alternatives to the K-means algorithm that find better clusterings. Proceedings of the Eleventh International Conference on Information and Knowledge Management, McLean, VA, USA.","DOI":"10.1145\/584792.584890"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","article-title":"Data clustering: 50 years beyond K-means","volume":"31","author":"Jain","year":"2010","journal-title":"Pattern Recognit. Lett."},{"key":"ref_8","unstructured":"Bhatia, S.K. (,  2004). Adaptive K-Means Clustering. Proceedings of the FLAIRS Conference, Miami Beach, FL, USA."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/j.ijpe.2008.12.004","article-title":"A simulated annealing method based on a clustering approach to determine bills of materials for a large product family","volume":"117","author":"Agard","year":"2009","journal-title":"Int. J. Prod. Econ."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s10489-006-8513-8","article-title":"Adapting k-means for supervised clustering","volume":"24","year":"2006","journal-title":"Appl. Intell."},{"key":"ref_11","unstructured":"Das, S., Abraham, A., and Konar, A. (2012). Metaheuristic Clustering, Springer."},{"key":"ref_12","unstructured":"Laarhoven, P. (1988). Theoretical and Computational Aspects of Simulated Annealing, Stichting Mathematisch Centrum."},{"key":"ref_13","unstructured":"Laarhoven, P., and Aarts, E. (2010). Simulated Annealing: Theory and Applications, Springer. Mathematics and Its Applications."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1824","DOI":"10.1016\/j.patcog.2007.11.002","article-title":"Data mining with a simulated annealing based fuzzy classification system","volume":"41","author":"Mohamadi","year":"2008","journal-title":"Pattern Recognit."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"2680","DOI":"10.1016\/j.ins.2008.01.022","article-title":"A tabu search approach for the minimum sum-of-squares clustering problem","volume":"178","author":"Liu","year":"2008","journal-title":"Inf. Sci."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Turkensteen, M., and Andersen, K. (2009). A Tabu Search Approach to Clustering. Operations Research Proceedings 2008, Springer.","DOI":"10.1007\/978-3-642-00142-0_77"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/j.fss.2005.04.009","article-title":"A Study of Some Fuzzy Cluster Validity Indices, Genetic clustering And Application to Pixel Classification","volume":"155","author":"Pakhira","year":"2005","journal-title":"Fuzzy Sets Syst."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.amc.2006.05.166","article-title":"K-harmonic means data clustering with simulated annealing heuristic","volume":"184","year":"2007","journal-title":"Appl. Math. Comput."},{"key":"ref_19","unstructured":"Abudalfa, S. (2011). Metaheuristic Clustering Algorithm: Recent Advances in Data Clustering, LAP Lambert Academic Publishing."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.inffus.2017.04.008","article-title":"Collaborative clustering: Why, when, what and how","volume":"39","author":"Wemmert","year":"2018","journal-title":"Inf. Fusion"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"10123","DOI":"10.1016\/j.apm.2013.05.052","article-title":"Candidate groups search for K-harmonic means data clustering","volume":"37","author":"Hung","year":"2013","journal-title":"Appl. Math. Model."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"583","DOI":"10.3233\/IDA-2007-11602","article-title":"An overview of clustering methods","volume":"11","author":"Omran","year":"2007","journal-title":"Intell. Data Anal."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1243\/095440605X8298","article-title":"Selection of K in K-means clustering","volume":"219","author":"Pham","year":"2005","journal-title":"Proc. Inst. Mech. Eng. Part C J. Mech. Eng. Sci."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/978-3-319-49487-6_3","article-title":"Theoretical Analysis of the k-Means Algorithm\u2013A Survey","volume":"9220","author":"Sohler","year":"2016","journal-title":"Algorithm Eng. Sel. Res. Surv."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1016\/j.asoc.2017.08.032","article-title":"Two Improved k-means Algorithms","volume":"68","author":"Yu","year":"2017","journal-title":"Appl. Soft Comput."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.patcog.2017.05.017","article-title":"Robust-learning fuzzy c-means clustering algorithm with unknown number of clusters","volume":"74","author":"Yang","year":"2017","journal-title":"Pattern Recognit."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.ins.2012.01.021","article-title":"Integration of particle swarm optimization and genetic algorithm for dynamic clustering","volume":"195","author":"Kuo","year":"2012","journal-title":"Inf. Sci."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00357-010-9049-5","article-title":"Intelligent choice of the number of clusters in k-means clustering: An experimental study with different cluster spreads","volume":"27","author":"Chiang","year":"2010","journal-title":"J. Classif."},{"key":"ref_29","unstructured":"Hamerly, G., and Elkan, C. (2004). Learning the k in k-means. Advances in Neural Information Processing Systems, the MIT Press."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Feng, Y., and Hamerly, G. (2007). PG-means: Learning the number of clusters in data. Advances in Neural Information Processing Systems, the MIT Press.","DOI":"10.7551\/mitpress\/7503.003.0054"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1111\/1467-9868.00293","article-title":"Estimating the number of clusters in a data set via the gap statistic","volume":"63","author":"Tibshirani","year":"2001","journal-title":"J. R. Stat. Soc. Ser. B Stat. Methodol."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1162\/neco.2008.12-06-421","article-title":"Bayesian k-means as a \u201cMaximization-Expectation\u201d algorithm","volume":"21","author":"Kurihara","year":"2009","journal-title":"Neural Comput."},{"key":"ref_33","unstructured":"Pelleg, D., and Moore, A.W. (July, January 29). X-means: Extending K-means with Efficient Estimation of the Number of Clusters. Proceedings of the ICML 2000, Stanford, CA, USA."},{"key":"ref_34","unstructured":"Ishioka, T. (2005, January 4\u20136). An expansion of X-means for automatically determining the optimal number of clusters. Proceedings of the International Conference on Computational Intelligence, Calgary, AB, Canada."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Thompson, B., and Yao, D. (2009, January 10\u201312). The union-split algorithm and cluster-based anonymization of social networks. Proceedings of the 4th International Symposium on Information, Computer, and Communications Security, Sydney, Australia.","DOI":"10.1145\/1533057.1533088"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1109\/TPAMI.2005.113","article-title":"Combining multiple clusterings using evidence accumulation","volume":"27","author":"Fred","year":"2005","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_37","unstructured":"Guan, Y., Ghorbani, A.A., and Belacel, N. (2003, January 4\u20137). Y-means: A clustering method for intrusion detection. Proceedings of the 2003 CCECE Canadian Conference on Electrical and Computer Engineering, Montreal, QC, Canada."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/s10489-012-0373-9","article-title":"Dynamic clustering using combinatorial particle swarm optimization","volume":"38","author":"Masoud","year":"2013","journal-title":"Appl. Intell."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Sharmilarani, D., Kousika, N., and Komarasamy, G. (2014, January 10\u201311). Modified K-means algorithm for automatic stimation of number of clusters using advanced visual assessment of cluster tendency. Proceedings of the 2014 IEEE 8th International Conference on Intelligent Systems and Control (ISCO), Coimbatore, India.","DOI":"10.1109\/ISCO.2014.7103951"},{"key":"ref_40","unstructured":"Glover, F.W., and Kochenberger, G.A. (2006). Handbook of Metaheuristics, Springer Science & Business Media."},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Gendreau, M., and Potvin, J.Y. (2010). Handbook of Metaheuristics, Springer.","DOI":"10.1007\/978-1-4419-1665-5"},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"997","DOI":"10.1007\/s11750-013-0308-6","article-title":"Novel hybrid heuristics for an extension of the dynamic relay deployment problem over disaster areas","volume":"22","author":"Bilbao","year":"2014","journal-title":"Top"},{"key":"ref_43","unstructured":"Das, S., Abraham, A., and Konar, A. (2009). Metaheuristic Clustering, Springer."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.swevo.2013.11.003","article-title":"A survey on nature inspired metaheuristic algorithms for partitional clustering","volume":"16","author":"Nanda","year":"2014","journal-title":"Swarm Evol. Comput."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"9695","DOI":"10.1016\/j.eswa.2012.02.149","article-title":"A new grouping genetic algorithm for clustering problems","volume":"39","year":"2012","journal-title":"Expert Syst. Appl."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/j.knosys.2009.11.001","article-title":"G-ANMI: A mutual information based genetic clustering algorithm for categorical data","volume":"23","author":"Deng","year":"2010","journal-title":"Knowl.-Based Syst."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.mbs.2013.07.011","article-title":"A biased random-key genetic algorithm for data clustering","volume":"245","author":"Festa","year":"2013","journal-title":"Math. Biosci."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"1416","DOI":"10.1016\/j.patrec.2008.02.017","article-title":"To combine steady-state genetic algorithm and ensemble learning for data clustering","volume":"29","author":"Hong","year":"2008","journal-title":"Pattern Recognit. Lett."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"1787","DOI":"10.1007\/s00500-013-0997-7","article-title":"A hybrid genetic algorithm\u2013fuzzy c-means approach for incomplete data clustering based on nearest-neighbor intervals","volume":"17","author":"Li","year":"2013","journal-title":"Soft Comput."},{"key":"ref_50","first-page":"916371","article-title":"An island grouping genetic algorithm for fuzzy partitioning problems","volume":"2014","author":"Geem","year":"2014","journal-title":"Sci. World J."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1016\/j.asoc.2014.08.036","article-title":"A multi-objective genetic algorithm with fuzzy c-means for automatic data clustering","volume":"24","author":"Wikaisuksakul","year":"2014","journal-title":"Appl. Soft Comput."},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"1369","DOI":"10.1016\/j.cor.2009.02.025","article-title":"Simulated annealing based automatic fuzzy clustering combined with ANN classification for analyzing microarray data","volume":"37","author":"Maulik","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/j.compbiomed.2014.06.017","article-title":"Alpha-plane based automatic general type-2 fuzzy clustering based on simulated annealing meta-heuristic algorithm for analyzing gene expression data","volume":"64","author":"Torshizi","year":"2015","journal-title":"Comput. Biol. Med."},{"key":"ref_54","first-page":"485","article-title":"K-harmonic means Data Clustering using Combination of Particle Swarm Optimization and Tabu Search","volume":"4","author":"Aghdasi","year":"2014","journal-title":"Int. J. Mechatron. Electr. Comput. Technol."},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1016\/j.apm.2007.03.011","article-title":"K-harmonic means data clustering with tabu-search method","volume":"32","year":"2008","journal-title":"Appl. Math. Model."},{"key":"ref_56","doi-asserted-by":"crossref","first-page":"14555","DOI":"10.1016\/j.eswa.2011.05.027","article-title":"Chaotic particle swarm optimization for data clustering","volume":"38","author":"Chuang","year":"2011","journal-title":"Expert Syst. Appl."},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s10462-010-9191-9","article-title":"A review on particle swarm optimization algorithms and their applications to data clustering","volume":"35","author":"Rana","year":"2011","journal-title":"Artif. Intell. Rev."},{"key":"ref_58","doi-asserted-by":"crossref","first-page":"6565","DOI":"10.1016\/j.eswa.2010.11.082","article-title":"Particle swarm optimization with selective particle regeneration for data clustering","volume":"38","author":"Tsai","year":"2011","journal-title":"Expert Syst. Appl."},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"9847","DOI":"10.1016\/j.eswa.2009.02.003","article-title":"An efficient hybrid data clustering method based on K-harmonic means and Particle Swarm Optimization","volume":"36","author":"Yang","year":"2009","journal-title":"Expert Syst. Appl."},{"key":"ref_60","doi-asserted-by":"crossref","first-page":"2326","DOI":"10.1016\/j.advwatres.2007.05.009","article-title":"Simultaneous determination of aquifer parameters and zone structures with fuzzy c-means clustering and meta-heuristic harmony search algorithm","volume":"30","author":"Ayvaz","year":"2007","journal-title":"Adv. Water Resour."},{"key":"ref_61","doi-asserted-by":"crossref","unstructured":"Chandrasekhar, U., and Naga, P.R.P. (2011, January 7\u20139). Recent trends in ant colony optimization and data clustering: A brief survey. Proceedings of the 2011 2nd International Conference on Intelligent Agent and Multi-Agent Systems (IAMA), Chennai, India.","DOI":"10.1109\/IAMA.2011.6048999"},{"key":"ref_62","doi-asserted-by":"crossref","first-page":"3864","DOI":"10.1016\/j.asoc.2013.05.003","article-title":"Hybridization strategies for continuous ant colony optimization and particle swarm optimization applied to data clustering","volume":"13","author":"Huang","year":"2013","journal-title":"Appl. Soft Comput."},{"key":"ref_63","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1108\/03684920710741215","article-title":"Ant colony based hybrid optimization for data clustering","volume":"36","author":"Das","year":"2007","journal-title":"Kybernetes"},{"key":"ref_64","doi-asserted-by":"crossref","unstructured":"Landa-Torres, I., Manjarres, D., Gil-L\u00f3pez, S., Del Ser, J., and Salcedo-Sanz, S. (2017, January 22\u201324). A Novel Grouping Harmony Search Algorithm for Clustering Problems. Proceedings of the 2017 International Conference on Harmony Search Algorithm, Bilbao, Spain.","DOI":"10.1007\/978-981-10-3728-3_9"},{"key":"ref_65","doi-asserted-by":"crossref","unstructured":"Moh\u2019d Alia, O., Al-Betar, M.A., Mandava, R., and Khader, A.T. (2011, January 19\u201321). Data clustering using harmony search algorithm. Proceedings of the 2011 International Conference on Swarm, Evolutionary, and Memetic Computing. Springer, Visakhapatnam, India.","DOI":"10.1007\/978-3-642-27242-4_10"},{"key":"ref_66","doi-asserted-by":"crossref","unstructured":"Del Ser, J., Lobo, J.L., Villar-Rodriguez, E., Bilbao, M.N., and Perfecto, C. (2016, January 24\u201329). Community detection in graphs based on surprise maximization using firefly heuristics. Proceedings of the 2016 IEEE Congress on Evolutionary Computation (CEC), Vancouver, BC, Canada.","DOI":"10.1109\/CEC.2016.7744064"},{"key":"ref_67","doi-asserted-by":"crossref","unstructured":"Nayak, J., Nanda, M., Nayak, K., Naik, B., and Behera, H.S. (2014). An improved firefly fuzzy c-means (FAFCM) algorithm for clustering real world data sets. Advanced Computing, Networking and Informatics-Volume 1, Springer.","DOI":"10.1007\/978-3-319-07353-8_40"},{"key":"ref_68","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"ref_69","doi-asserted-by":"crossref","first-page":"1392","DOI":"10.1016\/j.patrec.2009.07.015","article-title":"A new multiobjective simulated annealing based clustering technique using symmetry","volume":"30","author":"Saha","year":"2009","journal-title":"Pattern Recognit. Lett."},{"key":"ref_70","doi-asserted-by":"crossref","unstructured":"Borges, E., Ferrari, D., and Castro, L. (2012, January 10\u201315). Silhouette-based clustering using an immune network. Proceedings of the 2012 IEEE Congress on Evolutionary Computation (CEC), Brisbane, Australia.","DOI":"10.1109\/CEC.2012.6252945"},{"key":"ref_71","doi-asserted-by":"crossref","first-page":"2858","DOI":"10.1016\/j.fss.2006.07.006","article-title":"A fuzzy extension of the silhouette width criterion for cluster analysis","volume":"157","author":"Campello","year":"2006","journal-title":"Fuzzy Sets Syst."},{"key":"ref_72","unstructured":"Kaufman, L., and Rousseeuw, P. (2005). Finding Groups in Data: An Introduction to Cluster Analysis, John Wiley & Sons."},{"key":"ref_73","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0377-0427(87)90125-7","article-title":"Silhouettes: A graphical aid to the interpretation and validation of cluster analysis","volume":"20","author":"Rousseeuw","year":"1987","journal-title":"J. Comput. Appl. Math."},{"key":"ref_74","doi-asserted-by":"crossref","first-page":"3430","DOI":"10.1016\/j.patcog.2007.03.026","article-title":"GAPS: A clustering method using a new point symmetry-based distance measure","volume":"40","author":"Bandyopadhyay","year":"2007","journal-title":"Pattern Recognit."},{"key":"ref_75","unstructured":"Asuncion, A., and Newman, D. (2018, March 01). University of California at Irvine Repository of Machine Learning Databases. Available online: http:\/\/archive.ics.uci.edu\/ml\/."},{"key":"ref_76","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.fss.2010.11.015","article-title":"Use of a fuzzy granulation\u2013degranulation criterion for assessing cluster validity","volume":"170","author":"Bandyopadhyay","year":"2011","journal-title":"Fuzzy Sets Syst."},{"key":"ref_77","first-page":"179","article-title":"The use of multiple measurements in taxonomic problems","volume":"3","author":"Fisher","year":"1936","journal-title":"Ann. Hum. Genet."},{"key":"ref_78","doi-asserted-by":"crossref","unstructured":"Abraham, A., Das, S., and Roy, S. (2008). Swarm intelligence algorithms for data clustering. Soft Computing for Knowledge Discovery and Data Mining, Springer.","DOI":"10.1007\/978-0-387-69935-6_12"},{"key":"ref_79","doi-asserted-by":"crossref","unstructured":"Bezdek, J. (1981). Pattern Recognition with Fuzzy Objective Function Algorithms, Plenum.","DOI":"10.1007\/978-1-4757-0450-1"},{"key":"ref_80","doi-asserted-by":"crossref","first-page":"1075","DOI":"10.1109\/TGRS.2003.810924","article-title":"Fuzzy partitioning using real-coded variable-length genetic algorithm for pixel classification","volume":"41","author":"Maulik","year":"2003","journal-title":"IEEE Trans. Geosci. Remote Sens."},{"key":"ref_81","doi-asserted-by":"crossref","unstructured":"Potter, M., and Couldrey, C. (2010, January 11\u201315). A Cooperative Coevolutionary Approach to Partitional Clustering. Proceedings of the 11th International Conference Parallel Problem Solving from Nature, PPSN XI, Part I, Krakow, Poland.","DOI":"10.1007\/978-3-642-15844-5_38"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/11\/10\/151\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:24:12Z","timestamp":1760196252000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/11\/10\/151"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,6]]},"references-count":81,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2018,10]]}},"alternative-id":["a11100151"],"URL":"https:\/\/doi.org\/10.3390\/a11100151","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,6]]}}}