摘要
Apriori算法虽然在候选集的产生时利用了剪支技术,但每次扫描数据库时都必须扫描整个数据库,因此扫描的数据量大,速度较慢。Apriori-sort算法是在Apriori算法基础上的改进,基本思想是把事务数据库变为以度表示的事务度数据库,并对事务度数据库进行排序。Apriori-sort算法查找频繁项集时,只扫描数据库Dd中满足d(Ck)芨d(Ti)的事务。对扫描数据库进行了有效剪支,因此Apriori-sort算法的计算效率高。并用仿真数据对Apriori-sort算法和Apriori算法进行了仿真对比实验,实验结果证明了新算法的高效性。
Although Apriori algorithm uses cut-technology when it generate item sets of candidates,it has to scan the entire database while scanning the transaction database each time.The scanning speed is very slow for its large amount of data.The Apriori-sort algorithm is improved from the Apriori algorithm.Its basic idea is to transform a transaction database into a transaction degree database,and sort the transaction-degree database.When the Apriori-sort algorithm searches the frequent item sets,it only scans the transactions in the database Dd that appeases d（Ck）≤d（Ti）.h scans the database with an effective cut.There- fore the Apriori-sort algorithm＇s computing time is very fast.The results of simulation experiments for the Apriori-sort algorithm and the Apriori algorithm show the new algorithm＇s efficiency.
出处
《计算机工程与应用》
CSCD
北大核心
2008年第36期156-159,共4页
Computer Engineering and Applications
基金
西南大学荣昌校区科研项目(No.2007S10)
关键词
排序
Aprior
关联规则
购物篮分析
数据库知识发现
sort
Apriori
association rule
market basket analysis
Knowledge Discovery in Database（KDD）
