𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Dimensionality reduction for similarity search with the Euclidean distance in high-dimensional applications

✍ Scribed by Seungdo Jeong; Sang-Wook Kim; Byung-Uk Choi

Book ID
106473475
Publisher
Springer US
Year
2008
Tongue
English
Weight
615 KB
Volume
42
Category
Article
ISSN
0942-4962

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Dimensionality Reduction for Similarity
Dimensionality Reduction for Similarity Searching in Dynamic Databases
✍ K.V. Ravi Kanth; Divyakant Agrawal; Amr El Abbadi; Ambuj Singh πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 195 KB

Databases are increasingly being used to store multimedia objects such as maps, images, audio, and video. Storage and retrieval of these objects is accomplished using multidimensional index structures such as R \* -trees and SS-trees. As dimensionality increases, query performance in these index str

Distance phenomena in high-dimensional c
Distance phenomena in high-dimensional chemical descriptor spaces: Consequences for similarity-based approaches
✍ Matthias Rupp; Petra Schneider; Gisbert Schneider πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 227 KB

## Abstract Measuring the (dis)similarity of molecules is important for many cheminformatics applications like compound ranking, clustering, and property prediction. In this work, we focus on real‐valued vector representations of molecules (as opposed to the binary spaces of fingerprints). We demon