AD-trees for Fast Counting and for Fast Learning of Association Rules (1998)

Brigham Anderson, Andrew Moore

Tags

AD-trees, Association Rules, Efficient Statistical Algorithms

Abstract

The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all association rules involving positive binary literals (e.g. Agrawal et al. 1996). Other research has concerned finding complex association rules for high-arity attributes such as CN2 (Clark and Niblett 1989). Complex association rules are capable of representing concepts such as "PurchasedChips=True and PurchasedSoda=False and Area=NorthEast and CustomerType=Occasional AgeRange =Young", but their generality comes with severe computational penalties (intractable numbers of preconditions can have large support). Here, we introduce new algorithms by which a sparse data structure called the ADtree, introduced in (Moore and Lee 1997), can accelerate the finding of complex association rules from large datasets. The ADtree uses the algebra of probability tables to cache a dataset's sufficient statistics within a tractable amount of memory. We first introduce a new ADtree algorithm for quickly counting the number of records that match a precondition. We then show how this can be used in accelerating exhaustive search for rules, and for accelerating CN2-type algorithms. Results are presented on a variety of datasets involving many records and attributes.

Full text

Download (application/pdf, 359.8 kB)

Approximate BibTeX Entry

@inproceedings{anderson-adtrees,
    Year = {1998},
    Booktitle = {Knowledge Discovery from Databases Conference},
    Author = { Brigham Anderson, Andrew Moore },
    Title = {AD-trees for Fast Counting and for Fast Learning of Association Rules}
}