{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:21:56Z","timestamp":1740169316238,"version":"3.37.3"},"reference-count":56,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea (NRF) grants","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"Korean Government [Ministry of Science and Information and communications Technology (MSIT)]","doi-asserted-by":"publisher","award":["2022R1A2C1091319","RS-2023-00242528","2021R1F1A1052846"],"award-info":[{"award-number":["2022R1A2C1091319","RS-2023-00242528","2021R1F1A1052846"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/access.2023.3306023","type":"journal-article","created":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T17:32:21Z","timestamp":1692293541000},"page":"88135-88151","source":"Crossref","is-referenced-by-count":1,"title":["Robust Model Design by Comparative Evaluation of Clustering Algorithms"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5412-8876","authenticated-orcid":false,"given":"Xiaopeng","family":"Chen","sequence":"first","affiliation":[{"name":"Department of Industrial Engineering, Pusan National University, Busan, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2208-3498","authenticated-orcid":false,"given":"Chanseok","family":"Park","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering, Pusan National University, Busan, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3840-0275","authenticated-orcid":false,"given":"Xuehong","family":"Gao","sequence":"additional","affiliation":[{"name":"Department of Safety Engineering, University of Science and Technology Beijing, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2889-2875","authenticated-orcid":false,"given":"Bosung","family":"Kim","sequence":"additional","affiliation":[{"name":"School of Management, Kyung Hee University, Seoul, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.2307\/2670010"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1007\/BF00300543"},{"doi-asserted-by":"publisher","key":"ref56","DOI":"10.1109\/TCST.2008.922566"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1016\/j.patcog.2021.107996"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/RoboMech.2017.8261116"},{"doi-asserted-by":"publisher","key":"ref53","DOI":"10.1007\/978-3-642-04898-2_126"},{"key":"ref52","volume":"6","author":"johnson","year":"2014","journal-title":"Applied multivariate statistical analysis"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/TSG.2022.3176311"},{"key":"ref55","first-page":"477","article-title":"The compact genetic algorithm is efficient under extreme Gaussian noise","volume":"21","author":"friedrich","year":"2017","journal-title":"IEEE Trans Evol Comput"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1016\/j.cie.2015.11.016"},{"doi-asserted-by":"publisher","key":"ref54","DOI":"10.1109\/34.908974"},{"key":"ref17","first-page":"2224","article-title":"Robust and sparse fuzzy K-Means clustering","author":"xu","year":"2016","journal-title":"Proc IJCAI"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/TFUZZ.2009.2036603"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1117\/12.2524251"},{"key":"ref18","first-page":"1","article-title":"Clustering via concave minimization","volume":"9","author":"bradley","year":"1996","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref51","first-page":"163","article-title":"Efficiency in normal samples and tolerance of extreme values for some estimates of location","volume":"1","author":"hodges","year":"1967","journal-title":"Proc 5th Berkeley Symp Math Statist Probab"},{"doi-asserted-by":"publisher","key":"ref50","DOI":"10.1214\/aos\/1176346396"},{"doi-asserted-by":"publisher","key":"ref46","DOI":"10.1007\/978-1-4614-1412-4_25"},{"doi-asserted-by":"publisher","key":"ref45","DOI":"10.1137\/0916069"},{"year":"1968","author":"hampel","journal-title":"Contributions to the theory of robust estimation","key":"ref48"},{"doi-asserted-by":"publisher","key":"ref47","DOI":"10.1080\/03610918.2019.1699114"},{"doi-asserted-by":"publisher","key":"ref42","DOI":"10.1090\/S0025-5718-1970-0274029-X"},{"doi-asserted-by":"publisher","key":"ref41","DOI":"10.1016\/S0377-0427(00)00435-0"},{"doi-asserted-by":"publisher","key":"ref44","DOI":"10.1007\/BF01589116"},{"doi-asserted-by":"publisher","key":"ref43","DOI":"10.1093\/comjnl\/13.3.317"},{"key":"ref49","article-title":"The notion of breakdown point","author":"donoho","year":"1983","journal-title":"A Festschrift for Erich L Lehmann"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/42.974917"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1016\/j.eij.2015.01.003"},{"key":"ref9","first-page":"805","article-title":"Review and comparative study of clustering techniques","volume":"5","author":"popat","year":"2014","journal-title":"Int J Comput Sci Inf Technol"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1108\/IJBM-03-2016-0037"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/TASE.2020.3029028"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1007\/978-3-319-77932-4_37"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1093\/forestscience\/49.4.555","article-title":"Clustering and compactness in reserve site selection: An extension of the biodiversity management area selection model","volume":"49","author":"fischer","year":"2003","journal-title":"Forest Sci"},{"doi-asserted-by":"publisher","key":"ref40","DOI":"10.1007\/BF01581275"},{"key":"ref35","volume":"160","author":"rychlik","year":"2012","journal-title":"Projecting Statistical Functionals"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1007\/978-0-387-21736-9"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1007\/s101820400169"},{"key":"ref36","article-title":"Quantiles equivariance","author":"hosseini","year":"2010","journal-title":"arXiv 1004 0533"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1109\/3477.623240"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1145\/312129.312248"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1137\/1.9781611970289"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1080\/14786448808628170"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/ROPEC.2017.8261617"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1109\/ISGTLatinAmerica52371.2021.9543024"},{"doi-asserted-by":"publisher","key":"ref39","DOI":"10.1111\/j.1467-9787.1973.tb00376.x"},{"doi-asserted-by":"publisher","key":"ref38","DOI":"10.1080\/03610920903551807"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1016\/j.aap.2008.12.014"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1016\/j.aquaeng.2020.102122"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"2145","DOI":"10.1109\/TCE.2009.5373781","article-title":"Adaptive fuzzy moving k-means clustering algorithm for image segmentation","volume":"55","author":"isa","year":"2009","journal-title":"IEEE Trans Consum Electron"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1109\/TPWRD.2011.2162858"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.23919\/OCEANS40490.2019.8962401"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1016\/j.ejor.2018.07.036"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1145\/3313276.3316350"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1109\/TPAMI.2005.95"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1109\/TPAMI.1984.4767478"},{"key":"ref29","first-page":"1","article-title":"K-means++: The advantages of careful seeding","author":"arthur","year":"2007","journal-title":"Proc 18th Annu ACM-SIAM Symp Discrete Algorithms"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10005208\/10223212.pdf?arnumber=10223212","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,26]],"date-time":"2024-10-26T09:04:48Z","timestamp":1729933488000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10223212\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":56,"URL":"https:\/\/doi.org\/10.1109\/access.2023.3306023","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2023]]}}}