Czumaj, Artur and Sohler, Christian (2024) Sublinear time approximation of the cost of a metric k-nearest neighbor graph. SIAM Journal on Computing, 53 (2). pp. 524-571. doi:10.1137/22M1544105 ISSN 0097-5397.
Preview |
PDF
WRAP-Sublinear-time-approximation-cost-metric-k-nearest-neighbor-graph-24.pdf - Accepted Version - Requires a PDF viewer. Download (910kB) | Preview |
Abstract
Let (X,d) be an n-point metric space. We assume that (X,d) is given in the distance oracle model, that is, X-{1,...,n} and for every pair of points x,y from X we can query their distance d(x,y) in constant time. A k-nearest neighbor (k-NN) graph for (X,d) is a directed graph G-(V,E) that has an eduge to each of v's ka nearest neighbors. We use cost(G) to denote the sum of edge weights of G. In this paper, we study the problem of approximating cost(G) in sublinear time when we are given oracle access to the metric space (X,d) that defines G. Our goal is to develop an algorithm that solves this problem faster than the time required to compute G. We first present an algorithm that in Õε(n^2/k) time with probability at least 2/3 approximates cost(G) to within a factor of 1+ε. Next, we present a more elaborate sublinear algorithm that in time Õε(min{nk^3/2, n^2/k}) computes an estimate cost of cost(G) that satisfies with probability at least 2/3 |cost(G) - cost|≤ε ⋅ (cost(G)+mst(X)), where mst(X) denotes the cost of the minimum spanning tree of (X,d). Further, we complement these results with near matching lower bounds. We show that any algorithm that for a given metric space (X,d) of size n, with probability at least 2/3, estimates cost(G) to within a 1+ε factor requires Ω(n^2/k) time. Similarly, any algorithm taht with probability at least 2/3 estimates cost(G) to wtihin an additive error term ε ⋅ (mst(X) + cost(X)) requires Ωε(min{nk^3/2, n^2/k}) time.
Item Type: | Journal Article |
---|---|
Subjects: | Q Science > QA Mathematics |
Divisions: | Faculty of Science, Engineering and Medicine > Science > Computer Science |
Library of Congress Subject Headings (LCSH): | Algorithms, Computational complexity |
Journal or Publication Title: | SIAM Journal on Computing |
Publisher: | Society for Industrial and Applied Mathematics |
ISSN: | 0097-5397 |
Official Date: | 17 April 2024 |
Dates: | Date Event 17 April 2024 Published 6 November 2023 Accepted |
Volume: | 53 |
Number: | 2 |
Page Range: | pp. 524-571 |
DOI: | 10.1137/22M1544105 |
Status: | Peer Reviewed |
Publication Status: | Published |
Re-use Statement: | First Published in SIAM Journal on Computing in 55 (2). pp. 524-571, published by the Society for Industrial and Applied Mathematics (SIAM) Copyright © by SIAM. Unauthorized reproduction of this article is prohibited. |
Access rights to Published version: | Restricted or Subscription Access |
Date of first compliant deposit: | 3 January 2024 |
Date of first compliant Open Access: | 1 May 2024 |
RIOXX Funder/Project Grant: | Project/Grant ID RIOXX Funder Name Funder ID EP/N011163/1 [EPSRC] Engineering and Physical Sciences Research Council |
Conference Paper Type: | Paper |
Type of Event: | Conference |
Related URLs: | |
URI: | https://wrap.warwick.ac.uk/182292/ |
Request changes or add full text files to a record
Repository staff actions (login required)
![]() |
View Item |