An Efficient Algorithm for Mining Association Rules in Large Databases
An Efficient Algorithm for Mining Association Rules in Large Databases
复制标题
DOI：
--
复制
发表时间：
1995-09
期刊：
影响因子：
--
通讯作者：
Ashok Savasere;E. Omiecinski;S. Navathe
中科院分区：
文献类型：
--
作者：
Ashok Savasere;E. Omiecinski;S. Navathe
在大型销售交易数据库中挖掘项目间的关联规则是一个重要的数据库挖掘问题。在本文中，我们提出了一个有效的算法挖掘关联规则，是从根本上不同于已知的算法。与以前的算法相比，我们的算法不仅减少了I/O开销显着，而且在大多数情况下具有较低的CPU开销。我们已经进行了广泛的实验，并比较我们的算法与现有的最好的算法之一的性能。结果发现，对于大型数据库，CPU开销减少了四分之一，I/O减少了几乎一个数量级。因此，该算法特别适用于超大型数据库。
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.