现代电子技术
現代電子技術
현대전자기술
MODERN ELECTRONICS TECHNIQUE
2007年
4期
106-107,110
,共3页
Apriori algorithm%association rules%frequent item-sets%business product%set-tree
In this paper,We study the Apriori and FP-growth algorithm in mining association rules and give a method for computing all the frequent item-sets in a database.Its basic idea is giving a concept based on the boolean vector business product,which be computed between all the businesses,then we can get all the two frequent item-sets (min_sup=2).We basis their inclusive relation to construct a set-tree of item-sets in database transaction,and then traverse path in it and get all the frequent item-sets.Therefore,we can get minimal frequent item sets between transactions and items in the database without scanning the database and iteratively computing in Apriori algorithm.
