基于有向图链式存储的关联规则改进算法_张丹丹.pdfVIP

24 1 ( 4 1) 37 : 1003-5850(2011) 01-0037-04 Improved Algorithm of Association Rules based on Digraph Chained Storage Structure 1 2 张丹丹　孟晓伟 1 2 ( 中北大学电子与计算机科学技术学院　太原　030051) ( 山西省招生考试管理中 　太原　030001) 在关联规则数据挖掘领域中, Apriori 算法是这 个方面的经典算法, 但它仍存在许多弊端, 为 在 Apriori 算法的基础上提出了 一种基于有向图链式存储的改进算法, 算法根据数据结构中有向图链式存储的结 构, 将所有事务全部存入链表, 无需多次扫描数据库, 只在事务链表中完成候选集和频繁集的寻找工作。 方 法能够迅速得到候选集的支持度, 从而能更有效地发现频繁项集。通过实验论证, 算法与经典算法相比具有 更高的挖掘效率。 数据挖掘, 关联规则, Apriori 算法, 有向图链式存储 : TP391. 3 : A ABSTRACTIn the fiel of association rules ata mining, Apriori algorithm is a classical algorithm about mining association rule. But it has also some isa vantages, so this paper point s out it s a kin of be improve algorithm base on the igraph chaine , , storage st ructure the algorit hm can put all transactions into a list accor ing to igraph chaine st orage structure of ata structure it ose not nee scanning the at abase frequently an only fin ing generating can i ate item set an frequent item set in the transaction list .This algorithm can get the support of generat ing can i ate item set rapi ly , w hich w oul iscover t he frequent item set more effectively . T his algorit hm has a more mining efficiency than the classical algorithm. , , , KEYW RDS ata mining associat ion rules Apriori algorithm igraph chaine storage structure , m , = 0, = m , i- 1, i ( ) ,