A Dynamic Adaptation of AD-trees for Efficient Machine Learning on Large Data Sets
Stanford University, CA, 6/30/00
This talk was presented at ICML 2000. It describes a modification to AD-trees to allow incremental and lazy growth. We discuss our implementation of these Dynamic AD-trees and present results for datasets with scores of high-arity attributes and millions of rows. ICML 2000.
These slides are best understood with the help of my notes from the presentation. These notes are available (linked) below.
Download (application/pdf, 73.3 kB)