基于有向无环图的频繁模式挖掘算法.pdfVIP

M ay COM PU T ER ENGINEERING A ND DESIGN Vol No DAGFIM T P A doi issn j M ining f requent item set s algo rithm based on directed acycline g raph Z H U Yili DEN G Zhenrong XIE Pan School of Computer Science and Engineering Guilin U niversity of Electronics T echnology Guilin China Guangxi Key Laboratory of T rusted Sof tw are Guilin U niversity of Electronic T echnology Guilin China Abstract Aiming at the problem that the classical Apriori algorithm leads to a lot of candidate itemset and scans database for many times in mining f requent itemset the algorithm called DAGFIM based on directed acycline graph w as proposed T he data base w as projected to binary table directed acycline graph w as generated for each f requent itemset using binary table and the counts of f requent itemset w ere used as w eight for graph that w as generated in previous step T he edge w hich w as larger than the support threshold w as reserved to recursively mine f requent itemset using directed acycline graph Experimental results show that the proposed algorithm w ith different support and data size is more efficient than Apriori in mining f requent itemset Key words association rule binary table directed acycline graph f requent itemset support 0