@article {Benkaouz201648,
	title = {Nearest neighbors graph construction: Peer sampling to the rescue},
	journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
	volume = {9944 LNCS},
	year = {2016},
	note = {cited By 0},
	pages = {48-62},
	abstract = {In this paper, we propose an efficient KNN service, called KPS (KNN-Peer-Sampling). The KPS service can be used in various contexts e.g. recommendation systems, information retrieval and data mining. KPS borrows concepts from P2P gossip-based clustering protocols to provide a localized and efficient KNN computation in large-scale systems. KPS is a sampling-based iterative approach, combining randomness, to provide serendipity and avoid local minimum, and clustering, to ensure fast convergence. We compare KPS against the state of the art KNN centralized computation algorithm NNDescent, on multiple datasets. The experiments confirm the efficiency of KPS over NNDescent: KPS improves significantly on the computational cost while converging quickly to a close to optimal KNN graph. For instance, the cost, expressed in number of pairwise similarity computations, is reduced by ≈23\% and ≈49\% to construct high quality KNN graphs for Jester and MovieLens datasets, respectively. In addition, the randomized nature of KPS ensures eventual convergence, not always achieved with NNDescent. {\textcopyright} Springer International Publishing AG 2016.},
	doi = {10.1007/978-3-319-46140-3_4},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84990068831\&doi=10.1007\%2f978-3-319-46140-3_4\&partnerID=40\&md5=001c7ac565106835cc5cd7a01e01a3c4},
	author = {Benkaouz, Y.a and Erradi, M.a and Kermarrec, A.-M.b}
}
