Approximate Range Queries for Clustering

From MaRDI portal
Publication:5116522

DOI10.4230/LIPICS.SOCG.2018.62zbMATH Open1489.68369arXiv1803.03978OpenAlexW2963509702MaRDI QIDQ5116522FDOQ5116522

Eunjin Oh, Hee-Kap Ahn

Publication date: 18 August 2020

Abstract: We study the approximate range searching for three variants of the clustering problem with a set P of n points in d-dimensional Euclidean space and axis-parallel rectangular range queries: the k-median, k-means, and k-center range-clustering query problems. We present data structures and query algorithms that compute (1+varepsilon)-approximations to the optimal clusterings of PcapQ efficiently for a query consisting of an orthogonal range Q, an integer k, and a value varepsilon>0.


Full work available at URL: https://arxiv.org/abs/1803.03978





Cites Work


Cited In (3)






This page was built for publication: Approximate Range Queries for Clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5116522)