Antoine Boutet, Anne-Marie Kermarrec, Nupur Mittal, and François Taïani

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

32nd IEEE International Conference on Data Engineering (ICDE'16), Helsinki, Finland, May, pp. 172-181, IEEE Computer Society, 2016 (12p.)

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%.

Copyright Notice: This material is presented to ensure timely dissemination of scholarly and technical work.Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

IEEE Copyright Notice: © 2001-2017 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

complete document

presentation

doi:http://doi.org/10.1109/ICDE.2016.7498244 (publisher's link)

bibtex



[Maison.png]Back to Home

 
Last generated on 1 Jun 2017       francois.taiani@irisa.fr     Valid HTML 4.0!