Being prepared in a sparse world: the case of KNN graph construction - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Being prepared in a sparse world: the case of KNN graph construction

Abstract

K-Nearest-Neighbor (KNN) graphs have emerged as a fundamental building block of many on-line services providing recommendation, similarity search and classification. Constructing a KNN graph rapidly and accurately is, however, a computationally intensive task. As data volumes keep growing, speed and the ability to scale out are becoming critical factors when deploying a KNN algorithm. In this work, we present KIFF, a generic, fast and scalable KNN graph construction algorithm. KIFF directly exploits the bipartite nature of most datasets to which KNN algorithms are applied. This simple but powerful strategy drastically limits the computational cost required to rapidly converge to an accurate KNN solution, especially for sparse datasets. Our evaluation on a representative range of datasets show that KIFF provides, on average, a speed-up factor of 14 against recent state-of-the art solutions while improving the quality of the KNN approximation by 18%.
Fichier principal
Vignette du fichier
PID4067857.pdf (975.78 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01251010 , version 1 (30-06-2016)

Identifiers

  • HAL Id : hal-01251010 , version 1

Cite

Antoine Boutet, Anne-Marie Kermarrec, Nupur Mittal, François Taïani. Being prepared in a sparse world: the case of KNN graph construction. International Conference on Data Engineering (ICDE), May 2016, Helsinki, Finland. ⟨hal-01251010⟩

Relations

767 View
1041 Download

Share

Gmail Facebook X LinkedIn More