%0 Journal Article
%T Efficiently Mining of Maximal Frequent Item Sets Based on FP-Tree<br>基于FP-Tree有效挖掘最大频繁项集
%A YAN Yue-Jin
%A LI Zhou-Jun
%A CHEN Huo-Wang
%A <br>颜跃进
%A 李舟军
%A 陈火旺
%J 软件学报
%D 2005
%I 
%X During the process of mining maximal frequent item sets, when minimum support is little, superset checking is a kind of time-consuming and frequent operation in the mining algorithm. In this paper, a new algorithm FPMFI (frequent pattern tree for maximal frequent item sets) for mining maximal frequent item sets is proposed. It adopts a new superset checking method based on projection of the maximal frequent item sets, which efficiently reduces the cost of superset checking. In addition, FPMFI also compresses the conditional FP-Tree (frequent pattern tree) greatly by deleting the redundant information, which can reduce the cost of accessing the tree. It is proved by theoretical analysis that FPMFI has superiority and it is revealed by experimental comparison that the performance of FPMFI is superior to that of the similar algorithm based on FP-Tree more than one time.
%K maximal frequent item set
%K frequent pattern tree
%K superset check
%K maximal frequent item sets projection<br>最大频繁项集
%K 频繁模式树
%K 超集检测
%K 最大频繁项集投影
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=0A0E5D111FCD6088&yid=2DD7160C83D0ACED&vid=7801E6FC5AE9020C&iid=0B39A22176CE99FB&sid=1B64850025D0BBBE&eid=8B59EA573021D671&journal_id=1000-9825&journal_name=软件学报&referenced_num=35&reference_num=16