An empirical analysis of techniques for constructing and searching K-dimensional trees

Proceeding of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2000, Pages 26-33

  Talbert, Douglas A ^a   Fisher, Doug ^a  

^a VANDERBILT UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; DATABASE SYSTEMS; HEURISTIC METHODS; TREES (MATHEMATICS); VECTORS;

NEAREST-NEIGHBOR SEARCH TECHNIQUES;

DATA MINING;

EID: 0034592740     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/347090.347100     Document Type: Conference Paper

References (12)

1. Aha, D. W. "Tolerating Noisy, Irrelevant and Novel Attributes in Instance-Based Learning Algorithms." International Journal of Man-Machine Studies, 36, 267-287 (1992).
2. Bendat, J. S. & Piersol, A. G. Random Data: Analysis and Measurement Procedures. New York: John Wiley & Sons (1986).
3. Bentley, J. L. "Multidimensional Binary Search Trees Used for Associative Searching." Communications of the ACM, 18, 509-517 (1975).
4. Deng, K. & Moore, A. W. "Multiresolution Instance-Based Learning," In G. Weiss & S. Sen (Eds.), Proceedings of the 14th International Joint Conference on Artificial Intelligence, (pp. 1233-1239), Berlin: Springer-Verlag (1995).
5. Friedman, J. H., Bentley, J. L., & Finkel, R. A. "An Algorithm for Finding Best Matches in Logarithmic Expected Time." ACM Transactions on Mathematical Software, 3, 209-226 (1977).
6. Moore, A. W. "An Introductory Tutorial on Kd-Trees." Extract from Efficient Memory-based Learning for Robot Control (Technical Report 209). Computer Laboratory, University of Cambridge (1991).
7. Moore, A. W. "Very Fast EM-Based Mixture Model Clustering Using Multiresolution Kd-Trees." In M. S. Kearns, S. A. Solla, & D. A. Cohn (Eds.), Advances in Neural Information Processing Systems, 2, Cambridge: MIT Press (1999).
8. Sproull, R. F. "Refinements to Nearest-Neighbor Searching in k-Dimensional Trees." Algorithmica, 6, 579-589 (1991).
9. Talbert, D. A. & Fisher, D. "OPT-KD: An Algorithm for Optimizing Kd-Trees." In I. Bratko & S. Dzeroski (Eds.), Machine Learning: Proceedings of the Sixteenth International Conference, (pp. 398-405). San Francisco: Morgan Kaufmann (1999).
10. Talbert, D. A. & Fisher, D. "Exploiting Sample-Data Distribution to Reduce the Cost of Nearest-Neighbor Searches with Kd-Trees." In D. J. Hand, J. N. Kok, & M. R. Berthold (Eds.), Advances in Intelligent Data Analysis: Proceedings of the Third International Symposium, IDA-99, Lecture Notes in Computer Science, 1642, pp.407-414, Berlin: Springer-Verlag (1999).
11. USDA "Nutrient Database for Standard Reference (Release 12)" [Electronic database]. Washington, DC: United States Department of Agriculture, Agricultural Research Service, Nutrient Data Laboratory [Producer and Distributor]. Available WWW: www.nal.usda.gov Directory: fnic/foodcomp/Data/SR12/dnload/ File: srl2asci.zip (1999).
12. Woolson, R. F. "Statistical Methods for the Analysis of Biomedical Data." New York: John Wiley & Sons (1987).