Efficient identification of Tanimoto nearest neighbors: All-pairs similarity search using the extended Jaccard coefficient

David C. Anastasiu, George Karypis

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

Tanimoto, or extended Jaccard, is an important similarity measure which has seen prominent use in fields such as data mining and chemoinformatics. Many of the existing state-of-the-art methods for market basket analysis, plagiarism and anomaly detection, compound database search, and ligand-based virtual screening rely heavily on identifying Tanimoto nearest neighbors. Given the rapidly increasing size of data that must be analyzed, new algorithms are needed that can speed up nearest neighbor search, while at the same time providing reliable results. While many search algorithms address the complexity of the task by retrieving only some of the nearest neighbors, we propose a method that finds all of the exact nearest neighbors efficiently by leveraging recent advances in similarity search filtering. We provide tighter filtering bounds for the Tanimoto coefficient and show that our method, TAPNN, greatly outperforms existing baselines across a variety of real-world datasets and similarity thresholds.

Original languageEnglish (US)
Pages (from-to)153-172
Number of pages20
JournalInternational Journal of Data Science and Analytics
Volume4
Issue number3
DOIs
StatePublished - Nov 1 2017

Keywords

  • All-pairs similarity search
  • Extended Jaccard
  • Graph construction
  • Nearest neighbors
  • TAPNN
  • Tanimoto similarity

Fingerprint Dive into the research topics of 'Efficient identification of Tanimoto nearest neighbors: All-pairs similarity search using the extended Jaccard coefficient'. Together they form a unique fingerprint.

Cite this