摘要
频繁项集的挖掘是数据挖掘中的一个十分重要的组成部分,目前对于事务数据库频繁项集的挖掘算法研究较多。本文根据事务数据库中布尔型频繁项集挖掘的理论和方法,再结合关系数据库的特殊性。利用标准SQL语言提出了一种新的在关系数据库中挖掘频繁项集的简易算法。实验证明该算法具有较高的效率。
The discovering of frequent itemsets is a most important part of Data Mining. Currently, more research work is done on the algorithm of mining transactional database than on the algorithm of relational database. According to the relational theory and method of Boolean frequent itemsets mining in transactional database, and combining the particularity of mining in relational database, this paper discusses and proposes a new simply algorithm of discovering all the frequent itemsets in relational database by the standard SQL. Experiments prove the algorithm is high effective.
出处
《计算机科学》
CSCD
北大核心
2006年第9期159-160,198,共3页
Computer Science
