%0 Journal Article
%T Research on Fast Association Rule Mining Algorithm<br>快速关联规则挖掘算法研究
%A GAO Jun
%A SHI Bai-Le Dept of Computer Science
%A <br>高俊
%A 施伯乐
%J 计算机科学
%D 2005
%I 
%X Based on fully analyzing the FP__growth, an association rule mining algorithm, this paper present a new as- sociation rule mining algorithm called MFP. The MFP algorithm can convert a transaction database into a MFP tree through scanning the database only once, and then do the mining of the tree.
%K Association rule mining
%K FP-growth algorithm
%K MFP algorithm<br>快速关联规则
%K FP-growth关联规则
%K 挖掘算法
%K MFP算法
%K 数据库
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=F77D7E58656548E5&yid=2DD7160C83D0ACED&vid=9971A5E270697F23&iid=38B194292C032A66&sid=1E41DF9426604740&eid=BC084ACE66B62CC8&journal_id=1002-137X&journal_name=计算机科学&referenced_num=6&reference_num=8