{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T19:30:20Z","timestamp":1782329420824,"version":"3.54.5"},"reference-count":250,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1016\/j.ins.2022.11.139","type":"journal-article","created":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T13:26:17Z","timestamp":1669901177000},"page":"178-210","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1999,"special_numbering":"C","title":["K-means clustering algorithms: A comprehensive review, variants analysis, and advances in the era of big data"],"prefix":"10.1016","volume":"622","author":[{"given":"Abiodun M.","family":"Ikotun","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Absalom E.","family":"Ezugwu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Laith","family":"Abualigah","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Belal","family":"Abuhaija","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jia","family":"Heming","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ins.2022.11.139_b0005","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.117927","article-title":"The incremental online k-means clustering algorithm and its application to color quantization","volume":"207","author":"Abernathy","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.ins.2022.11.139_b0010","doi-asserted-by":"crossref","first-page":"218","DOI":"10.21884\/IJMTER.2017.4143.LGJZD","article-title":"Survey report on K-means clustering algorithm","volume":"4","author":"Abhishekkumar","year":"2017","journal-title":"Int. J. Mod. Trends Eng. Res"},{"issue":"11","key":"10.1016\/j.ins.2022.11.139_b0015","doi-asserted-by":"crossref","first-page":"3827","DOI":"10.3390\/app10113827","article-title":"A comprehensive survey of the harmony search algorithm in clustering applications","volume":"10","author":"Abualigah","year":"2020","journal-title":"Appl. Sci."},{"key":"10.1016\/j.ins.2022.11.139_b0020","series-title":"Feature selection and enhanced krill herd algorithm for text document clustering","author":"Abualigah","year":"2019"},{"key":"10.1016\/j.ins.2022.11.139_b0025","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1016\/j.jocs.2017.07.018","article-title":"A new feature selection method to improve the document clustering using particle swarm optimization algorithm","volume":"25","author":"Abualigah","year":"2018","journal-title":"J. Comput. Sci."},{"key":"10.1016\/j.ins.2022.11.139_b0030","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.asoc.2017.06.059","article-title":"A novel hybridization strategy for krill herd algorithm applied to clustering techniques","volume":"60","author":"Abualigah","year":"2017","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.ins.2022.11.139_b0035","doi-asserted-by":"crossref","first-page":"184963","DOI":"10.1109\/ACCESS.2019.2960925","article-title":"Automatic data clustering using hybrid firefly particle swarm optimization algorithm","volume":"7","author":"Agbaje","year":"2019","journal-title":"IEEE Access"},{"key":"10.1016\/j.ins.2022.11.139_b0040","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/j.datak.2007.03.016","article-title":"A K-mean clustering algorithm for mixed numeric and categorical data","volume":"63","author":"Ahmad","year":"2007","journal-title":"Data Knowl. Eng."},{"key":"10.1016\/j.ins.2022.11.139_b0045","doi-asserted-by":"crossref","first-page":"31883","DOI":"10.1109\/ACCESS.2019.2903568","article-title":"Survey of state-of-the-art mixed data clustering algorithms","volume":"7","author":"Ahmad","year":"2019","journal-title":"IEEE Access"},{"key":"10.1016\/j.ins.2022.11.139_b0050","doi-asserted-by":"crossref","unstructured":"Ahmed, M., Seraj, R., & Islam, S. M. S. (2020). The K-means algorithm: A comprehensive survey and performance evaluation. Electronics (Switzerland), 9(8), 1-12. (1295). https:\/\/doi.org\/10.3390\/electronics9081295.","DOI":"10.3390\/electronics9081295"},{"key":"10.1016\/j.ins.2022.11.139_b0055","unstructured":"Ailon, N., Jaiswal, R., & Monteleoni, C. (2009). Streaming K-means approximation. NIPS'09: Proceedings of the 22nd International Conference on Neural Information Processing Systems Advances in Neural Information Processing Systems, 22, 10-18."},{"issue":"2","key":"10.1016\/j.ins.2022.11.139_b0060","doi-asserted-by":"crossref","first-page":"27","DOI":"10.3390\/bdcc3020027","article-title":"Automatic human brain tumor detection in MRI image using template-based K means and improved fuzzy C means clustering algorithm","volume":"3","author":"Alam","year":"2019","journal-title":"Big Data Cognit. Comput."},{"key":"10.1016\/j.ins.2022.11.139_b0065","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2020.107023","article-title":"Parallel batch K-means for big data clustering","volume":"152","author":"Alguliyev","year":"2021","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.ins.2022.11.139_b0070","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1038\/35000501","article-title":"Distinct types of diffuse large B-celllymphoma identified by gene expression profiling","volume":"403","author":"Alizadeh","year":"2000","journal-title":"Nature"},{"key":"10.1016\/j.ins.2022.11.139_b0075","article-title":"An efficient k-means clustering algorithm. Electrical Engineering and Computer","volume":"43","author":"Alsabti","year":"1997","journal-title":"Science"},{"key":"10.1016\/j.ins.2022.11.139_b0080","unstructured":"Arthur, D., & Vassilvitskii, S. (2007). K-means++: The advantages of careful seeding. Proceedings of the Annuual ACM-SIAM Symposium on Discrete Algorithms, 8, 1027-1035. 10.1145\/1283383.1283494."},{"key":"10.1016\/j.ins.2022.11.139_b0085","series-title":"UCI machine learning repository","author":"Bache","year":"2013"},{"key":"10.1016\/j.ins.2022.11.139_b0090","unstructured":"Bachem, O., Lucic, M., Hassani, H., & Krause, A. (2016). Fast and provably good seedings for k-means. Advances in Neural Information Processing Systems, 29."},{"key":"10.1016\/j.ins.2022.11.139_b0095","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.inffus.2020.03.009","article-title":"A multiple K-means clustering ensemble algorithm to find nonlinearly separable clusters","volume":"61","author":"Bai","year":"2020","journal-title":"Inform. Fusion"},{"key":"10.1016\/j.ins.2022.11.139_b0100","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2020.103857","article-title":"Space\u2013time series clustering: Algorithms, taxonomy, and case study on urban smart cities","volume":"95","author":"Belhadi","year":"2020","journal-title":"Eng. Appl. Artif. Intel."},{"key":"10.1016\/j.ins.2022.11.139_b0105","doi-asserted-by":"crossref","DOI":"10.1155\/2014\/506480","article-title":"Optimized k-means algorithm","volume":"2014","author":"Belhaouari","year":"2014","journal-title":"Math. Probl. Eng."},{"key":"10.1016\/j.ins.2022.11.139_b0110","article-title":"Energy efficient grid-based k-means clustering algorithm for large scale wireless sensor networks","volume":"e5255","author":"Ben Gouissem","year":"2022","journal-title":"Int. J. Commun Syst"},{"key":"10.1016\/j.ins.2022.11.139_b0115","doi-asserted-by":"crossref","DOI":"10.1016\/j.parco.2020.102736","article-title":"A new scalable distributed K-means algorithm based on Cloud micro-services for high-performance computing","volume":"101","author":"Benchara","year":"2021","journal-title":"Parallel Comput."},{"issue":"3","key":"10.1016\/j.ins.2022.11.139_b0120","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1002\/sam.11416","article-title":"TiK-means: Transformation-infused K-means clustering for skewed groups","volume":"12","author":"Berry","year":"2019","journal-title":"Stat. Anal. Data Mining: ASA Data Sci. J."},{"key":"10.1016\/j.ins.2022.11.139_b0125","series-title":"The Million-Song Dataset","first-page":"591","author":"Bertin-Mahieux","year":"2011"},{"issue":"2\u20133","key":"10.1016\/j.ins.2022.11.139_b0130","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0098-3004(84)90020-7","article-title":"FCM: The fuzzy c-means clustering algorithm","volume":"10","author":"Bezdek","year":"1984","journal-title":"Comput. Geosci."},{"key":"10.1016\/j.ins.2022.11.139_b0135","doi-asserted-by":"crossref","unstructured":"Biswas, C., Ganguly, D., Roy, D., & Bhattacharya, U. (2019). Privacy preserving approximate K-means clustering. In Proceedings of the 28th ACM International Conference on Information and Knowledge Management, 1321-1330.","DOI":"10.1145\/3357384.3357969"},{"key":"10.1016\/j.ins.2022.11.139_b0140","series-title":"Algorithm Engineering","first-page":"81","article-title":"Theoretical analysis of the K-means algorithm\u2013a survey","author":"Bl\u00f6mer","year":"2016"},{"key":"10.1016\/j.ins.2022.11.139_b0145","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2020.106731","article-title":"A unified form of fuzzy C-means and K-means algorithms and its partitional implementation","volume":"214","author":"Borlea","year":"2021","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.ins.2022.11.139_b0150","series-title":"2015 IEEE\/ACS 12th International Conference of Computer Systems and Applications (AICCSA)","first-page":"1","article-title":"An improved MapReduce design of Kmeans for clustering very large datasets","author":"Boukhdhir","year":"2015"},{"key":"10.1016\/j.ins.2022.11.139_b0155","first-page":"368","article-title":"Clustering via concave minimization","volume":"9","author":"Bradley","year":"1997","journal-title":"Adv. Neural Inf. Proces. Syst."},{"key":"10.1016\/j.ins.2022.11.139_b0160","doi-asserted-by":"crossref","unstructured":"Cai, J., Liao, D., Chen, J., Chen, X., Liu, T., & Xi, J. (2020). Research on data security protection method based on improved K-means clustering algorithm. In 2020 the 4th International Conference on Big Data Research (ICBDR'20), 7-11.","DOI":"10.1145\/3445945.3445947"},{"key":"10.1016\/j.ins.2022.11.139_b0165","article-title":"Statistical and computational trade-offs in kernel k-means","volume":"31","author":"Calandriello","year":"2018","journal-title":"Adv. Neural Inf. Proces. Syst."},{"key":"10.1016\/j.ins.2022.11.139_b0170","first-page":"1","article-title":"An efficient K-means clustering algorithm for tall data","author":"Cap\u00f3","year":"2020","journal-title":"Data Min. Knowl. Disc."},{"key":"10.1016\/j.ins.2022.11.139_b0175","doi-asserted-by":"crossref","unstructured":"Casper, E., Hung, C. C., Jung, E., & Yang, M. (2012). A quantum-modeled K-means clustering algorithm for multi-band image segmentation. In Proceedings of the 2012 ACM Research in Applied Computation Symposium, 158-163.","DOI":"10.1145\/2401603.2401639"},{"issue":"1","key":"10.1016\/j.ins.2022.11.139_b0180","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.eswa.2012.07.021","article-title":"A comparative study of efficient initialization methods for the K-means clustering algorithm","volume":"40","author":"Celebi","year":"2013","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.ins.2022.11.139_b0185","doi-asserted-by":"crossref","unstructured":"Chawla, S., & Gionis, A. (2013). K-means\u2013: A unified approach to clustering and outlier detection. In Proceedings of the 2013 Society for Industrial and Applied Mathematics (SIAM) international conference on data mining, 189-197.","DOI":"10.1137\/1.9781611972832.21"},{"key":"10.1016\/j.ins.2022.11.139_b0190","article-title":"Fast kernel K-means clustering using incomplete Cholesky factorization","volume":"402","author":"Chen","year":"2021","journal-title":"Appl. Math Comput."},{"key":"10.1016\/j.ins.2022.11.139_b0195","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.acha.2020.03.002","article-title":"Diffusion K-means clustering on manifolds: Provable exact recovery via semidefinite relaxations","volume":"52","author":"Chen","year":"2021","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"4","key":"10.1016\/j.ins.2022.11.139_b0200","doi-asserted-by":"crossref","first-page":"932","DOI":"10.1109\/TKDE.2011.262","article-title":"TW-K-means: Automated two-level variable weighting clustering algorithm for multiview data","volume":"25","author":"Chen","year":"2011","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.ins.2022.11.139_b0205","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2021.114807","article-title":"MK-means: Detecting evolutionary communities in dynamic networks","volume":"176","author":"Chen","year":"2021","journal-title":"Expert Syst. Appl."},{"issue":"15","key":"10.1016\/j.ins.2022.11.139_b0210","doi-asserted-by":"crossref","first-page":"2883","DOI":"10.1016\/S0167-8655(03)00146-6","article-title":"K\u2217-Means: A new generalized K-means clustering algorithm","volume":"24","author":"Cheung","year":"2003","journal-title":"Pattern Recogn. Lett."},{"key":"10.1016\/j.ins.2022.11.139_b0215","article-title":"Query k-means clustering and the double dixie cup problem","volume":"31","author":"Chien","year":"2018","journal-title":"Adv. Neural Inf. Proces. Syst."},{"key":"10.1016\/j.ins.2022.11.139_b0220","series-title":"2016 International Conference on Advances in Computing, Communications, and Informatics, (ICACCI)","first-page":"947","article-title":"Faster Mahalanobis K-means clustering for Gaussian distributions","author":"Chokniwal","year":"2016"},{"key":"10.1016\/j.ins.2022.11.139_b0225","article-title":"A generalization of K-means for overlapping clustering","volume":"54","author":"Cleuziou","year":"2007","journal-title":"Rapport Technique"},{"key":"10.1016\/j.ins.2022.11.139_b0230","doi-asserted-by":"crossref","unstructured":"Cleuziou, G. (2008, December). An extended version of the K-means method for overlapping clustering. In 2008 19th International Conference on Pattern Recognition, IEEE, 1-4.","DOI":"10.1109\/ICPR.2008.4761079"},{"key":"10.1016\/j.ins.2022.11.139_b0235","doi-asserted-by":"crossref","unstructured":"Couto, J. (2005, September). Kernel K-means for categorical data. In International Symposium on Intelligent Data Analysis Springer, Berlin, Heidelberg, 46-56.","DOI":"10.1007\/11552253_5"},{"issue":"3","key":"10.1016\/j.ins.2022.11.139_b0240","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1007\/s11227-014-1225-7","article-title":"Optimized big data K-means clustering using MapReduce","volume":"70","author":"Cui","year":"2014","journal-title":"J. Supercomput."},{"issue":"4","key":"10.1016\/j.ins.2022.11.139_b0245","doi-asserted-by":"crossref","first-page":"2411","DOI":"10.1007\/s10462-020-09918-2","article-title":"A survey on parallel clustering algorithms for big data","volume":"54","author":"Dafir","year":"2021","journal-title":"Artif. Intell. Rev."},{"key":"10.1016\/j.ins.2022.11.139_b0250","doi-asserted-by":"crossref","unstructured":"Dai, W., Jiao, C., & He, T. (2007). Research of K-means clustering method based on parallel genetic algorithm. In Third International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2007), IEEE, 2,158-161.","DOI":"10.1109\/IIH-MSP.2007.259"},{"key":"10.1016\/j.ins.2022.11.139_b0255","series-title":"The 2010 International Joint Conference on Neural Networks (IJCNN)","first-page":"1","article-title":"MK-means-modified K-means clustering algorithm","author":"Dashti","year":"2010"},{"key":"10.1016\/j.ins.2022.11.139_b0260","series-title":"Proceedings of the twenty-first international conference on machine learning","first-page":"29","article-title":"K-means clustering via principal component analysis","author":"Ding","year":"2004"},{"key":"10.1016\/j.ins.2022.11.139_b0265","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1016\/j.ins.2021.04.076","article-title":"Clustering mixed numerical and categorical data with missing values","volume":"571","author":"Dinh","year":"2021","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2022.11.139_b0270","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1051\/ps\/2016016","article-title":"The coupon collector\u2019s problem revisited: generalizing the double dixie cup problem of newman and shepp","volume":"20","author":"Doumas","year":"2016","journal-title":"ESAIM: Probab. Stat."},{"key":"10.1016\/j.ins.2022.11.139_b0275","first-page":"731","volume":"Vol. 3","author":"Duda","year":"1973","journal-title":"Pattern classification and scene analysis"},{"key":"10.1016\/j.ins.2022.11.139_b0280","first-page":"291","article-title":"Clustering in large graphs and matrices","volume":"99","author":"Drineas","year":"1999","journal-title":"SODA"},{"key":"10.1016\/j.ins.2022.11.139_b0285","unstructured":"Elkan, C. (2003). Using the triangle inequality to accelerate K-means. In Machine Learning, Proceedings of the Twentieth International Conference (ICML 2003), Washington, DC, USA,147-153."},{"key":"10.1016\/j.ins.2022.11.139_b0290","series-title":"Proceedings of the 2001 ACM\/SIGDA ninth international symposium on Field programmable gate arrays","first-page":"103","article-title":"Algorithmic transformations in the implementation of k-means clustering on reconfigurable hardware","author":"Estlick","year":"2001"},{"key":"10.1016\/j.ins.2022.11.139_b0295","doi-asserted-by":"crossref","first-page":"121089","DOI":"10.1109\/ACCESS.2020.3006173","article-title":"A comparative performance study of hybrid firefly algorithms for automatic data clustering","volume":"8","author":"Ezugwu","year":"2020","journal-title":"IEEE Access"},{"key":"10.1016\/j.ins.2022.11.139_b0300","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2022.104743","article-title":"A comprehensive survey of clustering algorithms: State-of-the-art machine learning applications, taxonomy, challenges, and future research prospects","volume":"110","author":"Ezugwu","year":"2022","journal-title":"Eng. Appl. Artif. Intel."},{"issue":"11","key":"10.1016\/j.ins.2022.11.139_b0305","doi-asserted-by":"crossref","first-page":"6247","DOI":"10.1007\/s00521-020-05395-4","article-title":"Automatic clustering algorithms: A systematic review and bibliometric analysis of relevant literature","volume":"33","author":"Ezugwu","year":"2021","journal-title":"Neural Comput. & Applic."},{"issue":"10","key":"10.1016\/j.ins.2022.11.139_b0310","doi-asserted-by":"crossref","first-page":"1626","DOI":"10.1631\/jzus.2006.A1626","article-title":"An efficient enhanced K-means clustering algorithm","volume":"7","author":"Fahim","year":"2006","journal-title":"Journal of Zhejiang University-Science A"},{"issue":"6","key":"10.1016\/j.ins.2022.11.139_b0315","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1007\/s11222-013-9410-8","article-title":"Snipping for robust K-means clustering under component-wise contamination","volume":"24","author":"Farcomeni","year":"2014","journal-title":"Stat. Comput."},{"key":"10.1016\/j.ins.2022.11.139_b0320","doi-asserted-by":"crossref","unstructured":"Fatta G. D., Blasa, F., Cafiero, S., & Fortino, G. (2011). Epidemic K-means clustering. 2011 IEEE 11th International Conference on Data Mining Workshops (ICDMW), 151(158), 11-11 Dec. 2011.","DOI":"10.1109\/ICDMW.2011.76"},{"key":"10.1016\/j.ins.2022.11.139_b0325","series-title":"2012 IEEE International Conference on Mechatronics and Automation","first-page":"1146","article-title":"A K-means clustering algorithm based on the maximum triangle rule","author":"Feng","year":"2012"},{"key":"10.1016\/j.ins.2022.11.139_b0330","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.patcog.2019.04.014","article-title":"How much can K-means be improved by using better initialization and repeats?","volume":"93","author":"Fr\u00e4nti","year":"2019","journal-title":"Pattern Recogn."},{"key":"10.1016\/j.ins.2022.11.139_b0335","article-title":"Introduction to statistical pattern recognition","author":"Fukunaga","year":"2013","journal-title":"Elsevier"},{"key":"10.1016\/j.ins.2022.11.139_b0340","first-page":"651","article-title":"Data clustering: theory, algorithms, and applications","volume":"64","author":"Gan","year":"2020","journal-title":"Biometrics"},{"issue":"5","key":"10.1016\/j.ins.2022.11.139_b0345","doi-asserted-by":"crossref","first-page":"7397","DOI":"10.1007\/s11042-020-10064-8","article-title":"Skin lesion segmentation using K-means and optimized firefly algorithm","volume":"80","author":"Garg","year":"2021","journal-title":"Multimed. Tools Appl."},{"issue":"8","key":"10.1016\/j.ins.2022.11.139_b0350","doi-asserted-by":"crossref","first-page":"879","DOI":"10.3390\/math9080879","article-title":"Markov chain K-means cluster models and their use for companies\u2019 credit quality and default probability estimation","volume":"9","author":"Gavira-Dur\u00f3n","year":"2021","journal-title":"Mathematics"},{"key":"10.1016\/j.ins.2022.11.139_b0355","doi-asserted-by":"crossref","first-page":"217416","DOI":"10.1109\/ACCESS.2020.3040745","article-title":"An improved K-means algorithm based on fuzzy metrics","volume":"8","author":"Geng","year":"2020","journal-title":"IEEE Access"},{"key":"10.1016\/j.ins.2022.11.139_b0360","unstructured":"Georgogiannis, A. (2016). Robust K-means: a theoretical revisit. Advances in Neural Information Processing Systems, 29."},{"issue":"2","key":"10.1016\/j.ins.2022.11.139_b0365","doi-asserted-by":"crossref","first-page":"e12886","DOI":"10.1111\/exsy.12886","article-title":"Spherical fuzzy extension of AHP-ARAS methods integrated with modified k-means clustering for logistics hub location problem","volume":"39","author":"Gocer","year":"2022","journal-title":"Expert. Syst."},{"key":"10.1016\/j.ins.2022.11.139_b0370","article-title":"Localized data fusion for kernel K-means clustering with application to cancer biology","volume":"27","author":"G\u00f6nen","year":"2014","journal-title":"Adv. Neural Inf. Proces. Syst."},{"issue":"7","key":"10.1016\/j.ins.2022.11.139_b0375","article-title":"A review on K-mode clustering algorithm","volume":"8","author":"Goyal","year":"2017","journal-title":"Int. J. Adv. Res. Comput. Sci."},{"key":"10.1016\/j.ins.2022.11.139_b0380","series-title":"In 2016 7th IEEE International Conference on Software Engineering and Service Science (ICSESS)","first-page":"836","article-title":"A novel locality sensitive K-means clustering algorithm based on subtractive clustering","author":"Gu","year":"2016"},{"key":"10.1016\/j.ins.2022.11.139_b0385","article-title":"Reuse-centric K-means configuration","volume":"100","author":"Guan","year":"2018","journal-title":"Inf. Syst."},{"key":"10.1016\/j.ins.2022.11.139_b0390","series-title":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","first-page":"251","article-title":"K-intervals: A new extension of the K-means algorithm","author":"Guo","year":"2014"},{"issue":"7","key":"10.1016\/j.ins.2022.11.139_b0395","doi-asserted-by":"crossref","first-page":"757","DOI":"10.14778\/3067421.3067425","article-title":"Local search methods for K-means with outliers","volume":"10","author":"Gupta","year":"2017","journal-title":"Proceedings of the VLDB Endowment"},{"key":"10.1016\/j.ins.2022.11.139_b0400","article-title":"Learning the k in K-means","volume":"16","author":"Hamerly","year":"2003","journal-title":"Adv. Neural Inf. Proces. Syst."},{"issue":"2","key":"10.1016\/j.ins.2022.11.139_b0405","article-title":"Origins and extensions of the K-means algorithm in cluster analysis","volume":"4","author":"Hans-Hermann","year":"2008","journal-title":"Journal Electronique d\u2019Histoire des Probabilit\u00e9s et de la Statistique Electron. J. History Prob. Stat."},{"issue":"10","key":"10.1016\/j.ins.2022.11.139_b0410","doi-asserted-by":"crossref","first-page":"5483","DOI":"10.1109\/JSEN.2015.2443380","article-title":"An enhanced K-means and ANOVA-based clustering approach for similarity aggregation in underwater wireless sensor networks","volume":"15","author":"Harb","year":"2015","journal-title":"IEEE Sens. J."},{"key":"10.1016\/j.ins.2022.11.139_b0415","series-title":"IEEE International Joint Conference Neural Networks","article-title":"Initialization of cluster refinement algorithms: A review and comparative study","author":"He","year":"2004"},{"issue":"14","key":"10.1016\/j.ins.2022.11.139_b0420","doi-asserted-by":"crossref","first-page":"e6621","DOI":"10.1002\/cpe.6621","article-title":"Parallel and accurate k-means algorithm on CPU-GPU architectures for spectral clustering","volume":"34","author":"He","year":"2022","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"10.1016\/j.ins.2022.11.139_b0425","series-title":"2011 IEEE International Conference on Fuzzy Systems (FUZZ)","first-page":"1710","article-title":"PCA-guided K-means clustering with incomplete data","author":"Honda","year":"2011"},{"issue":"1","key":"10.1016\/j.ins.2022.11.139_b0430","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/TFUZZ.2009.2036603","article-title":"Fuzzy PCA-guided robust K-means clustering","volume":"18","author":"Honda","year":"2009","journal-title":"IEEE Trans. Fuzzy Syst."},{"key":"10.1016\/j.ins.2022.11.139_b0435","series-title":"2017 12th International Conference on Computer Science and Education (ICCSE)","first-page":"464","article-title":"Improved K-means algorithm based on hybrid fruit fly optimization and differential evolution","author":"Hu","year":"2017"},{"key":"10.1016\/j.ins.2022.11.139_b0440","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2021.107996","article-title":"Robust deep K-means: An effective and simple method for data clustering","volume":"117","author":"Huang","year":"2021","journal-title":"Pattern Recogn."},{"issue":"3","key":"10.1016\/j.ins.2022.11.139_b0445","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1023\/A:1009769707641","article-title":"Extensions to the K-means algorithm for clustering large data sets with categorical values","volume":"2","author":"Huang","year":"1998","journal-title":"Data Min. Knowl. Disc."},{"key":"10.1016\/j.ins.2022.11.139_b0450","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.eswa.2018.09.006","article-title":"A K-means based co-clustering (kCC) algorithm for sparse, high dimensional data","volume":"118","author":"Hussain","year":"2019","journal-title":"Expert Syst. Appl."},{"issue":"4","key":"10.1016\/j.ins.2022.11.139_b0455","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1109\/TCBB.2014.2306200","article-title":"A simple but powerful heuristic method for accelerating K-Means clustering of large-scale data in life science","volume":"11","author":"Ichikawa","year":"2014","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"issue":"23","key":"10.1016\/j.ins.2022.11.139_b0460","doi-asserted-by":"crossref","first-page":"11246","DOI":"10.3390\/app112311246","article-title":"K-Means-based nature-inspired metaheuristic algorithms for automatic data clustering problems: Recent advances and future directions","volume":"11","author":"Ikotun","year":"2021","journal-title":"Appl. Sci."},{"key":"10.1016\/j.ins.2022.11.139_b0465","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1016\/j.eswa.2017.09.005","article-title":"Combining K-means and a genetic algorithm through a novel arrangement of genetic operators for high quality clustering","volume":"91","author":"Islam","year":"2018","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.ins.2022.11.139_b0470","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1016\/j.patcog.2018.02.015","article-title":"IK-means\u2212+: An iterative clustering algorithm based on an enhanced version of the K-means","volume":"79","author":"Ismkhan","year":"2018","journal-title":"Pattern Recogn."},{"issue":"8","key":"10.1016\/j.ins.2022.11.139_b0475","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 Recogn. Lett."},{"key":"10.1016\/j.ins.2022.11.139_b0480","series-title":"Algorithms for clustering data","author":"Jain","year":"1988"},{"issue":"3","key":"10.1016\/j.ins.2022.11.139_b0485","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","article-title":"Data clustering: A review","volume":"31","author":"Jain","year":"1999","journal-title":"ACM Comput. Surveys (CSUR)"},{"key":"10.1016\/j.ins.2022.11.139_b0490","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1071\/BT9660127","article-title":"Multidimensional group analysis","volume":"14","author":"Jancey","year":"1966","journal-title":"Aust. J. Bot."},{"key":"10.1016\/j.ins.2022.11.139_b0495","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/j.asoc.2015.12.001","article-title":"Automatic clustering using nature-inspired metaheuristics: A survey","volume":"41","author":"Jos\u00e9-Garc\u00eda","year":"2016","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"10.1016\/j.ins.2022.11.139_b0500","first-page":"22","article-title":"Mammography images segmentation via fuzzy C-mean and K-means","volume":"12","author":"Kamil","year":"2019","journal-title":"Internat. J. Intell. Eng. Syst."},{"issue":"1","key":"10.1016\/j.ins.2022.11.139_b0505","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1007\/s13198-015-0365-3","article-title":"An improved K-means clustering with Atkinson index to classify liver patient dataset","volume":"7","author":"Kant","year":"2016","journal-title":"Internat. J. Syst. Assurance Eng. Manage."},{"issue":"7","key":"10.1016\/j.ins.2022.11.139_b0510","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1109\/TPAMI.2002.1017616","article-title":"An efficient K-means clustering algorithm: Analysis and implementation","volume":"24","author":"Kanungo","year":"2002","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.ins.2022.11.139_b0515","doi-asserted-by":"crossref","unstructured":"Kao, Y., & Lee, S. Y. (2009). Combining K-means and particle swarm optimization for dynamic data clustering problems. In 2009 IEEE International Conference on Intelligent Computing and Intelligent Systems, IEEE,1, 757-761.","DOI":"10.1109\/ICICISYS.2009.5358020"},{"key":"10.1016\/j.ins.2022.11.139_b0520","series-title":"2016 Fourth International Conference on Parallel","first-page":"202","article-title":"On K-means data clustering algorithm with genetic algorithm","author":"Kapil","year":"2016"},{"key":"10.1016\/j.ins.2022.11.139_b0525","series-title":"2017 3rd international conference on computational intelligence and communication technology (CICT)","first-page":"1","article-title":"A comparative study of K-means, K-means++ and Fuzzy C-Means clustering algorithms","author":"Kapoor","year":"2017"},{"key":"10.1016\/j.ins.2022.11.139_b0530","series-title":"Statistical Data Analysis Based on the L1 - Norm and Related Methods","first-page":"405","article-title":"Clustering by means of medoids","author":"Kaufman","year":"1987"},{"key":"10.1016\/j.ins.2022.11.139_b0535","series-title":"Finding groups in data: An introduction to cluster analysis","author":"Kaufman","year":"2009"},{"key":"10.1016\/j.ins.2022.11.139_b0540","series-title":"Finding groups in data: an introduction to cluster analysis","author":"Kaufman","year":"2008"},{"key":"10.1016\/j.ins.2022.11.139_b0545","series-title":"International Journal of Advanced Research in Computer Engineering and Technology (IJARCET)","first-page":"2","article-title":"Statistically refining the initial points for K-means clustering algorithm","author":"Kaur","year":"2013"},{"key":"10.1016\/j.ins.2022.11.139_b0550","first-page":"1","article-title":"Quantum K-means clustering method for detecting heart disease using quantum circuit approach","author":"Kavitha","year":"2022","journal-title":"Soft. Comput."},{"key":"10.1016\/j.ins.2022.11.139_b0555","doi-asserted-by":"crossref","DOI":"10.1016\/j.jnca.2020.102539","article-title":"Survey and taxonomy of clustering algorithms in 5G","volume":"154","author":"Khan","year":"2020","journal-title":"J. Netw. Comput. Appl."},{"key":"10.1016\/j.ins.2022.11.139_b0560","series-title":"2012 IEEE International Joint Conference on Computer Science and Software Engineering (JCSSE)","first-page":"346","article-title":"Dynamic load balancing on GPU clusters for large-scale K-means clustering","author":"Kijsipongse","year":"2012"},{"issue":"1","key":"10.1016\/j.ins.2022.11.139_b0565","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/j.infsof.2008.09.009","article-title":"Systematic literature reviews in software engineering\u2013a systematic literature review","volume":"51","author":"Kitchenham","year":"2009","journal-title":"Inf. Softw. Technol."},{"issue":"1","key":"10.1016\/j.ins.2022.11.139_b0570","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s00180-012-0358-5","article-title":"Music and timbre segmentation by recursive constrained K-means clustering","volume":"29","author":"Krey","year":"2014","journal-title":"Comput. Stat."},{"key":"10.1016\/j.ins.2022.11.139_b0575","series-title":"Learning multiple layers of features from tiny images","author":"Krizhevsky","year":"2009"},{"key":"10.1016\/j.ins.2022.11.139_b0580","doi-asserted-by":"crossref","unstructured":"Kumar, P., & Wasan, S. K. (2010). Analysis of X-means and global K-means using tumor classification. In 2010 The 2nd International Conference on Computer and Automation Engineering (ICCAE), IEEE, 5, 832-835.","DOI":"10.1109\/ICCAE.2010.5451883"},{"key":"10.1016\/j.ins.2022.11.139_b0585","doi-asserted-by":"crossref","unstructured":"Kuo, R. J., Suryani, E., & Yasid, A. (2013). Automatic clustering combining differential evolution algorithm and K-means algorithm. In Proceedings of the Institute of Industrial Engineers Asian Conference Springer, Singapore, 1207-1215.","DOI":"10.1007\/978-981-4451-98-7_143"},{"issue":"11","key":"10.1016\/j.ins.2022.11.139_b0590","doi-asserted-by":"crossref","first-page":"2551","DOI":"10.1016\/j.patcog.2009.02.014","article-title":"A fast K-means clustering algorithm using cluster center displacement","volume":"42","author":"Lai","year":"2009","journal-title":"Pattern Recogn."},{"issue":"7","key":"10.1016\/j.ins.2022.11.139_b0595","doi-asserted-by":"crossref","first-page":"1349","DOI":"10.1007\/s00521-012-0959-5","article-title":"PSO-based K-means clustering with enhanced cluster matching for gene expression data","volume":"22","author":"Lam","year":"2013","journal-title":"Neural Comput. Appl."},{"key":"10.1016\/j.ins.2022.11.139_b0600","doi-asserted-by":"crossref","unstructured":"Lange, T., Law, M. H., Jain, A. K., & Buhmann, J. M. (2005). Learning with constrained and unlabelled data. In 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) (Vol. 1, pp. 731-738), doi: 10.1109\/CVPR.2005.210.","DOI":"10.1109\/CVPR.2005.210"},{"issue":"10","key":"10.1016\/j.ins.2022.11.139_b0605","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1631\/jzus.C1200078","article-title":"An accelerated K-means clustering algorithm using selection and erasure rules","volume":"13","author":"Lee","year":"2012","journal-title":"J. Zhejiang Univ. Sci. C"},{"issue":"2","key":"10.1016\/j.ins.2022.11.139_b0610","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1134\/S1054661813020144","article-title":"Fast K-means clustering using deletion by center displacement and norms product (CDNP)","volume":"23","author":"Lee","year":"2013","journal-title":"Pattern Recognit Image Anal."},{"issue":"19","key":"10.1016\/j.ins.2022.11.139_b0615","doi-asserted-by":"crossref","first-page":"12043","DOI":"10.1007\/s11042-016-3322-5","article-title":"Robust K-means algorithm with automatically splitting and merging clusters and its applications for surveillance data","volume":"75","author":"Lei","year":"2016","journal-title":"Multimed. Tools Appl."},{"issue":"7","key":"10.1016\/j.ins.2022.11.139_b0620","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1038\/nmeth.4346","article-title":"Points of significance: Principal component analysis","volume":"14","author":"Lever","year":"2017","journal-title":"Nat. Methods"},{"key":"10.1016\/j.ins.2022.11.139_b0625","doi-asserted-by":"crossref","first-page":"1573","DOI":"10.2147\/DMSO.S206640","article-title":"K-means clustering of overweight and obese population using quantile-transformed metabolic data","volume":"12","author":"Li","year":"2019","journal-title":"Diabetes Metab. Syndrome Obes. Targets Ther."},{"key":"10.1016\/j.ins.2022.11.139_b0630","first-page":"63","article-title":"An improved algorithm of K-means","volume":"2","author":"Li","year":"2007","journal-title":"J. Beijing Inst. Graph. Commun."},{"issue":"2","key":"10.1016\/j.ins.2022.11.139_b0635","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/S0031-3203(02)00060-2","article-title":"The global K-means clustering algorithm","volume":"36","author":"Likas","year":"2003","journal-title":"Pattern Recogn."},{"issue":"1","key":"10.1016\/j.ins.2022.11.139_b0640","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/s42405-018-0117-0","article-title":"The selection of vertiport location for on-demand mobility and its application to Seoul metro area","volume":"20","author":"Lim","year":"2019","journal-title":"Int. J. Aeronaut. Space Sci."},{"issue":"1","key":"10.1016\/j.ins.2022.11.139_b0645","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/B:JIIS.0000029668.88665.1a","article-title":"Interval set clustering of web users with rough K-means","volume":"23","author":"Lingras","year":"2004","journal-title":"J. Intell. Inf. Syst."},{"key":"10.1016\/j.ins.2022.11.139_b0650","series-title":"Proceedings of the 2019 10th International Conference on E-business, Management and Economics","first-page":"115","article-title":"Online retail sales prediction with integrated framework of K-means and neural network","author":"Lingxian","year":"2019"},{"issue":"6","key":"10.1016\/j.ins.2022.11.139_b0655","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1002\/sam.11392","article-title":"An efficient K-means-type algorithm for clustering datasets with incomplete records","volume":"11","author":"Lithio","year":"2018","journal-title":"Stat. Anal. Data Mining: ASA Data Sci. J."},{"key":"10.1016\/j.ins.2022.11.139_b0660","series-title":"Bell Telephone Labs Memorandum, Murray Hill NJ. Reprinted In: IEEE Trans. Information Theory IT-28 2","first-page":"129","article-title":"Least squares quantization in PCM","author":"Lloyd","year":"1982"},{"key":"10.1016\/j.ins.2022.11.139_b0665","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1016\/j.neucom.2022.05.120","article-title":"A multi-view clustering framework via integrating K-means and graph-cut","volume":"501","author":"Lu","year":"2022","journal-title":"Neurocomputing"},{"key":"10.1016\/j.ins.2022.11.139_b0670","series-title":"International Conference on Web Information Systems and Mining","first-page":"162","article-title":"Parallel K-means clustering of remote sensing images based on MapReduce","author":"Lv","year":"2010"},{"key":"10.1016\/j.ins.2022.11.139_b0675","series-title":"Fifth Berkeley Symposium on Mathematics. Statistics and Probability","first-page":"281","article-title":"Some methods for classification and analysis of multivariate observations","author":"MacQueen","year":"1967"},{"key":"10.1016\/j.ins.2022.11.139_b0680","series-title":"2012 7th International Conference on Electrical and Computer Engineering","first-page":"647","article-title":"Improvement of K-means clustering algorithm with better initial centroids based on weighted average","author":"Mahmud","year":"2012"},{"key":"10.1016\/j.ins.2022.11.139_b0685","first-page":"16142","article-title":"Improved guarantees for K-means++ and K-means++ Parallel","volume":"33","author":"Makarychev","year":"2020","journal-title":"Adv. Neural Inf. Proces. Syst."},{"issue":"4","key":"10.1016\/j.ins.2022.11.139_b0690","doi-asserted-by":"crossref","first-page":"5181","DOI":"10.1007\/s11227-021-04078-8","article-title":"A MapReduce-based K-means clustering algorithm","volume":"78","author":"Mao","year":"2022","journal-title":"J. Supercomput."},{"key":"10.1016\/j.ins.2022.11.139_b0695","article-title":"K-means clustering of lines for big data","volume":"32","author":"Marom","year":"2019","journal-title":"Adv. Neural Inf. Proces. Syst."},{"key":"10.1016\/j.ins.2022.11.139_b0700","doi-asserted-by":"crossref","first-page":"10562","DOI":"10.1109\/ACCESS.2017.2706947","article-title":"Privacy-preserving data mining: methods, metrics, and applications","volume":"5","author":"Mendes","year":"2017","journal-title":"IEEE Access"},{"key":"10.1016\/j.ins.2022.11.139_b0705","doi-asserted-by":"crossref","unstructured":"Min, W., & Siqing, Y. (2010). Improved K-means clustering based on genetic algorithm. In 2010 International Conference on Computer Application and System Modeling (ICCASM 2010), IEEE, 6, 636.","DOI":"10.1109\/ICCASM.2010.5620383"},{"key":"10.1016\/j.ins.2022.11.139_b0710","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2022.109189","article-title":"A new metaheuristic optimization based on K-means clustering algorithm and its application for structural damage identification in a complex 3D concrete structure","volume":"251","author":"Minh","year":"2022","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.ins.2022.11.139_b0715","doi-asserted-by":"crossref","unstructured":"Mirkin, B. (2005), Clustering for data mining: A data recovery approach. Boca Raton FL: Chapman and Hall\/CRC. https:\/\/doi.org\/10.1201\/9781420034912.","DOI":"10.1201\/9781420034912"},{"key":"10.1016\/j.ins.2022.11.139_b0720","series-title":"Proceedings of the International Conference on Advances in Computing, Communications, and Informatics","first-page":"106","article-title":"Far efficient K-means clustering algorithm","author":"Mishra","year":"2012"},{"issue":"3","key":"10.1016\/j.ins.2022.11.139_b0725","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1023\/A:1024016609528","article-title":"Feature weighting in K-means clustering","volume":"52","author":"Modha","year":"2003","journal-title":"Mach. Learn."},{"issue":"1","key":"10.1016\/j.ins.2022.11.139_b0730","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1049\/sfw2.12032","article-title":"An improved K-means algorithm for big data","volume":"16","author":"Moodi","year":"2021","journal-title":"IET Softw."},{"issue":"2","key":"10.1016\/j.ins.2022.11.139_b0735","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1080\/08923647.2020.1696140","article-title":"Student engagement level in an e-learning environment: Clustering using K-means","volume":"34","author":"Moubayed","year":"2020","journal-title":"Am. J. Dist. Educ."},{"key":"10.1016\/j.ins.2022.11.139_b0740","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2020.113317","article-title":"A comparison of clustering algorithms for automatic modulation classification","volume":"151","author":"Mouton","year":"2020","journal-title":"Expert Syst. Appl."},{"issue":"15","key":"10.1016\/j.ins.2022.11.139_b0745","doi-asserted-by":"crossref","first-page":"6361","DOI":"10.1007\/s00500-018-3289-4","article-title":"A hybrid approach using genetic algorithm and the differential evolution heuristic for enhanced initialization of the K-means algorithm with applications in text clustering","volume":"23","author":"Mustafi","year":"2019","journal-title":"Soft. Comput."},{"key":"10.1016\/j.ins.2022.11.139_b0750","series-title":"2010 Third International Symposium on intelligent information technology and security informatics","first-page":"63","article-title":"Research on K-means clustering algorithm: An improved K-means clustering algorithm","author":"Na","year":"2010"},{"issue":"2","key":"10.1016\/j.ins.2022.11.139_b0755","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1080\/08839514.2018.1530869","article-title":"A K-means-galactic swarm optimization-based clustering algorithm with Otsu\u2019s entropy for brain tumor detection","volume":"33","author":"Nanda","year":"2019","journal-title":"Appl. Artif. Intell."},{"key":"10.1016\/j.ins.2022.11.139_b0760","doi-asserted-by":"crossref","unstructured":"Nandapala, E. Y. L., & Jayasena, K. P. N. (2020). The practical approach in customers segmentation by using the K-means algorithm. In 2020 IEEE 15th International Conference on Industrial and Information Systems (ICIIS), IEEE, 344-349.","DOI":"10.1109\/ICIIS51140.2020.9342639"},{"issue":"1","key":"10.1016\/j.ins.2022.11.139_b0765","first-page":"1","article-title":"Enhanced K-means clustering algorithm for malaria image segmentation","volume":"42","author":"Nasir","year":"2018","journal-title":"J. Adv. Res. Fluid Mech. Thermal Sci."},{"key":"10.1016\/j.ins.2022.11.139_b0770","unstructured":"Nazeer, K. A., & Sebastian, M. P. (2009). Improving the accuracy and efficiency of the k-means clustering algorithm. In Proceedings of the world congress on engineering, 1, 1-3. London, UK: Association of Engineers."},{"key":"10.1016\/j.ins.2022.11.139_b0775","series-title":"2011 Second International Conference on Emerging Applications of Information Technology 261\u2013264","article-title":"Enhancing the k-means clustering algorithm by using a O (n logn) heuristic method for finding better initial centroids","author":"Nazeer","year":"2011"},{"key":"10.1016\/j.ins.2022.11.139_b0780","unstructured":"Newling, J., & Fleuret, F. (2016). Nested mini-batch K-means. Advances in Neural Information Processing Systems, 29."},{"key":"10.1016\/j.ins.2022.11.139_b0785","article-title":"K-medoids for K-means seeding","volume":"30","author":"Newling","year":"2017","journal-title":"Adv. Neural Inf. Proces. Syst."},{"issue":"1","key":"10.1016\/j.ins.2022.11.139_b0790","doi-asserted-by":"crossref","first-page":"58","DOI":"10.2307\/2308930","article-title":"The double dixie cup problem","volume":"67","author":"Newman","year":"1960","journal-title":"Am. Math. Mon."},{"issue":"5","key":"10.1016\/j.ins.2022.11.139_b0795","doi-asserted-by":"crossref","first-page":"1003","DOI":"10.1109\/TKDE.2002.1033770","article-title":"CLARANS: A method for clustering objects for spatial data mining","volume":"14","author":"Ng","year":"2002","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"8","key":"10.1016\/j.ins.2022.11.139_b0800","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TKDE.2022.3179554","article-title":"An effective and efficient algorithm for K-means clustering with new formulation","volume":"14","author":"Nie","year":"2022","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.ins.2022.11.139_b0805","doi-asserted-by":"crossref","unstructured":"Niu, K., Gao, Z., Jiao, H., & Deng, N. (2016). K-means+: A developed clustering algorithm for big data. In 2016 4th International Conference on Cloud Computing and Intelligence Systems (CCIS), IEEE, 141-144.","DOI":"10.1109\/CCIS.2016.7790241"},{"key":"10.1016\/j.ins.2022.11.139_b0810","doi-asserted-by":"crossref","unstructured":"Olukanmi, P. O., & Twala, B. (2017). K-means-sharp: modified centroid update for outlier-robust K-means clustering. In 2017 Pattern Recognition Association of South Africa and Robotics and Mechatronics (PRASA-RobMech), IEEE, 14-19.","DOI":"10.1109\/RoboMech.2017.8261116"},{"issue":"8","key":"10.1016\/j.ins.2022.11.139_b0815","doi-asserted-by":"crossref","first-page":"5939","DOI":"10.1007\/s00521-021-06689-x","article-title":"Automatic detection of outliers and the number of clusters in k-means clustering via Chebyshev-type inequalities","volume":"34","author":"Olukanmi","year":"2022","journal-title":"Neural Comput. & Applic."},{"key":"10.1016\/j.ins.2022.11.139_b0820","series-title":"2014 international conference on computational intelligence and communication networks","first-page":"1047","article-title":"A linear time-complexity k-means algorithm using cluster shifting","author":"Pakhira","year":"2014"},{"issue":"8","key":"10.1016\/j.ins.2022.11.139_b0825","article-title":"Improved K-means map reduce algorithm for big data cluster analysis","volume":"8","author":"Panday","year":"2019","journal-title":"Internat. J. Innov. Technol. Explor. Eng. (IJITEE)"},{"key":"10.1016\/j.ins.2022.11.139_b0830","doi-asserted-by":"crossref","DOI":"10.1016\/j.techfore.2020.120462","article-title":"Borrowers\u2019 credit quality scoring model and applications, with default discriminant analysis based on the extreme learning machine","volume":"165","author":"Pang","year":"2021","journal-title":"Technol. Forecast. Soc. Chang."},{"issue":"2","key":"10.1016\/j.ins.2022.11.139_b0835","doi-asserted-by":"crossref","first-page":"3336","DOI":"10.1016\/j.eswa.2008.01.039","article-title":"A simple and fast algorithm for K-medoids clustering","volume":"36","author":"Park","year":"2009","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.ins.2022.11.139_b0840","unstructured":"Pelleg, D., & Moore, A. W. (2000). X-means: Extending K-means with efficient estimation of the number of clusters. In Proceedings of the 17th International Conference on Machine Learning, June 2000, San Francisco, 727-734."},{"key":"10.1016\/j.ins.2022.11.139_b0845","doi-asserted-by":"crossref","first-page":"1027","DOI":"10.1016\/S0167-8655(99)00069-0","article-title":"An empirical comparison of four initialization methods for the K-means algorithm","volume":"20","author":"Pe\u00f1a","year":"1999","journal-title":"Pattern Recogn. Lett."},{"issue":"9","key":"10.1016\/j.ins.2022.11.139_b0850","doi-asserted-by":"crossref","first-page":"0201874","DOI":"10.1371\/journal.pone.0201874","article-title":"Balancing effort and benefit of K-means clustering algorithms in big data realms","volume":"13","author":"P\u00e9rez-Ortega","year":"2018","journal-title":"PLoS One"},{"key":"10.1016\/j.ins.2022.11.139_b0855","series-title":"Introduction to Data Science and Machine Learning","article-title":"The K-means algorithm evolution","author":"P\u00e9rez-Ortega","year":"2019"},{"key":"10.1016\/j.ins.2022.11.139_b0860","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2020.105682","article-title":"A meta-learning approach for recommending the number of clusters for clustering algorithms","volume":"195","author":"Pimentel","year":"2020","journal-title":"Knowl.-Based Syst."},{"issue":"14","key":"10.1016\/j.ins.2022.11.139_b0865","doi-asserted-by":"crossref","first-page":"19321","DOI":"10.1007\/s11042-021-11016-6","article-title":"An efficient hybrid approach based on PSO, ABC and k-means for cluster analysis","volume":"81","author":"Pu","year":"2022","journal-title":"Multimed. Tools Appl."},{"key":"10.1016\/j.ins.2022.11.139_b0870","series-title":"2020 5th International Conference on Computing, Communication and Security (ICCCS)","first-page":"1","article-title":"Selection of optimal number of clusters and centroids for K-means and fuzzy C-means clustering: A review","author":"Pugazhenthi","year":"2020"},{"issue":"3","key":"10.1016\/j.ins.2022.11.139_b0875","first-page":"285","article-title":"Anomaly detection on flight route using similarity and grouping approach based-on automatic dependent surveillance-broadcast","volume":"5","author":"Pusadan","year":"2019","journal-title":"Internat. J. Adv. Intell. Inform."},{"key":"10.1016\/j.ins.2022.11.139_b0880","doi-asserted-by":"crossref","unstructured":"Qi, J., Yu, Y., Wang, L., & Liu, J. (2016). K*-means: An effective and efficient K-means clustering algorithm. In 2016 IEEE international conferences on big data and cloud computing (BDCloud), social computing and networking (SocialCom), sustainable computing and communications (SustainCom)(BDCloud-SocialCom-SustainCom), IEEE 242-249.","DOI":"10.1109\/BDCloud-SocialCom-SustainCom.2016.46"},{"issue":"1","key":"10.1016\/j.ins.2022.11.139_b0885","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1049\/cvi2.12052","article-title":"KText: Arbitrary shape text detection using modified K-means","volume":"16","author":"Qi","year":"2021","journal-title":"IET Comput. Vis."},{"key":"10.1016\/j.ins.2022.11.139_b0890","article-title":"A strong reinforcement parallel implementation of K-means algorithm using message passing interface","author":"Ragunthar","year":"2021","journal-title":"Mater. Today: Proc."},{"key":"10.1016\/j.ins.2022.11.139_b0895","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/j.knosys.2014.08.011","article-title":"A hybrid clustering technique combining a novel genetic algorithm with K-means","volume":"71","author":"Rahman","year":"2014","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.ins.2022.11.139_b0900","doi-asserted-by":"crossref","unstructured":"Rajah, V., & Ezugwu, A. E. (2020). Hybrid symbiotic organism search algorithms for automatic data clustering. In 2020 Conference on Information Communications Technology and Society (ICTAS), IEEE, 1-9.","DOI":"10.1109\/ICTAS47918.2020.234001"},{"key":"10.1016\/j.ins.2022.11.139_b0905","doi-asserted-by":"crossref","unstructured":"Rathore, P., & Shukla, D. (2015). Analysis and performance improvement of K-means clustering in big data environment. In 2015 International Conference on Communication Networks (ICCN), IEEE, 43-46.","DOI":"10.1109\/ICCN.2015.9"},{"key":"10.1016\/j.ins.2022.11.139_b0910","doi-asserted-by":"crossref","unstructured":"Ren, S., & Fan, A. (2011). K-means clustering algorithm based on coefficient of variation. In 2011 4th International Congress on Image and Signal Processing IEEE, 4, 2076-2079.","DOI":"10.1109\/CISP.2011.6100578"},{"key":"10.1016\/j.ins.2022.11.139_b0915","article-title":"GBK-means clustering algorithm: An improvement to the K-means algorithm based on the bargaining game","volume":"213","author":"Rezaee","year":"2021","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.ins.2022.11.139_b0920","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2020.107625","article-title":"CNAK: Cluster number assisted K-means","volume":"110","author":"Saha","year":"2021","journal-title":"Pattern Recogn."},{"issue":"5","key":"10.1016\/j.ins.2022.11.139_b0925","first-page":"2249","article-title":"K-mean Clustering and PSO: A review","volume":"3","author":"Saini","year":"2014","journal-title":"Internat. J. Eng. Adv. Technol. (IJEAT) ISSN"},{"issue":"3","key":"10.1016\/j.ins.2022.11.139_b0930","doi-asserted-by":"crossref","DOI":"10.14429\/dsj.68.11843","article-title":"Aerodynamic parameters estimation using radial basis function neural partial differentiation method","volume":"68","author":"Sanwale","year":"2018","journal-title":"Def. Sci. J."},{"key":"10.1016\/j.ins.2022.11.139_b0935","doi-asserted-by":"crossref","unstructured":"Sarma, T. H. Viswanath, P., & Reddy, B. E. (2011). A fast approximate kernel K-means clustering method for large data sets. Recent Advances in Intelligent Computational Systems (RAICS), 2011 IEEE, 545(550), 22-24.","DOI":"10.1109\/RAICS.2011.6069372"},{"key":"10.1016\/j.ins.2022.11.139_b0940","doi-asserted-by":"crossref","unstructured":"Sculley, D. (2010). Web-scale k-means clustering. In Proceedings of the 19th international conference on World wide web, 1177-1178.","DOI":"10.1145\/1772690.1772862"},{"key":"10.1016\/j.ins.2022.11.139_b0945","series-title":"Soft Computing: Theories and Applications","first-page":"171","article-title":"Performance analysis of evolutionary technique based partitional clustering algorithms for wireless sensor networks","author":"Sharma","year":"2020"},{"key":"10.1016\/j.ins.2022.11.139_b0950","series-title":"Thirty-first AAAI Conference on Artificial Intelligence","article-title":"Compressed K-means for large-scale clustering","author":"Shen","year":"2017"},{"key":"10.1016\/j.ins.2022.11.139_b0955","doi-asserted-by":"crossref","first-page":"257","DOI":"10.5926\/jjep1953.40.3_257","article-title":"A PCA-like method for multivariate data with missing values","volume":"40","author":"Shibayama","year":"1992","journal-title":"Jpn. J. Educ. Psychol."},{"key":"10.1016\/j.ins.2022.11.139_b0960","unstructured":"Shindler, M., Wong, A., & Meyerson, A. (2011). Fast and accurate K-means for large datasets. Advances in Neural Information Processing Systems, 24."},{"issue":"2","key":"10.1016\/j.ins.2022.11.139_b0965","first-page":"1213","article-title":"Review of existing methods in K-means clustering algorithm","volume":"4","author":"Shiudkar","year":"2017","journal-title":"Internat. Res. J. Eng. Technol."},{"issue":"8","key":"10.1016\/j.ins.2022.11.139_b0970","doi-asserted-by":"crossref","first-page":"6365","DOI":"10.1016\/j.jksuci.2021.07.003","article-title":"An adaptive outlier removal aided K-means clustering algorithm","volume":"34","author":"Shrifan","year":"2021","journal-title":"J. King Saud Univ.-Comput. Inform. Sci."},{"issue":"1","key":"10.1016\/j.ins.2022.11.139_b0975","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10115-021-01623-y","article-title":"Adapting k-means for graph clustering","volume":"64","author":"Sieranoja","year":"2022","journal-title":"Knowl. Inf. Syst."},{"key":"10.1016\/j.ins.2022.11.139_b0980","series-title":"International Conference on Green, Pervasive, and Cloud Computing","first-page":"31","article-title":"U-control chart based differential evolution clustering for determining the number of clusters in K-means","author":"Silva","year":"2019"},{"key":"10.1016\/j.ins.2022.11.139_b0985","doi-asserted-by":"crossref","first-page":"80716","DOI":"10.1109\/ACCESS.2020.2988796","article-title":"Unsupervised K-means clustering algorithm. IEEE","volume":"8","author":"Sinaga","year":"2020","journal-title":"Access"},{"key":"10.1016\/j.ins.2022.11.139_b0990","doi-asserted-by":"crossref","first-page":"67736","DOI":"10.1109\/ACCESS.2021.3077622","article-title":"Entropy K-means clustering with feature reduction under unknown number of clusters","volume":"9","author":"Sinaga","year":"2021","journal-title":"IEEE Access"},{"key":"10.1016\/j.ins.2022.11.139_b0995","article-title":"Analysis and study of K-means clustering algorithm","volume":"2","author":"Singh","year":"2013","journal-title":"Internat. J. Eng. Res. Technol."},{"issue":"1","key":"10.1016\/j.ins.2022.11.139_b1000","doi-asserted-by":"crossref","first-page":"e12526","DOI":"10.1111\/exsy.12526","article-title":"An intelligent hybrid approach for hepatitis disease diagnosis: Combining enhanced K-means clustering and improved ensemble learning","volume":"38","author":"Singh","year":"2021","journal-title":"Expert. Syst."},{"issue":"4","key":"10.1016\/j.ins.2022.11.139_b1005","doi-asserted-by":"crossref","first-page":"1562","DOI":"10.1007\/s11227-017-2182-8","article-title":"A hybrid MapReduce-based K-means clustering using genetic algorithm for distributed datasets","volume":"74","author":"Sinha","year":"2018","journal-title":"J. Supercomput."},{"key":"10.1016\/j.ins.2022.11.139_b1010","series-title":"A comparison of document clustering techniques KDD workshop on text mining","author":"Steinbach","year":"2000"},{"issue":"12","key":"10.1016\/j.ins.2022.11.139_b1015","first-page":"801","article-title":"Sur la division des corps mat\u00e9riels en parties","volume":"3","author":"Steinhaus","year":"1956","journal-title":"Bulletin de l'Acad\u00e9mie Polonaise des Sciences. Classe"},{"key":"10.1016\/j.ins.2022.11.139_b1020","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s00357-007-0003-0","article-title":"Initializing K-means batch clustering: A critical evaluation of several techniques","volume":"24","author":"Steinley","year":"2007","journal-title":"J. Classif."},{"issue":"1","key":"10.1016\/j.ins.2022.11.139_b1025","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1348\/000711005X48266","article-title":"K-means clustering: a half-century synthesis","volume":"59","author":"Steinley","year":"2006","journal-title":"Br. J. Math. Stat. Psychol."},{"key":"10.1016\/j.ins.2022.11.139_b1030","article-title":"Differentially private K-means with constant multiplicative error","volume":"31","author":"Stemmer","year":"2018","journal-title":"Adv. Neural Inf. Proces. Syst."},{"key":"10.1016\/j.ins.2022.11.139_b1035","doi-asserted-by":"crossref","DOI":"10.1016\/j.scs.2020.102383","article-title":"Integrated framework for identifying sustainable manufacturing layouts based on big data, machine learning, meta-heuristic, and data envelopment analysis","volume":"62","author":"Tayal","year":"2020","journal-title":"Sustain. Cities Soc."},{"key":"10.1016\/j.ins.2022.11.139_b1040","series-title":"Knowledge and Systems Engineering","first-page":"287","article-title":"Fast K-means clustering for very large datasets based on mapreduce combined with a new cutting method","author":"Van-Hieu","year":"2015"},{"issue":"1","key":"10.1016\/j.ins.2022.11.139_b1045","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1145\/974121.974131","article-title":"State-of-the-art in privacy preserving data mining","volume":"33","author":"Verykios","year":"2004","journal-title":"ACM SIGMOD Rec."},{"key":"10.1016\/j.ins.2022.11.139_b1050","doi-asserted-by":"crossref","unstructured":"Vij, R., & Kumar, S. (2012). Improved K-means clustering algorithm for two-dimensional data. In Proceedings of the Second International Conference on Computational Science, Engineering, and Information Technology, 665-670.","DOI":"10.1145\/2393216.2393327"},{"key":"10.1016\/j.ins.2022.11.139_b1055","article-title":"Clustering stable instances of Euclidean K-means","volume":"30","author":"Vijayaraghavan","year":"2017","journal-title":"Adv. Neural Inf. Proces. Syst."},{"key":"10.1016\/j.ins.2022.11.139_b1060","series-title":"IEEE Conference on Computer Vision and Pattern Recognition, Providence, RI, USA","first-page":"3037","article-title":"Fast approximate K-means via cluster closures","author":"Wang","year":"2012"},{"key":"10.1016\/j.ins.2022.11.139_b1065","doi-asserted-by":"crossref","unstructured":"Wang, B., Lv, Z., Zhao, J., Wang, X., & Zhang, T. (2016). An adaptively disperse centroids K-means algorithm based on mapreduce model. In 2016 12th International Conference on Computational Intelligence and Security (CIS), IEEE, 142-146.","DOI":"10.1109\/CIS.2016.0041"},{"key":"10.1016\/j.ins.2022.11.139_b1070","doi-asserted-by":"crossref","unstructured":"Wang, J., & Su, X. (2011). An improved K-means clustering algorithm. In 2011 IEEE 3rd international conference on communication software and networks, IEEE, 44-46.","DOI":"10.1109\/ICCSN.2011.6014384"},{"key":"10.1016\/j.ins.2022.11.139_b1075","doi-asserted-by":"crossref","first-page":"23069","DOI":"10.1109\/ACCESS.2020.2967797","article-title":"Study on the location of private clinics based on K-means clustering method and an integrated evaluation model","volume":"8","author":"Wang","year":"2020","journal-title":"IEEE Access"},{"key":"10.1016\/j.ins.2022.11.139_b1080","unstructured":"Wei, D. (2016). A constant-factor bi-criteria approximation guarantee for K-means++. Advances in Neural Information Processing Systems, 29."},{"issue":"1","key":"10.1016\/j.ins.2022.11.139_b1085","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-007-0114-2","article-title":"Top 10 algorithms in data mining","volume":"14","author":"Wu","year":"2008","journal-title":"Knowl. Inf. Syst."},{"issue":"1","key":"10.1016\/j.ins.2022.11.139_b1090","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/s13198-021-01262-0","article-title":"Research on image text recognition based on canny edge detection algorithm and k-means algorithm","volume":"13","author":"Wu","year":"2022","journal-title":"Internat. J. Syst. Assur. Eng. Manage."},{"key":"10.1016\/j.ins.2022.11.139_b1095","doi-asserted-by":"crossref","first-page":"31171","DOI":"10.1109\/ACCESS.2020.2972333","article-title":"An enhanced regularized K-means type clustering algorithm with adaptive weights","volume":"8","author":"Wu","year":"2020","journal-title":"IEEE Access"},{"issue":"7","key":"10.1016\/j.ins.2022.11.139_b1100","doi-asserted-by":"crossref","first-page":"4966","DOI":"10.1016\/j.eswa.2009.12.017","article-title":"A quantum-inspired genetic algorithm for K-means clustering","volume":"37","author":"Xiao","year":"2010","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"10.1016\/j.ins.2022.11.139_b1105","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2478\/amns.2020.1.00001","article-title":"Improvement of the fast-clustering algorithm improved by K-means in the big data","volume":"5","author":"Xie","year":"2020","journal-title":"Appl. Math. Nonlinear Sci."},{"key":"10.1016\/j.ins.2022.11.139_b1110","series-title":"2016 7th International Conference on Cloud Computing and Big Data (CCBD)","first-page":"265","article-title":"An improved K-means text clustering algorithm by optimizing initial cluster centers","author":"Xiong","year":"2016"},{"issue":"2","key":"10.1016\/j.ins.2022.11.139_b1115","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1016\/j.cja.2020.08.047","article-title":"Helicopter maritime search area planning based on a minimum bounding rectangle and K-means clustering","volume":"34","author":"Xiong","year":"2021","journal-title":"Chin. J. Aeronaut."},{"issue":"2","key":"10.1016\/j.ins.2022.11.139_b1120","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s40745-015-0040-1","article-title":"A comprehensive survey of clustering algorithms","volume":"2","author":"Xu","year":"2015","journal-title":"Ann. Data Sci."},{"issue":"4","key":"10.1016\/j.ins.2022.11.139_b1125","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1109\/72.238318","article-title":"Rival penalized competitive learning for clustering analysis, RBF net, and curve detection","volume":"4","author":"Xu","year":"1993","journal-title":"IEEE Trans. Neural Netw."},{"key":"10.1016\/j.ins.2022.11.139_b1130","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.patrec.2014.11.017","article-title":"PCA-guided search for K-means","volume":"54","author":"Xu","year":"2015","journal-title":"Pattern Recogn. Lett."},{"issue":"2","key":"10.1016\/j.ins.2022.11.139_b1135","doi-asserted-by":"crossref","first-page":"374","DOI":"10.21629\/JSEE.2017.02.18","article-title":"Tag clustering algorithm LMMSK: Improved K-means algorithm based on latent semantic analysis","volume":"28","author":"Yang","year":"2017","journal-title":"J. Syst. Eng. Electron."},{"key":"10.1016\/j.ins.2022.11.139_b1140","doi-asserted-by":"crossref","unstructured":"Yang, K. C., & Chao, W. P. (2020). Applying K-means technique and decision tree analysis to predict Taiwan ETF performance. In 2020 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), IEEE, 635-639.","DOI":"10.1109\/IEEM45057.2020.9309769"},{"key":"10.1016\/j.ins.2022.11.139_b1145","doi-asserted-by":"crossref","first-page":"114472","DOI":"10.1109\/ACCESS.2019.2934179","article-title":"A feature-reduction multi-view K-means clustering algorithm","volume":"7","author":"Yang","year":"2019","journal-title":"IEEE Access"},{"key":"10.1016\/j.ins.2022.11.139_b1150","doi-asserted-by":"crossref","first-page":"2524","DOI":"10.1109\/TIFS.2022.3189532","article-title":"K-means clustering with local d \u03c7-privacy for privacy-preserving data analysis","volume":"17","author":"Yang","year":"2022","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"10.1016\/j.ins.2022.11.139_b1155","unstructured":"Ye, J., Zhao, Z., & Wu, M. (2007). Discriminative K-means for clustering. Advances in Neural Information Processing Systems, 20."},{"key":"10.1016\/j.ins.2022.11.139_b1160","doi-asserted-by":"crossref","unstructured":"Yuan, F., Meng, Z. H., Zhang, H. X., & Dong, C. R. (2004). A new algorithm to get the initial centroids. In Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat. No. 04EX826), 2, 1191-1193.","DOI":"10.1109\/ICMLC.2004.1382371"},{"issue":"24","key":"10.1016\/j.ins.2022.11.139_b1165","first-page":"14238","article-title":"Combination of K-means clustering with genetic algorithm: A review","volume":"12","author":"Zeebaree","year":"2017","journal-title":"Int. J. Appl. Eng. Res."},{"key":"10.1016\/j.ins.2022.11.139_b1170","unstructured":"Zha, H., He, X., Ding, C., Gu, M., & Simon, H. (2001). Spectral relaxation for K-means clustering. Advances in Neural Information Processing Systems, 14."},{"issue":"1","key":"10.1016\/j.ins.2022.11.139_b1175","doi-asserted-by":"crossref","first-page":"27","DOI":"10.3390\/info11010027","article-title":"K-Means clustering-based electrical equipment identification for smart building application","volume":"11","author":"Zhang","year":"2020","journal-title":"Information"},{"key":"10.1016\/j.ins.2022.11.139_b1180","doi-asserted-by":"crossref","unstructured":"Zhang, H., & Zhou, X. (2018). A novel clustering algorithm combining niche genetic algorithm with canopy and K-means. In 2018 International Conference on Artificial Intelligence and Big Data (ICAIBD), IEEE, 26-32.","DOI":"10.1109\/ICAIBD.2018.8396161"},{"key":"10.1016\/j.ins.2022.11.139_b1185","doi-asserted-by":"crossref","DOI":"10.1109\/TDSC.2022.3181667","article-title":"Privacy-Preserving and Outsourced multi-party K-means clustering based on multi-key fully homomorphic encryption","author":"Zhang","year":"2022","journal-title":"IEEE Trans. Dependable Secure Comput."},{"issue":"4","key":"10.1016\/j.ins.2022.11.139_b1190","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1080\/00207160.2015.1124099","article-title":"Improved rough K-means clustering algorithm based on weighted distance measure with Gaussian function","volume":"94","author":"Zhang","year":"2017","journal-title":"Int. J. Comput. Math."},{"key":"10.1016\/j.ins.2022.11.139_b1195","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Zhang, D., & Shi, H. (2012). K-means clustering based on self-adaptive weight. In Proceedings of 2012 2nd International Conference on Computer Science and Network Technology, IEEE, 1540-1544.","DOI":"10.1109\/ICCSNT.2012.6526212"},{"key":"10.1016\/j.ins.2022.11.139_b1200","first-page":"10148","article-title":"Simple and scalable sparse K-means clustering via feature ranking","volume":"33","author":"Zhang","year":"2020","journal-title":"Adv. Neural Inf. Proces. Syst."},{"key":"10.1016\/j.ins.2022.11.139_b1205","series-title":"IEEE international conference on cloud computing","first-page":"674","article-title":"Parallel K-means clustering based on mapreduce","author":"Zhao","year":"2009"},{"key":"10.1016\/j.ins.2022.11.139_b1210","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.neucom.2022.03.043","article-title":"Improving projected fuzzy K-means clustering via robust learning","volume":"491","author":"Zhao","year":"2022","journal-title":"Neurocomputing"},{"key":"10.1016\/j.ins.2022.11.139_b1215","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1016\/j.knosys.2018.09.013","article-title":"Automatic data clustering using nature-inspired symbiotic organism search algorithm","volume":"163","author":"Zhou","year":"2019","journal-title":"Knowl.-Based Syst."},{"issue":"12","key":"10.1016\/j.ins.2022.11.139_b1220","doi-asserted-by":"crossref","first-page":"392","DOI":"10.3390\/ijgi6120392","article-title":"An automatic K-means clustering algorithm of GPS data combining a novel niche genetic algorithm with noise and density","volume":"6","author":"Zhou","year":"2017","journal-title":"ISPRS Int. J. Geo Inf."},{"key":"10.1016\/j.ins.2022.11.139_b1225","article-title":"Improved logistic regression model for diabetes prediction by integrating PCA and K-means techniques","volume":"17","author":"Zhu","year":"2019","journal-title":"Inf. Med. Unlocked"},{"key":"10.1016\/j.ins.2022.11.139_b1230","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1016\/j.asoc.2018.07.026","article-title":"An effective partitional clustering algorithm based on new clustering validity index","volume":"71","author":"Zhu","year":"2018","journal-title":"Appl. Soft Comput."},{"issue":"6","key":"10.1016\/j.ins.2022.11.139_b1235","doi-asserted-by":"crossref","first-page":"2272","DOI":"10.1007\/s12083-020-00881-x","article-title":"Privacy-preserving K-means clustering with local synchronization in peer-to-peer networks","volume":"13","author":"Zhu","year":"2020","journal-title":"Peer-to-Peer Networking and Applications"},{"key":"10.1016\/j.ins.2022.11.139_b1240","doi-asserted-by":"crossref","unstructured":"Zhu, Z., & Liu, N. (2021). Early warning of financial risk based on K-means clustering algorithm. Complexity, 2021.","DOI":"10.1155\/2021\/5571683"},{"key":"10.1016\/j.ins.2022.11.139_b1245","doi-asserted-by":"crossref","unstructured":"Zhuang, Y., Mao, Y., & Chen, X. (2016). A limited-iteration bisecting K-means for fast clustering large datasets. In 2016 IEEE Trustcom \/BigDataSE \/ISPA, 2257-2262.","DOI":"10.1109\/TrustCom.2016.0348"},{"key":"10.1016\/j.ins.2022.11.139_b1250","article-title":"An improved K-means clustering algorithm towards an efficient data-drivenmModeling","volume":"2022","author":"Zubair","year":"2022","journal-title":"Annals of Data Science"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025522014633?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025522014633?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T05:58:16Z","timestamp":1758088696000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025522014633"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4]]},"references-count":250,"alternative-id":["S0020025522014633"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2022.11.139","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2023,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"K-means clustering algorithms: A comprehensive review, variants analysis, and advances in the era of big data","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2022.11.139","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}