Edgar Chávez, Gonzalo Navarro, Ricardo Baeza-Yates, José L. Marroquín  Home/Search
Context
Related
| garota.fismat.umich.mx/...unified.ps.gz dcc.uchile.cl/~gnavarro/p...enc99.ps.gz Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: garota.fismat.umich.mx/~e...publi (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . The indexing algorithms and data structures for similarity seaching in metric spaces seem to emerge from a great diversity, and different approaches have been proposed and analyzed separately, often under different assumptions. Currently, the only realistic way to compare two different algorithms is to apply them to the same data set. We present a unified model for studying similarity searching algorithms, defining common complexity measures allowing comparison between different... (Update)
Similar documents based on text: More All
0.8: Searching in Metric Spaces - Chávez, Navarro, Baeza-Yates, .. (1999) (Correct)
0.5: Spaghettis: An Array Based Algorithm for.. - Chávez.. (1999) (Correct)
0.5: Overcoming the Curse of Dimensionality - Chávez, Marroquín.. (Correct)
BibTeX entry: (Update)
@misc{ vez-unified,
author = "Edgar Chávez and Gonzalo Navarro and Ricardo Baeza-Yates and José
L. Marroquín",
title = "A Unified Model for Similarity Searching",
url = "citeseer.ist.psu.edu/414227.html" }
Citations (may not include all citations):106 tree: an efficient access method for similarity search in me.. (context) - Ciaccia, Patella et al. - 1997
85 Data structures and algorithms for nearest neighbor search i.. - Yianilos - 1993
78 Near neighbor search in large metric spaces - Brin - 1995
69 Optimal expected-time algorithms for closest point problems (context) - Bentley, Weide et al. - 1980
64 Distance-based indexing for high-dimensional metric spaces - Bozkaya, Ozsoyoglu - 1997
58 A simple algorithm for nearest neighbor search in high dimen.. - Nene, Nayar - 1997
55 Some approaches to best-match file searching (context) - Burkhard, Keller - 1973
35 New techniques for best-match retrieval (context) - Sasha, Wang - 1990
29 Satisfying general proximity/similarity queries with metric .. (context) - Uhlmann - 1991
28 Searching in metric spaces by spatial approximation - Navarro - 1999
26 Proximity matching using fixedqueries trees (context) - Baeza-Yates, Cunto et al. - 1994
25 A cost model for similarity queries in metric spaces - Ciaccia, Patella et al. - 1998
21 Prentice-Hall (context) - Munkres, Course - 1975
20 A new version of the nearest-neighbor approximating and elim.. (context) - Mic'o, Oncina et al. - 1994
19 An algorithm for finding nearest neighbors (context) - Vidal - 1986
[Article contains additional citations not shown here]
Documents on the same site (http://garota.fismat.umich.mx/~elchavez/publi.html): More
Overcoming the Curse of Dimensionality - Chávez, Marroquín.. (Correct)
An Effective Clustering Algorithm to Index High Dimensional.. - Chávez, Navarro (Correct)
Unbalancing: the Key to Index High Dimensional Metric Spaces - Chávez, Navarro (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC