【摘要】 通过对Apriori算法的频繁项目集的分析研究,给出了基于图的频繁项集挖掘算法.该算法在求频繁K-项集的过程中只需一次扫描数据库,避免了Apriori算法需多次扫描数据库的不足.同时,由于在有向图中利用有限节点之间的路径求频繁K-项集,该算法减少了Apriori算法中需多次进行连接运算的不足.更多还原

【Abstract】 By means of an analysis and study of finding frequent itemsets which is the key step of Apriori Algorithm,the paper proposes a graph-based frequent item-set mining algorithm using this ways,in seeking frequent K-item-set,the scanning database only once is needed.That which avoids the deficiency.And means,The multiple times scanning database is needed in Apriori Algorithm.Also,in a directed graph,frequent K-item-set is saught by using the path between finite nodes,so this reduces the deficiency of multiple joint calculation needed in apriori algorithm.更多还原