%0 Journal Article
%T A Tree-Based Frequent Pattern Mining Algorithm<br>一种基于树的频繁模式挖掘算法
%A LIU Jun
%A |qiang
%A {
%A }
%A PAN Yun
%A |he
%A <br>刘君强
%A 潘云鹤
%J 系统工程理论与实践
%D 2003
%I 
%X A tree\|based algorithm for mining of frequent patterns, TBA\|FP, is proposed in this paper. The term, tree\|based, has two meanings. First, a tree\|based representation is used to compress the pattern information in the database. Second, the mining process is regarded as a process of constructing a frequent pattern tree in depth first order. Optimizing techniques, such as pseudo clipping, is discussed. Experiments show that TBA\|FP is much more efficient and scalable than the classical algorithm, Apriori.
%K frequent patterns
%K data mining
%K very large databases<br>频繁模式
%K 数据挖掘
%K 海量数据库
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=01BA20E8BA813E1908F3698710BBFEFEE816345F465FEBA5&cid=962324E222C1AC1D&jid=1D057D9E7CAD6BEE9FA97306E08E48D3&aid=AF18BDEE5C90759B&yid=D43C4A19B2EE3C0A&vid=EA389574707BDED3&iid=94C357A881DFC066&sid=6270DC1B5693DDAF&eid=4BB057F167CF3A60&journal_id=1000-6788&journal_name=系统工程理论与实践&referenced_num=4&reference_num=9