| 基于Apriori和IUA的改进算法 |
| |
| 引用本文： | 钟晓桢.基于Apriori和IUA的改进算法[J].江汉大学学报(自然科学版),2007,35(3):59-63. |
| |
| 作者姓名： | 钟晓桢 |
| |
| 作者单位： | 江汉大学,物理与信息工程学院,武汉,430056 |
| |
| 摘 要： | 在数据库中挖掘关联规则是数据挖掘领域的一个重要的研究课题,在应用中具有非常重要的意义.在分析Apriori算法和IUA算法经典关联规则挖掘算法的基础上,提出了一种基于最近挖掘结果的更新算法称为IIUA.IIUA算法吸收了Apriori算法和IUA算法的优点,在改变最小支持度和基于最近挖掘结果的条件下,从生成尽可能少的候选项集考虑,得到完整的新频繁项集,从而提高算法的效率.
|
| 关 键 词： | 数据挖掘 关联规则 Apriori算法 IUA算法 频繁项集 |
| 文章编号： | 1673-0143（2007）03-0059-05 |
| 修稿时间： | 2006-12-07 |
An Improved Algorithm Based on Apriori and IUA |
| |
| ZHONG Xiao-zhen.An Improved Algorithm Based on Apriori and IUA[J].Journal of Jianghan University:Natural Sciences,2007,35(3):59-63. |
| |
| Authors: | ZHONG Xiao-zhen |
| |
| Institution: | School of Physics and Information Engineering, Jianghan University, Wuhan 430056, China |
| |
| Abstract: | In the field of data mining,an extremely important subject that entails persistent re-search efforts is to mine association rules from transactional databases. Having reviewed several classic algorithms on mining association rules like Apriori and IUA,puts forward an improved update algorithm based on latest mining results named IIUA. The IIUA Algorithm absorbs the merits of both Apriori and IUA. Given the latest mining results,it uses fewer possible candidate generations to get new frequent itemsets featuring completeness when the minimum support changes. The effi-ciency of algorithm has therefore been increased. |
| |
| Keywords: | data mining Association rules Apriori algorithm IUAalgorithm frequent itemsets |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
