计算机工程2009，Vol.35Issue(15)：97-99,120,4.
基于事务树的最大频繁项集挖掘算法
Maximal Frequent Itemsets Mining Algorithm Based on Transaction Tree
摘要
Abstract
Aiming at the shortage of Apriori algorithm in find of frequent items such as numerous search-designaw database set too many times and gennerate too many candidate itemsets, this paper proposes the Tr-Apriori algorithm. This algorithm maps the tings-datebase into transaction-tree. Using the transaction tree can quickly find the maximal frequent itemseta. In the meamwhile it can simplify the calculation of support and avoid the scanning of the entire database and a large number of connecting steps to improve the efficiency of the mining.关键词
最大频繁项集/TT-Apriori算法/事务树/向量内积Key words
maximal frequent itemsets/ TT-Apriori algorithm/ transaction tree/ vector in plot分类
信息技术与安全科学引用本文复制引用
张忠平,郑为夷..基于事务树的最大频繁项集挖掘算法[J].计算机工程,2009,35(15):97-99,120,4.基金项目
国家自然科学基金资助项目(60773100) （60773100）
河北省教育厅科研计划基金资助项目(2006143) （2006143）
