A Progressive k-d tree for Approximate k-Nearest Neighbors - Archive ouverte HAL Access content directly
Conference Papers Year :

A Progressive k-d tree for Approximate k-Nearest Neighbors

(1) , (1) , (2)
1
2
Jaemin Jo
  • Function : Author
  • PersonId : 1024025
Jinwook Seo
  • Function : Author
  • PersonId : 1024026
Jean-Daniel Fekete

Abstract

We present a progressive algorithm for approximate k-nearest neighbor search. Although the use of k-nearest neighbor libraries (KNN) is common in many data analysis methods, most KNN algorithms can only be run when the whole dataset has been indexed, i.e., they are not online. Even the few online implementations are not progressive in the sense that the time to index incoming data is not bounded and can exceed the latency required by progressive systems. Exceeding this latency significantly impacts the interactivity of visualization systems especially when dealing with large-scale data. We improve traditional k-d trees for progressive approximate k-nearest neighbor search, enabling fast KNN queries while continuously indexing new batches of data when necessary. Following the progressive computation paradigm, our progressive k-d tree is bounded in time, allowing analysts to access ongoing results within an interactive latency. We also present performance benchmarks to compare online and progressive k-d trees.
Fichier principal
Vignette du fichier
A_Progressive_KD_Tree___DSIA_VIS2017 (1).pdf (500.33 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01650272 , version 1 (28-11-2017)

Identifiers

  • HAL Id : hal-01650272 , version 1

Cite

Jaemin Jo, Jinwook Seo, Jean-Daniel Fekete. A Progressive k-d tree for Approximate k-Nearest Neighbors. Workshop on Data Systems for Interactive Analysis (DSIA), Oct 2017, Phoenix, United States. ⟨hal-01650272⟩
189 View
1766 Download

Share

Gmail Facebook Twitter LinkedIn More