2000
Approximate Similarity Search in Metric Data by Using Region Proximity
AMATO, Giuseppe; Pasquale SAVINO; Rabitti FAUSTO a Pavel ZEZULAZákladní údaje
Originální název
Approximate Similarity Search in Metric Data by Using Region Proximity
Autoři
AMATO, Giuseppe; Pasquale SAVINO; Rabitti FAUSTO a Pavel ZEZULA
Vydání
Zurich, Proceedings of the First DELOS Network of Excellence Workshop on "Information Seeking, Searching and Querying in Digital Libraries" s. 101-106, Workshop series, 2000
Nakladatel
ERCIM
Další údaje
Jazyk
angličtina
Typ výsledku
Stať ve sborníku
Obor
10000 1. Natural Sciences
Stát vydavatele
Švýcarsko
Utajení
není předmětem státního či obchodního tajemství
Kód RIV
RIV/00216224:14330/00:00002860
Organizační jednotka
Fakulta informatiky
ISBN
ERCIM-01-W01
Změněno: 19. 2. 2001 17:19, prof. Ing. Pavel Zezula, CSc.
Anotace
V originále
The problem of approximated similarity search for the range and nearest neighbor queries is investigated for generic metric spaces. The search speedup is achieved by ignoring data regions with a small, user defined, proximity with respect to the query. For zero proximity, exact similarity search is performed. The problem of proximity of metric regions is explained and a probabilistic approach is applied. Approximated algorithms use a small amount of auxiliary data that can easily be maintained in main memory. The idea is implemented in a metric tree environment and experimentally evaluated on real-life files using specific performance measures. Improvements of two orders of magnitude can be achieved for moderately approximated search results. It is also demonstrated that the precision of proximity measures can significantly influence the quality of approximated algorithms.
Návaznosti
| MSM 143300004, záměr |
|