BibTeX
@MISC{Webb00efficientsearch,
author = {Geoffrey I. Webb},
title = {Efficient Search for Association Rules},
year = {2000}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper argues that for some applications direct search for association rules can be more efficient than the two stage process of the Apriori algorithm which first finds large itemsets which are then used to identify associations. In particular, it is argued, Apriori can impose large computational overheads when the number of frequent itemsets is very large. This will often be the case when association rule analysis is performed on domains other than basket analysis or when it is performed for basket analysis with basket information augmented by other customer information. An algorithm is presented that is computationally efficient for association rule analyses during which the number of rules to be found can be constrained and all data can be maintained in memory.
