{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T05:57:38Z","timestamp":1783749458458,"version":"3.55.0"},"reference-count":65,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"publisher","award":["62022039"],"award-info":[{"award-number":["62022039"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"publisher","award":["62276124"],"award-info":[{"award-number":["62276124"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1109\/tevc.2023.3296645","type":"journal-article","created":{"date-parts":[[2023,7,18]],"date-time":"2023-07-18T17:38:40Z","timestamp":1689701920000},"page":"1220-1234","source":"Crossref","is-referenced-by-count":8,"title":["Can Evolutionary Clustering Have Theoretical Guarantees?"],"prefix":"10.1109","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6011-2512","authenticated-orcid":false,"given":"Chao","family":"Qian","sequence":"first","affiliation":[{"name":"State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/18m1171321"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/s0097539702416402"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-28349-8_2"},{"key":"ref4","first-page":"11146","article-title":"Greedy sampling for approximate clustering in the presence of outliers","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Bhaskara"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/195"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-14721-0_30"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-020-3114-y"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/612"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2981561"},{"key":"ref10","first-page":"5029","article-title":"Fair clustering through fairlets","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Chierichetti"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i14.17457"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2463372.2463565"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2013.6557601"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071301"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1023\/B:MACH.0000033113.59016.96"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1998.6.2.185"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00003"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3512290.3528713"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00159"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2726341"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2260862"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90224-5"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0993"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.14778\/3067421.3067425"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/4235.771164"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2006.877146"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1090\/surv\/173"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007400"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2018.2884521"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/232"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/331499.331504"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29414-4_5"},{"key":"ref33","article-title":"A center in your neighborhood: Fairness in facility location","author":"Jung","year":"2019","journal-title":"arXiv:1908.09041"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2004.03.003"},{"key":"ref35","volume-title":"Finding Groups in Data: An Introduction to Cluster Analysis","author":"Kaufman","year":"2009"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2001576.2001642"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44719-9_19"},{"key":"ref38","first-page":"3662","article-title":"A better k-means++ algorithm via local search","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"Lattanzi"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2004.823470"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/2725494.2725506"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2015.2501315"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2018.2878536"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"ref44","article-title":"Analysis of expected hitting time for designing evolutionary neural architecture search algorithms","author":"Lv","year":"2022","journal-title":"arXiv:2210.05397"},{"key":"ref45","first-page":"6586","article-title":"Individual fairness for k-clustering","volume-title":"Proc. 37th Int. Conf. Mach. Learn.","author":"Mahabadi"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/s004540010019"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/2742642"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-006-9004-x"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-009-9370-8"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.06.009"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.03.003"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-45823-6_78"},{"key":"ref53","first-page":"389","article-title":"On constrained boolean Pareto optimization","volume-title":"Proc. 24th Int. Joint Conf. Artif. Intell.","author":"Qian"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103737"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2019.06.005"},{"key":"ref56","first-page":"2902","article-title":"Large-scale evolution of image classifiers","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","author":"Real"},{"key":"ref57","article-title":"Deep neuroevolution: Genetic algorithms are a competitive alternative for training deep neural networks for reinforcement learning","author":"Such","year":"2017","journal-title":"arXiv:1712.06567"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2018.2828643"},{"key":"ref59","first-page":"8758","article-title":"Improved approximation algorithms for individually fair clustering","volume-title":"Proc. 25th Int. Conf. Artif. Intell. Stat.","author":"Vakilian"},{"key":"ref60","first-page":"1027","article-title":"k-means++: The advantages of careful seeding","volume-title":"Proc. 18th Annu. ACM-SIAM Symp. Discr. Algorithms","author":"Vassilvitskii"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/628"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-007-0114-2"},{"key":"ref63","article-title":"Reducing idleness in financial cloud via multi-objective evolutionary reinforcement learning based load balancer","author":"Yang","year":"2023","journal-title":"arXiv:2305.03463"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i9.21283"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-13-5956-9"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4235\/10703195\/10185945.pdf?arnumber=10185945","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,3]],"date-time":"2024-10-03T06:08:51Z","timestamp":1727935731000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10185945\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10]]},"references-count":65,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2023.3296645","relation":{},"ISSN":["1089-778X","1089-778X","1941-0026"],"issn-type":[{"value":"1089-778X","type":"print"},{"value":"1089-778X","type":"print"},{"value":"1941-0026","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10]]}}}