Efficient k-nearest neighbor graph construction for generic similarity measures.

Wei Dong|Moses Charikar|Kai Li


Anthology ID:DBLP:conf/www/DongCL11
Volume:Proceedings of the 20th International Conference on World Wide Web, WWW 2011, Hyderabad, India, March 28 - April 1, 2011
Year:2011
Venue:The Web Conference (WWW)
Publisher:ACM
Pages:577-586
URL:https://doi.org/10.1145/1963405.1963487
DOI:https://doi.org/10.1145/1963405.1963487
DBLP:conf/www/DongCL11
BibTeX:
@inproceedings{dong-2011-efficient, author = {Wei Dong and Moses Charikar and Kai Li}, editor = {Sadagopan Srinivasan and Krithi Ramamritham and Arun Kumar and M. P. Ravindra and Elisa Bertino and Ravi Kumar}, title = {{Efficient k-nearest neighbor graph construction for generic similarity measures}}, booktitle = {{Proceedings of the 20th International Conference on World Wide Web, WWW 2011, Hyderabad, India, March 28 - April 1, 2011}}, pages = {577--586}, publisher = {ACM}, year = {2011}, url = {https://doi.org/10.1145/1963405.1963487}, doi = {https://doi.org/10.1145/1963405.1963487} }