摘要
相联规则的提取是数据挖掘的一个重要方面。Apriori算法是提取相联规则的经典算法,效率较高。AprioriPro算法是对Apriori算法的改进,它利用大项集生成过程中的中间结果对数据库进行过滤,从而加快候选项集的计数速度,提高了整个算法的效率。该文在AprioriPro算法的基础上,首先对其基本理论进行扩展并加以证明,提出了AprioriPro2算法。该算法相对于AprioriPro算法能更多地去掉数据库中的无效元组,从而进一步提高了算法的效率。
Mining Association Rule in database is an important aspect of Data Mining.Algorithm Apriori is a classic and efficient algorithm to mine association rule in database.Algorithm AprioriPro is an improved one based on Apriori algorithm,which uses meta -result of large -items produced to filter the database.Compared with Apriori algorithm,it speeds up the counting of candidate large -items and improves the efficiency of the whole algorithm.Based on the algorithm Apriori and AprioriPro,this paper shows an improved algorithm AprioriPro2.At first,the theory,which algorithm AprioriPro is based on,is extended and proved.Then algorithm AprioriPro2is given.Algorithm AprioriPro2can filter more no-use records in database than AprioriPro,and hence improves the efficiency more greatly.
出处
《计算机工程与应用》
CSCD
北大核心
2002年第15期173-174,208,共3页
Computer Engineering and Applications
