DMCA
An effective hash-based algorithm for mining association rules (1995)
| Citations: | 283 - 3 self |
BibTeX
@INPROCEEDINGS{Park95aneffective,
author = {Jong Soo Park and Ming-syan Chen and Philip S. Yu},
title = {An effective hash-based algorithm for mining association rules},
booktitle = {},
year = {1995},
pages = {175--186},
publisher = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In this paper, we examine the issue of mining association rules among items in a large database of sales transactions. The mining of association rules can be mapped into the problem of discovering large itemsets where a large itemset is a group of items which appear in a sufficient number of transactions. The problem of discovering large itemsets can be solved by constructing a candidate set of itemsets first and then, identifying, within this candidate set, those itemsets that meet the large itemset requirement. Generally this is done iteratively for each large k-itemset in increasing order of k where a large k-itemset is a large itemset with k items. To determine large itemsets from a huge number of candidate large itemsets in early iterations is usually the dominating factor for the overall data mining performance. To address this issue, we propose an effective hash-based algorithm for the candidate set generation. Explicitly, the number of candidate 2-itemsets generated by the proposed algorithm is, in orders of magnitude, smaller than that by previous methods, thus resolving the performance bottleneck. Note that the generation of smaller candidate sets enables us to effectively trim the transaction database size at a much earlier stage of the iterations, thereby reducing the computational cost for later iterations significantly. Extensive simulation study is conducted to evaluate performance of the proposed algorithm. 1
Keyphrases
association rule effective hash-based algorithm candidate set large itemsets large k-itemset large itemset early iteration candidate 2-itemsets overall data mining performance large itemset requirement sale transaction performance bottleneck later iteration large database computational cost candidate large itemsets previous method dominating factor huge number transaction database size sufficient number extensive simulation study
