A fast algorithm for mining association rules. (English) Zbl 0970.68581
Summary: In this paper, the problem of discovering association rules between items in a large database of sales transactions is discussed, and a novel algorithm, BitMatrix, is proposed. The proposed algorithm is fundamentally different from the known algorithms Apriori and AprioriTid. Empirical evaluation shows that the algorithm outperforms the known ones for large databases. Scale-up experiments show that the algorithm scales linearly with the number of transactions.
Keywords:
database; data mining; large itemset; association rule; minimum support; minimum confidenceReferences:
| [1] | Agrawal R, Srikant R. Mining sequential patterns.IBM Research Report, 1995. |
| [2] | Agrawal R, Imielinski T, Swami A. Mining association rules between sets in large databases. InProc. the ACM SIGMOD Conf. Management of Data, May 1993, pp. 207–216. |
| [3] | Agrawal R, Srikant R. Fast algorithm for mining association rules.IBM Research Report, 1994. |
| [4] | Agrawal R, Mannila H, Toivonen Het al. Fast Discovery of Association Rules. InAdvances in Knowledge Discovery and Data Mining, AAAI/MIT Press, 1996, pp.306–328. |
| [5] | Houtsma M, Swami A. Set-oriented mining of association rules.IBM Research Report, Oct. 1993. · Zbl 0875.68335 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
