François Taïani

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

Invited Seminar of the Inria Project Team TAO, Inria Saclay, France, May, 2016

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 talk, I will 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%. This work was performed in collaboration with my colleagues Antoine Boutet, Anne-Marie Kermarrec, and Nupur Mittal.



This talk presents the results discussed in the ICDE 2016 paper with the same name.

[Maison.png]Back to Home

Last generated on 8 Dec 2019     Valid HTML 4.0!