An Investigation of Practical Approximate Nearest Neighbor Algorithms
暂无分享,去创建一个
Andrew W. Moore | Alexander G. Gray | Ting Liu | Ke Yang | Ke Yang | A. Moore | Ting Liu
[1] Richard O. Duda,et al. Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.
[2] Jon Louis Bentley,et al. An Algorithm for Finding Best Matches in Logarithmic Expected Time , 1977, TOMS.
[3] Antonin Guttman,et al. R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.
[4] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[5] Stephen M. Omohundro,et al. Efficient Algorithms with Neural Network Behavior , 1987, Complex Syst..
[6] F. Frances Yao,et al. Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[7] Stephen M. Omohundro,et al. Bumptrees for Efficient Function, Constraint and Classification Learning , 1990, NIPS.
[8] Jeffrey K. Uhlmann,et al. Satisfying General Proximity/Similarity Queries with Metric Trees , 1991, Inf. Process. Lett..
[9] B. S. Manjunath,et al. Texture Features for Browsing and Retrieval of Image Data , 1996, IEEE Trans. Pattern Anal. Mach. Intell..
[10] The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries , 1997, SIGMOD Conference.
[11] Shin'ichi Satoh,et al. The SR-tree: an index structure for high-dimensional nearest neighbor queries , 1997, SIGMOD '97.
[12] Pavel Zezula,et al. M-tree: An Efficient Access Method for Similarity Search in Metric Spaces , 1997, VLDB.
[13] Jon M. Kleinberg,et al. Two algorithms for nearest-neighbor search in high dimensions , 1997, STOC '97.
[14] Piotr Indyk,et al. Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.
[15] Sunil Arya,et al. An optimal algorithm for approximate nearest neighbor searching fixed dimensions , 1998, JACM.
[16] Peter Yianilos,et al. Excluded middle vantage point forests for nearest neighbor search , 1998 .
[17] Rafail Ostrovsky,et al. Efficient search for approximate nearest neighbor in high dimensional spaces , 1998, STOC '98.
[18] Piotr Indyk,et al. Similarity Search in High Dimensions via Hashing , 1999, VLDB.
[19] Jonathan Goldstein,et al. When Is ''Nearest Neighbor'' Meaningful? , 1999, ICDT.
[20] Andrew W. Moore,et al. The Anchors Hierarchy: Using the Triangle Inequality to Survive High Dimensional Data , 2000, UAI.
[21] Jonathan Goldstein,et al. Contrast Plots and P-Sphere Trees: Space vs. Time in Nearest Neighbour Searches , 2000, VLDB.
[22] R. Motwani,et al. High-Dimensional Computational Geometry , 2000 .
[23] Jitendra Malik,et al. Shape contexts enable efficient retrieval of similar shapes , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.
[24] Piotr Indyk,et al. On Approximate Nearest Neighbors under linfinity Norm , 2001, J. Comput. Syst. Sci..
[25] K. Clarkson. Nearest Neighbor Searching in Metric Spaces : Experimental Results for sb ( S ) , 2002 .
[26] Trevor Darrell,et al. Fast pose estimation with parameter-sensitive hashing , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.
[27] Leonidas J. Guibas,et al. The Earth Mover's Distance as a Metric for Image Retrieval , 2000, International Journal of Computer Vision.