{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:56:18Z","timestamp":1773377778236,"version":"3.50.1"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"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":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9517966","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"2042-2047","source":"Crossref","is-referenced-by-count":0,"title":["Greedy $k$-Center from Noisy Distance Samples"],"prefix":"10.1109","author":[{"given":"Neharika","family":"Jali","sequence":"first","affiliation":[{"name":"Indian Institute of Technology,Department of Electrical Engineering,Bombay"}]},{"given":"Nikhil","family":"Karamchandani","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology,Department of Electrical Engineering,Bombay"}]},{"given":"Sharayu","family":"Moharir","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology,Department of Electrical Engineering,Bombay"}]}],"member":"263","reference":[{"key":"ref10","first-page":"250","article-title":"Approximate clustering via core-sets","author":"bundefineddoiu","year":"0","journal-title":"proceedings of the 34th annual ACM symposium on theory of computing"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2462356.2462401"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2016.61"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90224-5"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62255"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/5925.5933"},{"key":"ref16","first-page":"500","article-title":"Medoids in almost-linear time via multi-armed bandits","volume":"84","author":"bagaria","year":"0","journal-title":"Proceedings of the 21st International Conference on Artificial Intelligence and Statistics"},{"key":"ref17","first-page":"3655","article-title":"Ultra fast medoid identification via correlated sequential halving","author":"baharav","year":"0","journal-title":"Advances in Neural IInformation Processing Systems"},{"key":"ref18","article-title":"Bandit-pam: Almost linear time k-medoids clustering via multi-armed bandits","author":"tiwari","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1561\/2200000070"},{"key":"ref4","first-page":"9586","article-title":"Learning nearest neighbor graphs from noisy distance samples","author":"mason","year":"0","journal-title":"Advances in Neural IInformation Processing Systems"},{"key":"ref27","first-page":"1824","article-title":"Sample complexity of partition identification using multi-armed bandits","author":"juneja","year":"0","journal-title":"Proceedings of the 32nd Annual Conference on Learning Theory"},{"key":"ref3","first-page":"3099","article-title":"Adaptive estimation for approximate k-nearest-neighbor computations","volume":"89","author":"lejeune","year":"0","journal-title":"Machine Learning Research"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.32"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2019.1911"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-015-0816-y"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48224-5_21"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.594"},{"key":"ref2","article-title":"Adaptive monte-carlo optimization","author":"bagaria","year":"2018","journal-title":"ArXiv Preprint"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0110-y"},{"key":"ref1","author":"kleinberg","year":"2005","journal-title":"Algorithm Design"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2014.6814096"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref21","article-title":"Greedy k-center from noisy distance samples","author":"jali","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref24","first-page":"1","article-title":"On the complexity of best-arm identification in multi-armed bandit models","volume":"17","author":"kaufmann","year":"2016","journal-title":"Journal of Machine Learning Research"},{"key":"ref23","first-page":"423","article-title":"lil'ucb: An optimal exploration algorithm for multi-armed bandits","author":"jamieson","year":"0","journal-title":"Proceedings of the 27th Annual Conference on Learning Theory"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.29007\/zsvw"},{"key":"ref25","article-title":"Chemical gas sensor drift compensation using classifier ensembles, sensors and actuators b","author":"vergara","year":"2012","journal-title":"Chemistry"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09517966.pdf?arnumber=9517966","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:08Z","timestamp":1773347708000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517966\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517966","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}