An Efficient Algorithm for Mining Association Rules in Large Databases

Abstract

Mining for a.ssociation rules between items in a large database of sales transactions has been described as an important database mining problem. In this paper we present an efficient algorithm for mining association rules that is fundamentally different from known algorithms. Compared to previous algorithms, our algorithm not only reduces the I/O overhead significantly but also has lower CPU overhead for most cases. We have performed extensive experiments and compared the performance of our algorithm with one of the best existing algorithms. It was found that for large databases, the CPU overhead was reduced by as much as a factor of four and I/O was reduced by almost an order of magnitude. Hence this algorithm is especially suitable for very large size databases.

Extracted Key Phrases

10 Figures and Tables

050100'97'99'01'03'05'07'09'11'13'15'17
Citations per Year

1,121 Citations

Semantic Scholar estimates that this publication has 1,121 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Savasere1995AnEA, title={An Efficient Algorithm for Mining Association Rules in Large Databases}, author={Ashok Savasere and Edward Omiecinski and Shamkant B. Navathe}, booktitle={VLDB}, year={1995} }