The Anchors Hierarchy: Using the Triangle Inequality to Survive High Dimensional Data (2000)

Cached

Download Links

by Andrew W. Moore
Venue:In Twelfth Conference on Uncertainty in Artificial Intelligence
Citations:75 - 8 self

Documents Related by Co-Citation

587 An algorithm for finding best matches in logarithmic expected time – Jerome H. Friedman, Jon Louis Bentley, Raphael Ari Finkel - 1977
60 Five Balltree Construction Algorithms – Stephen M. Omohundro - 1989
122 Cached Sufficient Statistics for Efficient Machine Learning with Large Datasets – Andrew Moore, Mary Soon Lee - 1997
62 Multiresolution instance-based learning – K Deng, A W Moore - 1995
682 A Fast Algorithm for Particle Simulations – L. Greengard, V. Rokhlin - 1987
79 An investigation of practical approximate nearest neighbor algorithms – Ting Liu, Andrew W. Moore, Alexander Gray, Ke Yang - 2004
89 Very Fast EM-based Mixture Model Clustering Using Multiresolution kd-trees – Andrew Moore - 1998
87 Experiments with random projection – S Dasgupta - 2000
3917 Pattern Classification and Scene Analysis – R O Duda, P Hart - 1973
8058 Maximum likelihood from incomplete data via the EM algorithm – A. P. Dempster, N. M. Laird, D. B. Rubin - 1977
1108 Multidimensional binary search trees used for associative searching – J L Bentley - 1975
164 Satisfying general proximity/similarity queries with metric trees – J K Uhlmann - 1991
106 Accelerating exact k-means algorithms with geometric reasoning – Dan Pelleg, Andrew Moore - 2000
415 Similarity search in high dimensions via hashing – Aristides Gionis, Piotr Indyk, Rajeev Motwani - 1999
5090 Distinctive Image Features from Scale-Invariant Keypoints – David G. Lowe - 2003
214 an e cient data clustering method for very large databases – BIRCH - 1996
453 Problems in Computational Geometry – Michael Ian Shamos - 1974
2139 Density Estimation for Statistics and Data Analysis – B W Silverman - 1986
364 Density Estimation – David W. Scott - 1997