%0 Journal Article
%T Research of multiple minimum supports frequent itemsets mining<br>多重最小支持度频繁项集挖掘算法研究
%A ZHANG Hui-zhe
%A WANG Jian
%A <br>张慧哲
%A 王坚
%J 计算机应用
%D 2007
%I 
%X Mining frequent itemsets algorithm based on multiple minimum supports was studied in this paper, because sometimes setting different minimum supports to mine frequent itemsets is necessary. A new Minimum Support tree (MS-tree) algorithm and a MS-growth algorithm to mine all frequent itemsets based on Frequent Pattern growth (FP-growth) were proposed. It solves the problem of MSapriori algorithm that it cannot generate association rules without scanning the database again. The experimental results show that the proposed algorithm is comparable to FP-growth algorithm, but the former can solve the problem of multiple minimum supports.
%K data mining
%K association rules
%K multiple minimum supports
%K FP-growth<br>数据挖掘
%K 关联规则
%K 多重最小值支持度
%K FP-growth
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=B705322467B5F1C9E4A36B93906D901F&yid=A732AF04DDA03BB3&vid=DB817633AA4F79B9&iid=9CF7A0430CBB2DFD&sid=6400C497FC137EE5&eid=B7FFAC52F43C6AF4&journal_id=1001-9081&journal_name=计算机应用&referenced_num=0&reference_num=7