|
|
| Research article summary (published 30 Aug 2008): |
Effective proximity retrieval by ordering permutations.
Full Abstract
We introduce a new probabilistic proximity search algorithm for range and K-nearest neighbor (K-NN) searching in both coordinate and metric spaces. Although there exist solutions for these problems, they boil down to a linear scan when the space is intrinsically high-dimensional, as is the case in many pattern recognition tasks. This, for example, renders the K-NN approach to classification rather slow in large databases. Our novel idea is to predict closeness between elements according to how they order their distances towards a distinguished set of anchor objects. Each element in the space sorts the anchor objects from closest to farthest to it, and the similarity between orders turns out to be an excellent predictor of the closeness between the corresponding elements. We present extensive experiments comparing our method against state-of-the-art exact and approximate techniques, both in synthetic and real, metric and non-metric databases, measuring both CPU time and distance computations. The experiments demonstrate that our technique almost always improves upon the performance of alternative techniques, in some cases by a wide margin.
Learn Faster Today Improve your study skills
Author information
Author/s: Chavez, Edgar (E); Figueroa, Karina (K); Navarro, Gonzalo (G);
Affiliation: Facultad de Ciencias Fisico Matematicas, Universidad Michoacana, Ciudad Universitaria, Michoacan, Mexico. elchavez(-atsign-)fismat.umich.mx
Journal and publication information
Publication Type: Journal Article; Research Support, Non-U.S. Gov't
Journal: IEEE transactions on pattern analysis and machine intelligence (IEEE Trans Pattern Anal Mach Intell), published in United States. (Language: eng)
Reference: 2008-Sep; vol 30 (issue 9) : pp 1647-58
Dates: Created 2008/07/11; Completed 2008/09/23;
PMID: 18617721, status: MEDLINE (last retrieval date: 11/6/2008)
Sourced from the National Library of Medicine. Abstract text and other information may be subject to copyright.
External Links for this article (including full text providers, if available):
Click Electronic Full-text Provider Links to see options for finding the electronic full text links to this article. Note there may be a subscription or fee required for access to the full text. See our FAQ for information on finding FREE full text articles.
This article may also be located in paper journal collections available in many libraries. Use the Journal and Publication Information above to find the full article.
MeSH headings (categories)
This article was linked to the MESH Headings shown below.
Related articles
These are the highest related articles currently in the database:
- Gapped permutation pattern discovery for gene order comparisons.
30 Dec 2006 - Affine-permutation invariance of 2-D shapes.
30 Oct 2005 - Instability of hierarchical cluster analysis due to input order of the data: the PermuCLUSTER solution.
29 Nov 2005 - NeuRadIR: web-based neuroradiological information retrieval system using three methods to satisfy different user aspects.
13 Jun 2006 - Information security system by iterative multiple-phase retrieval and pixel random permutation.
8 May 2006 - Gene proximity analysis across whole genomes via PQ trees.
29 Nov 2005 - Conservative adjustment of permutation p-values when the number of permutations is limited.
30 Dec 2006 - Evolution under reversals: parsimony and conservation of common intervals.
30 Mar 2007 - Permutation coding technique for image recognition systems.
30 Oct 2006 - Estimation of significance thresholds for genomewide association scans.
30 Mar 2008
Related Article Map
Legend:
- FREE Full text Article.
- Abstract only.
- Title only. More help.
See a large map of 100+ related articles.