{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T11:25:58Z","timestamp":1762341958557},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T00:00:00Z","timestamp":1669766400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T00:00:00Z","timestamp":1669766400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s11390-022-2429-6","type":"journal-article","created":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T05:02:56Z","timestamp":1672290176000},"page":"1398-1411","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Minimum Epsilon-Kernel Computation for Large-Scale Data Processing"],"prefix":"10.1007","volume":"37","author":[{"given":"Hong-Jie","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian-Zhong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,30]]},"reference":[{"issue":"4","key":"2429_CR1","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1145\/1008731.1008736","volume":"51","author":"PK Agarwal","year":"2004","unstructured":"Agarwal P K, Har-Peled S, Varadarajan K R. Approximating extent measures of points. Journal of the ACM, 2004, 51(4): 606-635. https:\/\/doi.org\/10.1145\/1008731.1008736.","journal-title":"Journal of the ACM"},{"key":"2429_CR2","doi-asserted-by":"publisher","unstructured":"Wang Y, Li Y, Tan K L. Coresets for minimum enclosing balls over sliding windows. In Proc. the 25th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Aug. 2019, pp.314-323. https:\/\/doi.org\/10.1145\/3292500.3330826.","DOI":"10.1145\/3292500.3330826"},{"key":"2429_CR3","doi-asserted-by":"publisher","unstructured":"Bachem O, Lucic M, Krause A. Scalable k-means clustering via lightweight coresets. In Proc. the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Aug. 2018, pp.1119-1127. https:\/\/doi.org\/10.1145\/3219819.3219973.","DOI":"10.1145\/3219819.3219973"},{"key":"2429_CR4","doi-asserted-by":"publisher","unstructured":"Har-Peled S, Mazumdar S. On coresets for k-means and k-median clustering. In Proc. the 36th Annual ACM Symposium on Theory of Computing, Jun. 2004, pp.291-300. https:\/\/doi.org\/10.1145\/1007352.1007400.","DOI":"10.1145\/1007352.1007400"},{"key":"2429_CR5","doi-asserted-by":"publisher","unstructured":"Yu A, Agarwal P K, Yang J. Processing a large number of continuous preference top-k queries. In Proc. the 2012 ACM SIGMOD International Conference on Management of Data, May 2012, pp.397-408. https:\/\/doi.org\/10.1145\/2213836.2213882.","DOI":"10.1145\/2213836.2213882"},{"key":"2429_CR6","doi-asserted-by":"publisher","unstructured":"Wang Y, Mathioudakis M, Li Y, Tan K L. Minimum coresets for maxima representation of multidimensional data. In Proc. the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, Jun. 2021, pp.138-152. https:\/\/doi.org\/10.1145\/3452021.3458322.","DOI":"10.1145\/3452021.3458322"},{"key":"2429_CR7","unstructured":"Agarwal P K, Har-Peled S, Varadarajan K R. Geometric approximation via coresets. In Combinatorial and Computational Geometry, 2005, 52. http:\/\/library.msri.org\/books\/Book52\/files\/01agar.pdf, Oct. 2022."},{"issue":"3","key":"2429_CR8","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/s00453-007-9067-9","volume":"52","author":"H Yu","year":"2008","unstructured":"Yu H, Agarwal P K, Poreddy R, Varadarajan K R. Practical methods for shape fitting and kinetic data structures using coresets. Algorithmica, 2008, 52(3): 378-402. https:\/\/doi.org\/10.1007\/s00453-007-9067-9.","journal-title":"Algorithmica"},{"issue":"1","key":"2429_CR9","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10115-008-0157-z","volume":"20","author":"G Luo","year":"2009","unstructured":"Luo G, Wu K L, Yu P S. Answering linear optimization queries with an approximate stream index. Knowledge and Information Systems, 2009, 20(1): 95-121. https:\/\/doi.org\/10.1007\/s10115-008-0157-z.","journal-title":"Knowledge and Information Systems"},{"key":"2429_CR10","doi-asserted-by":"publisher","unstructured":"Agarwal P K, Kumar N, Sintos S, Suri S. Efficient algorithms for k-regret minimizing sets. In Proc. the 16th International Symposium on Experimental Algorithms, Jun. 2017, Article No. 7. https:\/\/doi.org\/10.4230\/LIPIcs.SEA.2017.7.","DOI":"10.4230\/LIPIcs.SEA.2017.7"},{"key":"2429_CR11","doi-asserted-by":"publisher","unstructured":"Xie M, Wong R C W, Li J, Long C, Lall A. Efficient k-regret query algorithm with restriction-free bound for any dimensionality. In Proc. the 2018 International Conference on Management of Data, Jun. 2018, pp.959-974. https:\/\/doi.org\/10.1145\/3183713.3196903.","DOI":"10.1145\/3183713.3196903"},{"key":"2429_CR12","doi-asserted-by":"publisher","unstructured":"Zheng J, Wang Y, Wang X, Ma W. Continuous k-regret minimization queries: A dynamic coreset approach. IEEE Transactions on Knowledge and Data Engineering. https:\/\/doi.org\/10.1109\/TKDE.2022.3166835.","DOI":"10.1109\/TKDE.2022.3166835"},{"issue":"1\/2","key":"2429_CR13","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.comgeo.2005.10.002","volume":"35","author":"TM Chan","year":"2006","unstructured":"Chan T M. Faster core-set constructions and data-stream algorithms in fixed dimensions. Computational Geometry, 2006, 35(1\/2): 20-35. https:\/\/doi.org\/10.1016\/j.comgeo.2005.10.002.","journal-title":"Computational Geometry"},{"key":"2429_CR14","doi-asserted-by":"publisher","unstructured":"Arya S, Chan T M. Better \u03b5-dependencies for offline approximate nearest neighbor search, Euclidean minimum spanning trees, and \u03b5-kernels. In Proc. the 30th Annual Symposium on Computational Geometry, Jun. 2014, pp.416-425. https:\/\/doi.org\/10.1145\/2582112.2582161.","DOI":"10.1145\/2582112.2582161"},{"key":"2429_CR15","doi-asserted-by":"publisher","unstructured":"Arya S, Da Fonseca G D, Mount D M. Near-optimal \u03b5-Kernel construction and related problems. In Proc. the 33rd International Symposium on Computational Geometry, Jul. 2017, Article No. 10. https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2017.10.","DOI":"10.4230\/LIPIcs.SoCG.2017.10"},{"issue":"2","key":"2429_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.20382\/jocg.v9i2a2","volume":"9","author":"TM Chan","year":"2018","unstructured":"Chan T M. Applications of Chebyshev polynomials to low-dimensional computational geometry. Journal of Computational Geometry, 2018, 9(2): 3-20. https:\/\/doi.org\/10.20382\/jocg.v9i2a2.","journal-title":"Journal of Computational Geometry"},{"issue":"3","key":"2429_CR17","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s00454-009-9165-3","volume":"42","author":"TM Chan","year":"2009","unstructured":"Chan T M. Dynamic coresets. Discrete and Computational Geometry, 2009, 42(3): 469-488. https:\/\/doi.org\/10.1007\/s00454-009-9165-3.","journal-title":"Discrete and Computational Geometry"},{"key":"2429_CR18","doi-asserted-by":"publisher","unstructured":"Andoni A, Nguyen H L. Width of points in the streaming model. In Proc. the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, Jan. 2012, pp.447-452. https:\/\/doi.org\/10.1137\/1.9781611973099.38.","DOI":"10.1137\/1.9781611973099.38"},{"key":"2429_CR19","doi-asserted-by":"publisher","unstructured":"Chan T M. Dynamic streaming algorithms for \u03b5-kernels. In Proc. the 32nd International Symposium on Computational Geometry, Jun. 2016, Article No. 27. https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2016.27.","DOI":"10.4230\/LIPIcs.SoCG.2016.27"},{"issue":"4","key":"2429_CR20","doi-asserted-by":"publisher","first-page":"2443","DOI":"10.1007\/s10878-021-00760-y","volume":"44","author":"H Guo","year":"2022","unstructured":"Guo H, Li J, Gao H. Data source selection for approximate query. Journal of Combinatorial Optimization, 2022, 44(4): 2443-2459. https:\/\/doi.org\/10.1007\/s10878-021-00760-y.","journal-title":"Journal of Combinatorial Optimization"},{"key":"2429_CR21","doi-asserted-by":"crossref","unstructured":"Suh N P. Complexity: Theory and Applications (1st edition). Oxford University Press, 2005.","DOI":"10.1093\/oso\/9780195178760.001.0001"},{"issue":"9","key":"2429_CR22","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley J L. Multidimensional binary search trees used for associative searching. Communications of the ACM, 1975, 18(9): 509-517. https:\/\/doi.org\/10.1145\/361002.361007.","journal-title":"Communications of the ACM"},{"issue":"4","key":"2429_CR23","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1137\/0211059","volume":"11","author":"ACC Yao","year":"1982","unstructured":"Yao A C C. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM Journal on Computing, 1982, 11(4): 721-736. https:\/\/doi.org\/10.1137\/0211059.","journal-title":"SIAM Journal on Computing"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-022-2429-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11390-022-2429-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-022-2429-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,3]],"date-time":"2023-12-03T17:34:47Z","timestamp":1701624887000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11390-022-2429-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,30]]},"references-count":23,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["2429"],"URL":"https:\/\/doi.org\/10.1007\/s11390-022-2429-6","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,30]]},"assertion":[{"value":"15 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 November 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}