Chromatic k-Nearest Neighbor Queries

by   Thijs van der Horst, et al.

Let P be a set of n colored points. We develop efficient data structures that store P and can answer chromatic k-nearest neighbor (k-NN) queries. Such a query consists of a query point q and a number k, and asks for the color that appears most frequently among the k points in P closest to q. Answering such queries efficiently is the key to obtain fast k-NN classifiers. Our main aim is to obtain query times that are independent of k while using near-linear space. We show that this is possible using a combination of two data structures. The first data structure allow us to compute a region containing exactly the k-nearest neighbors of a query point q, and the second data structure can then report the most frequent color in such a region. This leads to linear space data structures with query times of O(n^1 / 2log n) for points in ℝ^1, and with query times varying between O(n^2/3log^2/3 n) and O(n^5/6 polylog n), depending on the distance measure used, for points in ℝ^2. Since these query times are still fairly large we also consider approximations. If we are allowed to report a color that appears at least (1-ε)f^* times, where f^* is the frequency of the most frequent color, we obtain a query time of O(log n + loglog_1/1-ε n) in ℝ^1 and expected query times ranging between Õ(n^1/2ε^-3/2) and Õ(n^1/2ε^-5/2) in ℝ^2 using near-linear space (ignoring polylogarithmic factors).



page 1

page 2

page 3

page 4


Dynamic Data Structures for k-Nearest Neighbor Queries

Our aim is to develop dynamic data structures that support k-nearest nei...

On Adaptive Distance Estimation

We provide a static data structure for distance estimation which support...

Segment Visibility Counting Queries in Polygons

Let P be a simple polygon with n vertices, and let A be a set of m point...

Improved Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon

We present an efficient dynamic data structure that supports geodesic ne...

Closest-Pair Queries and Minimum-Weight Queries are Equivalent for Squares

Let S be a set of n weighted points in the plane and let R be a query ra...

On the I/O complexity of the k-nearest neighbor problem

We consider static, external memory indexes for exact and approximate ve...

Nearest-Neighbor Queries in Customizable Contraction Hierarchies and Applications

Customizable contraction hierarchies are one of the most popular route p...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.