Sequential update of ADtrees

Ingcreasingly, data-mining algorithms must deal with databases that continuously grow over time. These algorithms must avoid repeatedly scanning their databases. When database attributes are symbolic, ADtrees have already shown to be efficient structures to store sufficient statistics in main memory and to accelerate the mining process in batch environments. Here we present an efficient method to sequentially update ADtrees that is suitable for incremental environments.

[1]  S. Elmaghraby,et al.  A Single-Sample Multiple-Decision Procedure for Selecting the Multinomial Event Which Has the Highest Probability , 1959 .

[2]  Douglas H. Fisher,et al.  Ordering Effects in Incremental Learning , 1993 .

[3]  Hans Spada,et al.  Learning in Humans and Machines: Towards an Interdisciplinary Learning Science , 1995 .

[4]  Andrew W. Moore,et al.  ADtrees for Fast Counting and for Fast Learning of Association Rules , 1998, KDD.

[5]  Andrew W. Moore,et al.  Cached Sufficient Statistics for Efficient Machine Learning with Large Datasets , 1998, J. Artif. Intell. Res..

[6]  Catherine Blake,et al.  UCI Repository of machine learning databases , 1998 .

[7]  Josep Roure Alcobé,et al.  A Buffering Strategy to Avoid Ordering Effects in Clustering , 1998, ECML.

[8]  Andrew W. Moore,et al.  A Dynamic Adaptation of AD-trees for Efficient Machine Learning on Large Data Sets , 2000, ICML.

[9]  Josep Roure Alcobé.  Incremental Learning of Tree Augmented Naive Bayes Classifiers , 2002, IBERAMIA.

[10]  Josep Roure Alcobé.  An Incremental Algorithm for Tree-shaped Bayesian Network Learning , 2002, ECAI.

[11]  Geoff Hulten,et al.  Mining complex models from arbitrarily large databases in constant time , 2002, KDD.

[12]  Andrew W. Moore,et al.  Optimal Reinsertion: A New Search Operator for Accelerated and More Accurate Bayesian Network Structure Learning , 2003, ICML.

[13]  J. Alcobé.  Incremental Augmented Naive Bayes Classifiers , 2004, ECAI.

[14]  J. Alcobé.  Incremental Hill-Climbing Search Applied to Bayesian Network Structure Learning , 2004 .

[15]  Gregory F. Cooper,et al.  A Bayesian method for the induction of probabilistic networks from data , 1992, Machine Learning.

[16]  Anna Goldenberg,et al.  Tractable learning of large Bayes net structures from sparse data , 2004, ICML.

[17]  Stefano Ferilli,et al.  Avoiding Order Effects in Incremental Learning , 2005, AI*IA.

[18]  Daphne Koller,et al.  Ordering-Based Search: A Simple and Effective Algorithm for Learning Bayesian Networks , 2005, UAI.

[19]  Chris Watkins,et al.  Proceedings of the European Conference on Machine Learning (ECML) , 2006 .