๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Dimensionality Reduction for Fast Similarity Search in Large Time Series Databases

โœ Scribed by Eamonn Keogh; Kaushik Chakrabarti; Michael Pazzani; Sharad Mehrotra

Book ID
105748148
Publisher
Springer-Verlag
Year
2001
Tongue
English
Weight
289 KB
Volume
3
Category
Article
ISSN
0219-1377

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

SketchSort: Fast All Pairs Similarity Se
SketchSort: Fast All Pairs Similarity Search for Large Databases of Molecular Fingerprints
โœ Yasuo Tabei; Koji Tsuda ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Wiley (John Wiley & Sons) ๐ŸŒ English โš– 865 KB

## Abstract Similarity networks of ligands are often reported useful in predicting chemical activities and target proteins. However, the naive method of computing all pairwise similarities of chemical fingerprints takes quadratic time, which is prohibitive for large scale databases with millions of