{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T20:52:49Z","timestamp":1767991969963,"version":"3.49.0"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020,1]]},"DOI":"10.1109\/imcom48794.2020.9001738","type":"proceedings-article","created":{"date-parts":[[2020,2,21]],"date-time":"2020-02-21T08:20:31Z","timestamp":1582273231000},"page":"1-6","source":"Crossref","is-referenced-by-count":8,"title":["A Farthest First Traversal based Sampling Algorithm for k-clustering"],"prefix":"10.1109","author":[{"given":"Le Hong","family":"Trang","sequence":"first","affiliation":[]},{"given":"Nguyen","family":"Le Hoang","sequence":"additional","affiliation":[]},{"given":"Tran Khanh","family":"Dang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1155\/2019\/8123259"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.03.008"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-0946-8"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2018.03.052"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/978-3-030-03192-3_11","article-title":"A sample-based algorithm for visual assessment of cluster tendency (VAT) with large datasets","author":"trang","year":"2018","journal-title":"the Proceedings of the 5th International Conference on Future Data and Security Engineering (FDSE 2018) LNCS 11251"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.5220\/0007958803570363"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/177424.178042"},{"key":"ref18","first-page":"50","article-title":"Approx- imation schemes for clustering problems","author":"vega","year":"2003","journal-title":"Proceedings of the 35th Annual ACM Symposium on Theory of Computing"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s004540010019"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1064092.1064114"},{"key":"ref3","article-title":"Geometric approximation algorithms","volume":"173","author":"har-peled","year":"2011","journal-title":"Amer Math Soc Providence RI"},{"key":"ref6","first-page":"45","article-title":"A Comparative Study of the Use of Coresets for Clustering Large Datasets","author":"hoang","year":"2019","journal-title":"In the Proceedings of the 6th International Conference on Future Data and Security Engineering (FDSE 2019) LNCS 11814"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007400"},{"key":"ref8","first-page":"1119","article-title":"Scalable and distributed clustering via lightweight Coresets","author":"bachem","year":"2018","journal-title":"Proceedings of the International Conference on Knowledge Discovery and Data Mining (KDD)"},{"key":"ref7","first-page":"2142","article-title":"Scalable training of mixture models via coresets","author":"feldman","year":"2011","journal-title":"Advances in Neural Information Processing Systems (NIPS)"},{"key":"ref2","first-page":"1","article-title":"Geometric approximation via coresets","volume":"52","author":"agarwal","year":"2005","journal-title":"Combinatorial and Computational Geometry"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s42979-019-0007-y"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1008731.1008736"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/290179.290180"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/0206041"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780548"},{"key":"ref24","first-page":"1027","article-title":"k-means++: The advantages of careful seeding","author":"arthur","year":"2007","journal-title":"Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90224-5"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/BF01908075"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.2307\/2284239"}],"event":{"name":"2020 14th International Conference on Ubiquitous Information Management and Communication (IMCOM)","location":"Taichung, Taiwan","start":{"date-parts":[[2020,1,3]]},"end":{"date-parts":[[2020,1,5]]}},"container-title":["2020 14th International Conference on Ubiquitous Information Management and Communication (IMCOM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8977604\/9001671\/09001738.pdf?arnumber=9001738","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T21:57:58Z","timestamp":1656453478000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9001738\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/imcom48794.2020.9001738","relation":{},"subject":[],"published":{"date-parts":[[2020,1]]}}}