Skip to main content
profile image
David C. Anastasiu
Other
TAPNN: Tanimoto All-Pairs Nearest Neighbors
(2016)
  • David C. Anastasiu, San Jose State University
  • George Karypis, University of Minnesota - Twin Cities
Link
Abstract
TAPNN was incorporated in the latest version of the L2AP program. This program implements several methods for solving the AllPairs Similarity Search problem for cosine similarity and Tanimoto coefficient, including AllPairs, MMJoin, MK-Join, IdxJoin, L2AP and TAPNN.

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. Efficient Identification of Tanimoto Nearest Neighbors. Proceedings of the 3rd IEEE International Conference on Data Science and Advanced Analytics (DSAA 2016).
Disciplines
Publication Date
2016
Citation Information
David C. Anastasiu and George Karypis. "TAPNN: Tanimoto All-Pairs Nearest Neighbors" (2016)
Available at: http://works.bepress.com/david-anastasiu/21/