摘要
该文研究了关联规则更新的第一类问题,即数据库记录增加时的关联规则更新问题。首先,该文讨论了现有的FUP算法的基本思想,然后在此基础上对其进行改进,提出了改进的FUP算法EFUP,给出了具体实现方法。最后在不同方面针对EFUP与FUP算法进行了实验比较,说明了EFUP相对于FUP算法的优点。
The article introduces some research work about the first type of association rules updating,that is,the asso-ciation rules updating problem when the database record increases.First,the article discusses the basic ideas of current FUP algorithm,then improves it on this basis,proposes an enhanced FUP algorithm EFUP,and presents the concrete process.Finally,some experiments show that EFUP is better than FUP at many aspects.
出处
《计算机工程与应用》
CSCD
北大核心
2002年第23期6-8,共3页
Computer Engineering and Applications
基金
部委科研项目资助