'N-Body' problems in statistical learning

Advances in Neural Information Processing Systems

Volumn , Issue , 2001, Pages

  Gray, Alexander G ^a   Moore, Andrew W ^b  

^a Carnegie Mellon University   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NEURAL NETWORKS;

DISTANCE COMPUTATION; GEOMETRIC TECHNIQUES; KERNEL DENSITY ESTIMATION; MIXTURES OF GAUSSIANS; NEAREST-NEIGHBOR CLASSIFICATIONS; ORDERS OF MAGNITUDE; STATISTICAL LEARNING; TWO-POINT CORRELATION;

ALGORITHMS;

EID: 84899027721     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. J. Barnes and P. Hut. A Hierarchical O(NlogN) Force-Calculation Algorithm. Nature, 324, 1986.
2. K. Deng and A. W. Moore. Multiresolution instance-based learning. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, pages 1233-1239, San Francisco, 1995. Morgan Kaufmann.
3. J. H. Friedman, J. L. Bentley, and R. A. Finkel. An algorithm for finding best matches in logarithmic expected time. ACM Transactions on Mathematical Software, 3(3):209-226, September 1977.
4. L. Greengard and V. Rokhlin. A Fast Algorithm for Particle Simulations. Journal of Computational Physics, 73, 1987.
5. D. E. Knuth. Sorting and Searching. Addison Wesley, 1973.
6. A. W. Moore. Very fast mixture-model-based clustering using multiresolution kd-trees. In M. Kearns and D. Cohn, editors, Advances in Neural Information Processing Systems 10, pages 543-549, San Francisco, April 1999. Morgan Kaufmann.
7. A. W. Moore. The Anchors Hierarchy: Using the triangle inequality to survive high dimensional data. In Twelfth Conference on Uncertainty in Artificial Intelligence (to appear). AAAI Press, 2000.
8. A. W. Moore and M. S. Lee. Cached Sufficient Statistics for Efficient Machine Learning with Large Datasets. Journal of Artificial Intelligence Research, 8, March 1998.
9. D. Pelleg and A. W. Moore. Accelerating Exact k-means Algorithms with Geometric Reasoning. In Proceedings of the Fifth International Conference on Knowledge Discovery and Data Mining. AAAI Press, 1999.
10. F. P. Preparata and M. Shamos. Computational Geometry. Springer-Verlag, 1985.
11. A. Szalay. Personal Communication. 2000.
12. I. Szapudi. A New Method for Calculating Counts in Cells. The Astrophysical Journal, 1997.
13. I. Szapudi, S. Colombi, and F. Bernardeau. Cosmic Statistics of Statistics. Monthly Notices of the Royal Astronomical Society, 1999.
14. T. Zhang, R. Ramakrishnan, and M. Livny. BIRCH: An Efficient Data Clustering Method for Very Large Databases. In Proceedings of the Fifteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems: PODS 1996. Assn for Computing Machinery, 1996.