论文标题
采矿协会规则的递归算法
A Recursive Algorithm for Mining Association Rules
论文作者
论文摘要
挖掘频繁的项目集和关联规则是数据挖掘和数据分析中的重要任务。在本文中，我们介绍了Prefrec，这是一种递归算法，用于查找频繁的项目集和关联规则。它的主要优势是相对于项目的递归性。当将新项目添加到数据库时或排除某些新项目时，它对于更新采矿过程特别有效。我们以完整的方式介绍算法的逻辑，并提供一些应用程序。之后，我们就Prefrec的有效性进行了一项实验研究。我们首先将执行时间与一些非常流行的频繁的项目集挖掘算法进行比较。然后，我们进行实验以测试算法的更新功能。
Mining frequent itemsets and association rules is an essential task within data mining and data analysis. In this paper, we introduce PrefRec, a recursive algorithm for finding frequent itemsets and association rules. Its main advantage is its recursiveness with respect to the items. It is particularly efficient for updating the mining process when new items are added to the database or when some are excluded. We present in a complete way the logic of the algorithm, and give some of its applications. After that, we carry out an experimental study on the effectiveness of PrefRec. We first compare the execution times with some very popular frequent itemset mining algorithms. Then, we do experiments to test the updating capabilities of our algorithm.
