| 关联规则挖掘中对Apriori算法的一种改进研究 |
| |
| 引用本文： | 孔芳,钱雪忠.关联规则挖掘中对Apriori算法的一种改进研究[J].计算机工程与设计,2008,29(16). |
| |
| 作者姓名： | 孔芳 钱雪忠 |
| |
| 作者单位： | 江南大学,信息工程学院,江苏,无锡,214122 |
| |
| 摘 要： | 通过对关联规则挖掘算法的详细分析,提出了一种基于无向项集图的动态频繁项集挖掘算法.当事务数据库和最小支持度发生变化时,该算法只需重新遍历一次无向项集图即可得到新的频繁项集.该算法不仅简单、只需扫描一次数据库,而且还具有搜索速度快、节省内存空间等优点.
|
| 关 键 词： | 数据挖掘 关联规则 频繁项集 关联规则挖掘 无向项集图 |
Research of improved Apriori algorithm in mining association rules |
| |
| KONG Fang,QIAN Xue-zhong.Research of improved Apriori algorithm in mining association rules[J].Computer Engineering and Design,2008,29(16). |
| |
| Authors: | KONG Fang QIAN Xue-zhong |
| |
| Affiliation: | KONG Fang,QIAN Xue-zhong(School of Information Engineering,Southern Yangtze University,Wuxi 214122,China) |
| |
| Abstract: | After the method for mining association rules is analyzed,a dynamic algorithm of frequent itemsets mining based on undirected itemsets graph is put forward.The algorithm can get the new frequent itemsets through search the undirected itemsets graph once again,when the database and the minimum support are changed.Studies and analysis of the algorithm show that it cannot only scan the database once,but also has the virtues in high speed,less memory cost. |
| |
| Keywords: | data mining association rules frequent itemsets association rule mining on undirected itemsets graph |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
