Range-Clustering Queries

05/17/2017
by   Mikkel Abrahamsen, et al.
0

In a geometric k-clustering problem the goal is to partition a set of points in R^d into k subsets such that a certain cost function of the clustering is minimized. We present data structures for orthogonal range-clustering queries on a point set S: given a query box Q and an integer k>2, compute an optimal k-clustering for S∖ Q. We obtain the following results. We present a general method to compute a (1+ϵ)-approximation to a range-clustering query, where ϵ>0 is a parameter that can be specified as part of the query. Our method applies to a large class of clustering problems, including k-center clustering in any L_p-metric and a variant of k-center clustering where the goal is to minimize the sum (instead of maximum) of the cluster sizes. We extend our method to deal with capacitated k-clustering problems, where each of the clusters should not contain more than a given number of points. For the special cases of rectilinear k-center clustering in R^1, and in R^2 for k=2 or 3, we present data structures that answer range-clustering queries exactly.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/11/2018

Approximate Range Queries for Clustering

We study the approximate range searching for three variants of the clust...
research
08/11/2019

Fully Dynamic k-Center Clustering in Doubling Metrics

In the k-center clustering problem, we are given a set of n points in a ...
research
02/01/2022

Gradient Based Clustering

We propose a general approach for distance based clustering, using the g...
research
12/05/2018

Correlation Clustering in Data Streams

Clustering is a fundamental tool for analyzing large data sets. A rich b...
research
11/30/2017

A limit field for orthogonal range searches in two-dimensional random point search trees

We consider the cost of general orthogonal range queries in random quadt...
research
03/16/2021

On Undecided LP, Clustering and Active Learning

We study colored coverage and clustering problems. Here, we are given a ...
research
08/07/2019

Fully dynamic hierarchical diameter k-clustering and k-center

We develop dynamic data structures for maintaining a hierarchical k-cent...

Please sign up or login with your details

Forgot password? Click here to reset