Scalable k-nearest neighbor graph construction based on greedy filtering.

Youngki Park|Sungchan Park|Sang-goo Lee|Woosung Jung


Anthology ID:DBLP:conf/www/ParkPLJ13
Volume:22nd International World Wide Web Conference, WWW '13, Rio de Janeiro, Brazil, May 13-17, 2013, Companion Volume
Year:2013
Venue:The Web Conference (WWW)
Publisher:International World Wide Web Conferences Steering Committee / ACM
Pages:227-228
URL:https://doi.org/10.1145/2487788.2487905
DOI:https://doi.org/10.1145/2487788.2487905
DBLP:conf/www/ParkPLJ13
BibTeX:
@inproceedings{park-2013-scalable, author = {Youngki Park and Sungchan Park and Sang-goo Lee and Woosung Jung}, editor = {Les Carr and Alberto H. F. Laender and Bernadette Farias L\'{o}scio and Irwin King and Marcus Fontoura and Denny Vrandecic and Lora Aroyo and Jos\'{e} Palazzo M. de Oliveira and Fernanda Lima and Erik Wilde}, title = {{Scalable k-nearest neighbor graph construction based on greedy filtering}}, booktitle = {{22nd International World Wide Web Conference, WWW '13, Rio de Janeiro, Brazil, May 13-17, 2013, Companion Volume}}, pages = {227--228}, publisher = {International World Wide Web Conferences Steering Committee / ACM}, year = {2013}, url = {https://doi.org/10.1145/2487788.2487905}, doi = {https://doi.org/10.1145/2487788.2487905} }