@inproceedings{3c2b7f74a0724820b2b6d4cc6df09ccf,
title = "Fast distributed k-nn graph update",
abstract = "In this paper, we present an approximate algorithm that is able to quickly modify a large distributed fc-nn graph by adding or removing nodes. The algorithm produces an approximate graph that is highly similar to the graph computed using a na{\"i}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 and Fabio Pulvirenti and Pietro Michiardi and Wim Mees",
note = "Publisher Copyright: {\textcopyright} 2016 IEEE.; 4th IEEE International Conference on Big Data, Big Data 2016 ; Conference date: 05-12-2016 Through 08-12-2016",
year = "2016",
doi = "10.1109/BigData.2016.7840990",
language = "English",
series = "Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "3308--3317",
editor = "James Joshi and George Karypis and Ling Liu and Hu, \{Xiaohua Tony\} and Ronay Ak and Yinglong Xia and Weijia Xu and Aki-Hiro Sato and Sudarsan Rachuri and Lyle Ungar and Yu, \{Philip S.\} and Rama Govindaraju and Toyotaro Suzumura",
booktitle = "Proceedings - 2016 IEEE International Conference on Big Data, Big Data 2016",
}