摘要
数据挖掘中IUA算法存在遗漏频繁项目集致使有的关联规则挖掘不出来的问题,在分析Apriori算法、IUA算法等经典关联规则挖掘算法的基础上,提出了一种基于最近挖掘结果的更新算法HIUA。HIUA算法吸收了Apriori算法和IUA算法的优点,在改变最小支持度和基于最近挖掘结果的条件下,从生成尽可能少的候选项目集考虑,从而得到完整的新频繁项目集,提高了算法的效率。
In data mining, IUA algorithm has a problem that the frequent itemsets are not minined completely. Apriori algorithm in the analysis, such as classical correlation rules IUA algorithms excavation algorithms based on the results presentes an update on recent excavations algorithm called HIUA. HIUA algorithms absorbed Apriori algorithm and the advantages IUA algorithms, the smallest change in the support for and based on the results of recent excavations conditions from the pending option sets generated minimal consideration given complete sets of innovative procedures, thereby enhancing the efficiency of algorithms.
出处
《计算机工程》
CAS
CSCD
北大核心
2008年第1期64-65,68,共3页
Computer Engineering
关键词
关联规则
更新算法
数据挖掘
频繁项目集
association rules
updating algorithm
data mining
frequent item set
