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

Authors:
Douglas A. Talbert;Doug Fisher
Affiliations:
Vanderbilt University, Dept. of Electrical Engineering & Computer Science, Box 1679-B, Nashville, TN;Vanderbilt University, Dept. of Electrical Engineering & Computer Science, Box 1679-B, Nashville, TN
Venue:
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Year:
2000

Tolerating noisy, irrelevant and novel attributes in instance-based learning algorithms

International Journal of Man-Machine Studies - Special issue: symbolic problem solving in noisy and novel task environments
Very fast EM-based mixture model clustering using multiresolution kd-trees

Proceedings of the 1998 conference on Advances in neural information processing systems II
An Algorithm for Finding Best Matches in Logarithmic Expected Time

ACM Transactions on Mathematical Software (TOMS)
Multidimensional binary search trees used for associative searching

Communications of the ACM
Random Data: Analysis and Measurement Procedures

Random Data: Analysis and Measurement Procedures
OPT-KD: An Algorithm for Optimizing Kd-Trees

ICML '99 Proceedings of the Sixteenth International Conference on Machine Learning
Multiresolution instance-based learning

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2

Hi-index	0.00