%0 Journal Article
%T A Mining Algorithm for Frequent Patterns Based on Prefix Tree<br>一种基于前缀树的频繁模式挖掘算法
%A ZHU Guang-Xi
%A Wu Wei-Min
%A RUAN You-lin
%A LIU Gan
%A <br>朱光喜
%A 吴伟民
%A 阮幼林
%A 刘干
%J 计算机科学
%D 2005
%I 
%X Mining frequent patterns is a key problem in data mining research. Although mining based on FP-Tre achieves better performance and efficiency than Apriori-like algorithms because of avoiding costly candidate genera tion, it still suffers from creating conditional FP-Tree separately and recursively during the mining process. In this pa per, we propose a new method PTM that designs a new structure called Prefix Tree, which stores all of the informa tion in a highly compact form. PTM mines frequent patterns in depth-first order and directly in Prefix Tree by adjust ing node information and node links without using any additional data structures. Thus, it can improve performanc greatly.
%K Frequent pattern
%K Frequent itemsets
%K FP-tree
%K Prefix tree<br>频繁模式
%K 频繁项集
%K FP-Tree
%K 前级树
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=738A4BAD13FF50A4&yid=2DD7160C83D0ACED&vid=9971A5E270697F23&iid=E158A972A605785F&sid=339D79302DF62549&eid=933658645952ED9F&journal_id=1002-137X&journal_name=计算机科学&referenced_num=2&reference_num=7