## A compact space decomposition for effective metric indexing (2005)

### Cached

### Download Links

- [www.dcc.uchile.cl]
- [www.ciw.cl]
- [www.dcc.uchile.cl]
- DBLP

### Other Repositories/Bibliography

Venue: | Pattern Recognition Letters |

Citations: | 27 - 6 self |

### BibTeX

@ARTICLE{Navarro05acompact,

author = {Gonzalo Navarro},

title = {A compact space decomposition for effective metric indexing},

journal = {Pattern Recognition Letters},

year = {2005},

volume = {26},

pages = {295--306}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract The metric space model abstracts many proximity search problems, from nearest-neighborclassifiers to textual and multimedia information retrieval. In this context, an index is a data structure that speeds up proximity queries. However, indexes lose their efficiency as the intrinsicdata dimensionality increases. In this paper we present a simple index called list of clusters (LC), which is based on a compact partitioning of the data set. The LC is shown to require little space,to be suitable both for main and secondary memory implementations, and most importantly, to be very resistant to the intrinsic dimensionality of the data set. In this aspect our structure isunbeaten. We finish with a discussion of the role of unbalancing in metric space searching, and how it permits trading memory space for construction time. 1 Introduction The problem of proximity searching has received much attention in recent times, due to an increasing interest in manipulating and retrieving the more and more common multimedia data. Multimedia data have to be classified, forecasted, filtered, organized, and so on. Their manipulation poses new challenges to classifiers and function approximators. The well-known k-nearest neighbor (knn) classifier is a favorite candidate for this task for being simple enough and well understood. One of the main obstacles, however, of using this classifier for massive data classification is its linear complexity to find a set of k neighbors for a given query.