摘要
增量式更新算法能充分利用已挖掘出的知识来提高挖掘效率,是数据挖掘高效算法研究中一个主要方向.本文首先分析了经典的关联规则增量式更新算法FUP(Fast Updating algorithm)算法的不足,提出了一种改进的关联规则增量式更新算法IIUA(Improved Incremental Updating Algorithm),极大地降低了存储空间和挖掘时间需求,从而提高了整个关联规则挖掘的效率.
Incremental updating algorithm is an important part of data mining field,it can make good use of the knowledge that has been mined to improve the mining efficiency.This paper puts forward a new algorithm IIUA(Improved Incremental Updating Algorithm) compare with an classical incremental updating algorithm(FUP).The two algorithms are compared and analyzed,and it shows that IIUA can find new ioteresting itemsets in the new dataset and has a better performance and sensitivity than FUP under different databases...
出处
《山西大同大学学报(自然科学版)》
2007年第4期5-8,共4页
Journal of Shanxi Datong University(Natural Science Edition)
基金
山西大同大学科学研究项目[2006k11]
关键词
数据挖掘
关联规则
增量式更新
频繁项目集
data mining
association rules
Incremental updating
frequent itemsets