Peter N. Yianilos  Home/Search
Context Related
| nec.com/homepages/pny/paper...vptree.ps intermemory.net/pny/papers/...vptree.ps 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: nec.com/homepages/pny/pape...main (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximated in Euclidian space, or where the dimensionality of a Euclidian representation is very high. Also relevant are high-dimensional Euclidian settings in which the distribution of data is in some sense of lower dimension and embedded in the space. The vp-tree (vantage point tree) is introduced in several forms, together... (Update)
Cited by: More
Distance Based Algorithms for Small Biomolecule.. - And Structural Similarity (Correct)
Improvements of TLAESA Nearest Neighbour Search Algorithm - And Extension To (Correct)
Unknown - (2005) (Correct)
Active bibliography (related documents): More All
1.9: Excluded Middle Vantage Point Forests for Nearest Neighbor.. - Yianilos (1999) (Correct)
0.8: Excluded Middle Vantage Point Forests for Nearest Neighbor Search - Yianilos (1999) (Correct)
0.7: Locally Lifting the Curse of Dimensionality for Nearest Neighbor .. - Yianilos (1999) (Correct)
Similar documents based on text: More All
0.2: Normalized Forms for Two Common Metrics - Yianilos (1991) (Correct)
0.2: A Maximum Entropy Approach to Pairwise Data Clustering - Buhmann, Hofmann (1994) (Correct)
0.2: A New Metric for Self-Organizing Feature Maps allows Mapping.. - Jürgen W. Meyer (1993) (Correct)
Related documents from co-citation: More All
38: Near neighbor search in large metric spaces - Brin - 1995
28: Distance-based indexing for highdimensional metric spaces - Bozkaya, Ozsoyoglu - 1997
24: trees: A dynamic index structure for spatial searching (context) - Guttman - 1984
BibTeX entry: (Update)
P. Yianilos. Data structures and algorithms for nearest neighbor search in general metric spaces. In Proc. ACM-SIAM SODA'93, pages 311--321, 1993. http://citeseer.ist.psu.edu/yianilos93data.html More
@inproceedings{ yianilos93data,
author = "Yianilos",
title = "Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces",
booktitle = "{SODA}: {ACM}-{SIAM} Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms)",
year = "1993",
url = "citeseer.ist.psu.edu/yianilos93data.html" }
Citations (may not include all citations):897 Introduction to Statistical Pattern Recognition (context) - Fukunaga - 1990
247 An algorithm for finding best matches in logarithmic expecte.. (context) - Friedman, Bentley et al. - 1977
109 Multidimensional divide-and-conquer (context) - Bentley - 1980
90 New applications of random sampling in computational geometr.. - Clarkson - 1987
75 Data structures for range searching (context) - Bentley, Friedman - 1979
64 A branch and bound algorithm for computing k-nearest neighbo.. (context) - Fukunaga - 1975
64 A randomized algorithm for closestpoint queries (context) - Clarkson - 1988
55 Some approaches to best-match file searching (context) - Burkhard, Keller - 1973
45 Multidimensional searching problems (context) - Dobkin, Lipton - 1976
35 An algorithm for finding nearest neighbors (context) - Friedman, Baskett et al. - 1975
29 Satisfying general proximity/similarity queries with metric .. (context) - Uhlmann - 1991
18 Strategies for efficient incremental nearest neighbor search (context) - Broder - 1990
17 Nearest neighbor pattern classification techniques (context) - Dasarathy - 1991
14 The nearest neighbor problem in an abstract metric space (context) - Feustel, Shapiro - 1982
14 the optimality of Elias's algorithm for performing best-matc.. (context) - Rivest - 1974
9 Separator based parallel divide and conquer in computational.. (context) - Frieze, Miller et al. - 1992
8 General Topology (context) - Kelly - 1955
8 A technique to identify nearest neighbors (context) - Yunck - 1976
5 Tree structures for high dimensionality nearest neighbor sea.. (context) - Eastman, Weiss - 1982
5 Normalized forms for two common metrics - Yianilos - 1991
4 Generation and search of clustered files (context) - Salton, Wong - 1978
3 An O(n log n) algorithm for the allnearest -neighbor problem (context) - Vaidya - 1989
2 Voronoi diagrams -- a survey of a fundemental geometric data.. (context) - Aurenhammer - 1991
2 A fast nearest neighbor finding algorithm based on the order.. (context) - Kim, Park - 1986
1 Metric trees (context) - Uhlmann - 1991
1 New methods for neighborhood searches in metric spaces (context) - Yianilos - 1990
1 A dedicated comparator matches symbol strings fast and intel.. (context) - Yianilos - 1983
The graph only includes citing articles where the year of publication is known.
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