%0 Journal Article
%T Algorithm of Frequent Itemsets Mining Based on Single Transaction Itemsets Combination<br>一种基于单事务项集组合的频繁项集挖掘算法
%A ZENG Bo
%A <br>曾波
%J 计算机科学
%D 2008
%I 
%X Apriori is a basic algorithm for frequent itemsets mining.At present,neither Neither Apriori nor its variations resolve some problems which is candidate item and scans transaction database repeatedly.This paper makes a profound research on Apriori and proposes a novel algorithm based on single transaction combination itemsets for mining.The algorithm combines data item to form an itemsets in one transaction database and counts the same itemsets in all transaction databases.Moreover,there is no iteration and candidate itemsets produced by the algorithm,and the mining process scans the traction database only one time,therefore,this algorithm is more effective.
%K Frequent itemsets
%K Apriori
%K Single transaction itemsets combination
%K Candidate item<br>频繁项集
%K Apriori
%K 单事务项集组合
%K 候选项
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=5611358C6F367337D9FC9A1C868A5998&yid=67289AFF6305E306&vid=6209D9E8050195F5&iid=CA4FD0336C81A37A&sid=E0F6F365E4766526&eid=2BA123C6EB9D54C2&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=9