{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T08:40:21Z","timestamp":1737103221972,"version":"3.33.0"},"reference-count":16,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,12,15]],"date-time":"2024-12-15T00:00:00Z","timestamp":1734220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,12,15]],"date-time":"2024-12-15T00:00:00Z","timestamp":1734220800000},"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":[],"published-print":{"date-parts":[[2024,12,15]]},"DOI":"10.1109\/bigdata62323.2024.10825777","type":"proceedings-article","created":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T18:31:23Z","timestamp":1737052283000},"page":"8658-8660","source":"Crossref","is-referenced-by-count":0,"title":["Introducing the Converse k-clustering Problem"],"prefix":"10.1109","author":[{"given":"Byron J.","family":"Gao","sequence":"first","affiliation":[{"name":"Texas State University,Department of Computer Science,San Marcos,USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2019.01.002"},{"key":"ref2","article-title":"Approximation algorithms for geometric problems","volume-title":"Approximation algorithms for NP-hard problems.","author":"Bern","year":"1997"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/359094.359101"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-9076-0_10"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009638304510"},{"article-title":"A density-based algorithm for discovering clusters in large spatial databases with noise","volume-title":"Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD-96)","author":"Ester","key":"ref6"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.260"},{"volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness.","year":"1979","author":"Garey","key":"ref8"},{"key":"ref9","article-title":"Various notions of approximations: Good, better, best, and more","volume-title":"Approximation algorithms for NP-hard problems.","author":"Hochbaum","year":"1997"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1287\/opre.37.6.865"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(83)90181-9"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(81)90081-5"},{"article-title":"X-means: Extending k-means with efficient estimation of the number of clusters","volume-title":"Proceedings of the 17th International Conference of Machine Learning (ICML)","author":"Pelleg","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2021.04.015"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1287\/opre.19.6.1363"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/9781119005353.ch13"}],"event":{"name":"2024 IEEE International Conference on Big Data (BigData)","start":{"date-parts":[[2024,12,15]]},"location":"Washington, DC, USA","end":{"date-parts":[[2024,12,18]]}},"container-title":["2024 IEEE International Conference on Big Data (BigData)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10824975\/10824942\/10825777.pdf?arnumber=10825777","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T08:05:14Z","timestamp":1737101114000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10825777\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,15]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/bigdata62323.2024.10825777","relation":{},"subject":[],"published":{"date-parts":[[2024,12,15]]}}}