{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T15:57:21Z","timestamp":1781193441366,"version":"3.54.1"},"reference-count":70,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T00:00:00Z","timestamp":1685577600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Emerg. Top. Comput. Intell."],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1109\/tetci.2022.3211004","type":"journal-article","created":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T20:10:48Z","timestamp":1665432648000},"page":"942-956","source":"Crossref","is-referenced-by-count":7,"title":["Centroid Based Celestial Clustering Algorithm: A Novel Unsupervised Learning Method for Haemogram Data Clustering"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3783-0599","authenticated-orcid":false,"given":"Shibu Kumar","family":"K. B.","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, College of Engineering Trivandrum, Kerala, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philip","family":"Samuel","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Cochin University of Science and Technology, Kerala, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.jhydrol.2017.03.060"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2004.1334558"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1088\/1757-899X\/336\/1\/012017"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1999.754967"},{"key":"ref15","article-title":"Text documents clustering using K-means algorithm","author":"kunwar","year":"2013"},{"key":"ref59","first-page":"75","article-title":"Clustering with som: U*c","author":"ultsch","year":"0","journal-title":"Proc Workshop Self-Organizing Maps"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1007\/1\/012049"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/11499145_99"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90224-5"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2004.04.007"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICSAI48974.2019.9010223"},{"key":"ref55","first-page":"4405","article-title":"Time complexity of K-means and k-medians clustering algorithms in outliers detection","volume":"12","author":"dalatu","year":"2016","journal-title":"Global Journal of Pure and Applied Mathematics"},{"key":"ref10","first-page":"226","article-title":"A density-based algorithm for discovering clusters a density-based algorithm for discovering clusters in large spatial databases with noise","author":"ester","year":"0","journal-title":"Proc Int Conf Knowl Disc Data Mining"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/97.329844"},{"key":"ref17","first-page":"206","article-title":"Crime prediction using K-means algorithm","volume":"2","author":"jain","year":"2017","journal-title":"GRD J -Global Res Develop J Eng"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.3926\/jiem.1929"},{"key":"ref19","first-page":"201","article-title":"Online gamers classification using k-means","author":"fernando","year":"0","journal-title":"Proc Intell Distrib Comput VIII"},{"key":"ref18","first-page":"1112","article-title":"Prepaid telecom customer segmentation using the k-mean algorithm","volume":"21","author":"bacila","year":"2012","journal-title":"Ann Univ Oradea Econ Sci Ser"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/ICSESS.2015.7339213"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/BDCloud-SocialCom-SustainCom.2016.46"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2922266"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/COMITCon.2019.8862255"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45133-4_16"},{"key":"ref47","first-page":"1321","article-title":"General framework of artificial physics optimization algorithm","author":"xie","year":"0","journal-title":"Proc World Congr Nature Biologically Inspired Comput"},{"key":"ref42","first-page":"1","article-title":"A brief review of nature-inspired algorithms for optimization","volume":"80","author":"jr","year":"2013","journal-title":"Elektrotehniski Vestnik"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ICDIM.2010.5664638"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2018.2869001"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s12559-015-9370-8"},{"key":"ref49","first-page":"23","article-title":"A genetic algorithm for optimized initial centres K-means clustering in SMES","volume":"90","author":"khotimah","year":"2016","journal-title":"J Theor Appl Inf Technol"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2006.69"},{"key":"ref9","first-page":"2273","article-title":"Generalized gaussian mixture model","author":"mohamed","year":"0","journal-title":"Proc IEEE 17th Eur Signal Process Conf"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/GrC.2012.6468691"},{"key":"ref3","first-page":"190","article-title":"A comparative study on change of scale of online population, mobile internet users and social media users in India","author":"rajani","year":"0","journal-title":"Proc Int Conf Res Entrepreneurship"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCAS.2006.284911"},{"key":"ref5","first-page":"410","article-title":"Clustering techniques in data mining: A comparison","author":"gulati","year":"0","journal-title":"Proc IEEE 2nd Int Conf Comput Sustain Glob Develop"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1155\/2022\/2826127"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.5120\/8298-1917"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2015.03.185"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/CIT.2016.111"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICITECH.2017.8079917"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICIIP47207.2019.8985743"},{"key":"ref30","first-page":"768","article-title":"Cluster analysis of multivariate data: Efficiency vs. interpretability of classification","volume":"21","author":"forgy","year":"1965","journal-title":"Biometrics"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.17485\/ijst\/2015\/v8i17\/52123"},{"key":"ref32","first-page":"1027","article-title":"k-means++: The advantages of careful seeding","author":"arthur","year":"0","journal-title":"Proc 18th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.2471\/BLT.07.046474"},{"key":"ref1","first-page":"783","article-title":"Automated knowledge acquisition from clinical narrative reports","author":"wang","year":"0","journal-title":"Proc AMIA Annu Symp"},{"key":"ref39","first-page":"121","article-title":"Prediction and diagnosis of leukemia using classification algorithmsmining complete blood count reports for disease discovery","volume":"18","author":"jatoi","year":"2018","journal-title":"Int J Comput Sci Netw Secur"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICITECH.2017.8079919"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1080\/01969727308546046"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICECDS.2017.8389496"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2005.845141"},{"key":"ref23","article-title":"Using data science techniques for the automatic clustering of it alerts","author":"lin","year":"2014"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/ICCSA.2019.000-1"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2904887"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICCSN.2011.6014384"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.2307\/2284239"},{"key":"ref20","first-page":"3764","article-title":"Fraud detection in automobile insurance using a data mining based approach","volume":"8","author":"ghorbani","year":"2018","journal-title":"Int Journal of Mechatronics Electrical and Computer Technology"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/COMITCon.2019.8862199"},{"key":"ref63","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316801","author":"kaufman","year":"1990","journal-title":"Partitioning Around Medoids (Program PAM) Ser Wiley Series in Probability and Statistics"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.14569\/IJACSA.2016.070759"},{"key":"ref66","first-page":"537","article-title":"A study of hierarchical clustering algorithms","author":"patel","year":"0","journal-title":"Proc IEEE 2nd Int Conf Comput Sustain Glob Develop"},{"key":"ref21","article-title":"End to end application for monitoring real-time uber data using apache apis: Kafka, spark, hbase – Part 1: Spark machine learning","author":"mcdonald","year":"2016"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.11591\/ijece.v9i4.pp2760-2770"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/IGARSS.2017.8128067"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2008.4634069"},{"key":"ref29","first-page":"790","article-title":"K-means clustering algorithm with improved initial center","author":"chen","year":"0","journal-title":"Proc Int Workshop Knowl Discov and Data Mining"},{"key":"ref60","article-title":"UCI machine learning repository","year":"2017"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/ISEMANTIC.2018.8549751"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/DSAA49011.2020.00096"}],"container-title":["IEEE Transactions on Emerging Topics in Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7433297\/10132901\/09915487.pdf?arnumber=9915487","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,19]],"date-time":"2023-06-19T18:23:35Z","timestamp":1687199015000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9915487\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6]]},"references-count":70,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tetci.2022.3211004","relation":{},"ISSN":["2471-285X"],"issn-type":[{"value":"2471-285X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6]]}}}