%0 Journal Article
%T An Efficient Frequent Patterns Mining Algorithm Based on Sorted FP-Tree<br>基于排序FP-树的频繁模式高效挖掘算法
%A QIN Liang-Xi
%A LI Qian
%A SHI Zhong-Zhi Key Lab of Intelligent Information Processing
%A <br>秦亮曦
%A 李谦
%A 史忠植
%J 计算机科学
%D 2005
%I 
%X FP-growth is a high performance algorithm for mining frequent patterns. In FP-growth algorithm, it costs most of the time in constructing and traversing the FP-tree and conditional FP-tree. If we can reduce the time con- suming in tree construction and traversing, then the performance can be improved. In this paper, an improved algo- rithm, SFP-growth, is presented. The algorithm adopts sorted FP-trees to store the main information of the transac- tions. It also uses an efficient sorting algorithm and other techniques in the construction of trees. The experimental result shows that SFP-growth is an efficient algorithm, it outperforms Apriori, Eclat and FP-growth algorithm.
%K Data mining
%K Association rules
%K Frequent patterns
%K Sorted FP-tree<br>数据挖掘
%K 关联规则
%K 频繁模式
%K 排序FP-树
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=4C8A4044CDEF3FEF&yid=2DD7160C83D0ACED&vid=9971A5E270697F23&iid=E158A972A605785F&sid=4AD960B5AD2D111A&eid=27746BCEEE58E9DC&journal_id=1002-137X&journal_name=计算机科学&referenced_num=11&reference_num=7