2001 SearchingInMetricSpaces

Subject Headings: Metric Space, Search Algorithm, Metric Space Search.

Notes

The problem of searching the elements of a set that are close to a given query element under some similarity criterion has a vast number of applications in many branches of computer science, from pattern recognition to textual and multimedia information retrieval. We are interested in the rather general case where the similarity criterion defines a metric space, instead of the more restricted case of a vector space. Many solutions have been proposed in different areas, in many cases without cross-knowledge. Because of this, the same ideas have been reconceived several times, and very different presentations have been given for the same approaches. We present some basic results that explain the intrinsic difficulty of the search problem. This includes a quantitative definition of the elusive concept of "intrinsic dimensionality.” We also present a unified view of all the known proposals to organize metric spaces, so as to be able to understand them under a common framework. Most approaches turn out to be variations on a few different concepts. We organize those works in a taxonomy that allows us to devise new algorithms from combinations of concepts not noticed before because of the lack of communication between different communities. We present experiments validating our results and comparing the existing approaches. We finish with recommendations for practitioners and open questions for future development.

,

	Author	volume	Date Value	title	type	journal	titleUrl	doi	note	year
2001 SearchingInMetricSpaces	Gonzalo Navarro Edgar Chávez Ricardo Baeza-Yates José Luis Marroquín			Searching in Metric Spaces		ACM Computing Surveys	http://portal.acm.org/citation.cfm?id=502808&dl=GUIDE,	10.1145/502807.502808		2001