{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T12:38:18Z","timestamp":1721047098966},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2022ZD0114803"],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key NSF of China","award":["62136005"]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61922087","62006238"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2023,9,1]]},"DOI":"10.1109\/tkde.2023.3242306","type":"journal-article","created":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T19:12:50Z","timestamp":1675710770000},"page":"9598-9612","source":"Crossref","is-referenced-by-count":1,"title":["Imbalanced Clustering With Theoretical Learning Bounds"],"prefix":"10.1109","volume":"35","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-5369-6801","authenticated-orcid":false,"given":"Jing","family":"Zhang","sequence":"first","affiliation":[{"name":"College of Liberal Arts and Sciences, National University of Defense Technology, Changsha, China"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-0924-5683","authenticated-orcid":false,"given":"Hong","family":"Tao","sequence":"additional","affiliation":[{"name":"College of Liberal Arts and Sciences, National University of Defense Technology, Changsha, China"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-9335-0469","authenticated-orcid":false,"given":"Chenping","family":"Hou","sequence":"additional","affiliation":[{"name":"College of Liberal Arts and Sciences, National University of Defense Technology, Changsha, China"}]}],"member":"263","reference":[{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/18.705560"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29807-3_2"},{"key":"ref34","first-page":"6142","article-title":"Refined learning bounds for kernel and approximate -means","volume":"34","author":"liu","year":"2021","journal-title":"Proc Adv Neural Informat Process Syst"},{"key":"ref12","first-page":"281","article-title":"Classification and analysis of multivariate observations","author":"macqueen","year":"1967","journal-title":"Proc 5th Berkeley Symp Math Statist Probability"},{"key":"ref37","first-page":"5915","article-title":"On the price of explainability for some clustering problems","author":"laber","year":"2021","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2430821"},{"key":"ref36","first-page":"2891","article-title":"Robust k-means: A theoretical revisit","volume":"29","author":"georgogiannis","year":"2016","journal-title":"Proc Adv Neural Informat Process Syst"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2011.2182354"},{"key":"ref31","first-page":"37","article-title":"A density-based k-means++ algorithm for imbalanced datasets clustering","author":"fan","year":"2019","journal-title":"Proc Chin Intell Syst Conf"},{"key":"ref30","first-page":"1027","article-title":"k-means++: The advantages of careful seeding","author":"arthur","year":"2007","journal-title":"Proc 18th Ann ACM-SIAM Symp Discrete Algorithms"},{"key":"ref33","first-page":"9379","article-title":"Statistical and computational trade-offs in kernel k-means","volume":"31","author":"calandriello","year":"2018","journal-title":"Proc Adv Neural Informat Process Syst"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1186\/s40537-019-0192-5"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.913516"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s13748-016-0094-0"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-018-3633-8"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.239"},{"key":"ref39","article-title":"vector contraction for rademacher complexity","author":"foster","year":"2019"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","article-title":"Normalized cuts and image segmentation","volume":"22","author":"shi","year":"2000","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"ref38","first-page":"6392","article-title":"Sharper generalization bounds for clustering","author":"li","year":"2021","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2916196"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-010-0002-8"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.262"},{"key":"ref24","first-page":"121","article-title":"Enhancing k-means clustering algorithm with improved initial center","volume":"1","author":"yedla","year":"2010","journal-title":"Int J Comput Sci Inf Technol"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2893916"},{"key":"ref23","first-page":"7965","article-title":"Label consistency in overfitted generalized -means","volume":"34","author":"zhang","year":"2021","journal-title":"Proc Adv Neural Informat Process Syst"},{"key":"ref26","first-page":"456","article-title":"Fast noise removal for k-means clustering","author":"im","year":"2020","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2011.07.011"},{"key":"ref42","first-page":"407","article-title":"Proceedings of the fifth berkeley symposium on mathematical statistics and probability","volume":"21","author":"kojima","year":"1969","journal-title":"Amer J Hum Genet"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s40745-015-0040-1"},{"key":"ref41","article-title":"Learning imbalanced datasets with label-distribution-aware margin loss","volume":"32","author":"cao","year":"2019","journal-title":"Proc Adv Neural Informat Process Syst"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2008.2004559"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2017.09.025"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/243"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2014.01.015"},{"key":"ref28","first-page":"41","article-title":"A new method for dimensionality reduction using k-means clustering algorithm for high dimensional data set","volume":"13","author":"napoleon","year":"2011","journal-title":"Int J Comput Appl"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.1048"},{"key":"ref29","first-page":"478","article-title":"Unsupervised deep embedding for clustering analysis","author":"xie","year":"2016","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.174"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1126\/science.1242072"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.211"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.11.004"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-019-04089-w"},{"key":"ref6","first-page":"1","article-title":"Sequence clustering in bioinformatics: An empirical study","volume":"21","author":"zou","year":"2020","journal-title":"Brief Bioinf"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.68"},{"key":"ref40","first-page":"463","article-title":"Rademacher and Gaussian complexities: Risk bounds and structural results","volume":"3","author":"bartlett","year":"2002","journal-title":"J Mach Learn Res"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/10210449\/10037215.pdf?arnumber=10037215","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T18:09:42Z","timestamp":1693246182000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10037215\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,1]]},"references-count":45,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2023.3242306","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,1]]}}}