Determining Tanimoto similarity neighborhoods of real-valued vectors by means of the triangle inequality and bounds on lengths
From MaRDI portal
Publication:2670886
DOI10.1007/978-3-030-87334-9_2zbMath1495.68194OpenAlexW3201382079MaRDI QIDQ2670886
Publication date: 1 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-87334-9_2
triangle inequalityneighborhoodnearest neighborsEuclidean distancecosine similaritybinary vectornear duplicatesreal-valued vectorTanimoto similarityvector length bounds
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)
Cites Work
- Unnamed Item
- Satisfying general proximity/similarity queries with metric trees
- A proof of the triangle inequality for the Tanimoto distance
- Similarity search. The metric space approach.
- Using Non-Zero Dimensions for the Cosine and Tanimoto Similarity Search Among Real Valued Vectors
- Determining Cosine Similarity Neighborhoods by Means of the Euclidean Distance
This page was built for publication: Determining Tanimoto similarity neighborhoods of real-valued vectors by means of the triangle inequality and bounds on lengths