A Dynamic Adaptation of AD-trees for Efficient Machine Learning on Large Data Sets (2000)


Download Links

by Paul Komarek , Andrew Moore
Citations:19 - 5 self

Documents Related by Co-Citation

128 Cached Sufficient Statistics for Efficient Machine Learning with Large Datasets – Andrew Moore, Mary Soon Lee - 1997
1140 A Bayesian method for the induction of probabilistic networks from data – Gregory F. Cooper, EDWARD HERSKOVITS - 1992
26 ADtrees for Fast Counting and for Fast Learning of Association Rules – Brigham Anderson, Andrew Moore - 1998
7493 Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference – J Pearl - 1988
638 An algorithm for finding best matches in logarithmic expected time – Jerome H. Friedman, Jon Louis Bentley, Raphael Ari Finkel - 1977
754 Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals – Jim Gray, Adam Bosworth, Andrew Layman, Don Reichart, Hamid Pirahesh - 1996
500 Implementing data cubes efficiently – Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ulman - 1996
2137 Data Mining: Concepts and Techniques – Jiawei Han, Micheline Kamber - 2000
2235 Building a Large Annotated Corpus of English: The Penn Treebank – Mitchell P. Marcus, Beatrice Santorini, Mary Ann Marcinkiewicz - 1993