"L2Knng: L2-norm k-Nearest Neighbor Graph Construction" by David C. Anastasiu

Other

L2Knng: L2-norm k-Nearest Neighbor Graph Construction

(2015)

David C. Anastasiu, University of Minnesota - Twin Cities
George Karypis, University of Minnesota - Twin Cities

Link

Abstract
This program implements several methods for solving the cosine similarity based K-Nearest Neighbor Graph construction problem, including Greedy Filtering, Maxscore, BMM, kIdxJoin, kL2AP, L2Knng, and L2KnngApprox.

Please cite the following paper if you make use of this program or any of its components in your research.  		

David C. Anastasiu and George Karypis. L2Knng: Fast Exact K-Nearest Neighbor Graph Construction with L2-Norm Pruning. In 24th ACM International Conference on Information and Knowledge Management, CIKM  '15, 2015.

Disciplines

Computer Engineering and
Software Engineering

Publication Date

2015

Citation Information

David C. Anastasiu and George Karypis. "L2Knng: L2-norm k-Nearest Neighbor Graph Construction" (2015)
Available at: http://works.bepress.com/david-anastasiu/22/