Fast distributed k-nn graph updateReport as inadecuate

Fast distributed k-nn graph update - Download this document for free, or read online. Document in PDF available to download.

1 Ecole Royale Militaire 2 Eurecom Sophia Antipolis

Abstract : In this paper, we present an approximate algorithm that is able to quickly modify a large distributed k-nn graph by adding or removing nodes. The algorithm produces an approximate graph that is highly similar to the graph computed using a naïve approach, although it requires the computation of far fewer similarities. To achieve this goal, it relies on a novel, distributed graph based search procedure. All these algorithms are also experimentally evaluated, using both euclidean and non-euclidean datasets.

Author: Thibault Debatty - Fabio Pulvirenti - Pietro Michiardi - Wim Mees -



Related documents