%0 Journal Article
%T A new algorithm for mining maximal frequent itemsets
一种新的最大频繁项目集挖掘算法
%A MA Li-sheng
%A DENG Hui-wen
%A QI Yi
%A
马丽生
%A 邓辉文
%A 齐逸
%J 计算机应用
%D 2006
%I
%X Maximal frequent itemsets mining was one of the most important basic problems for itemset mining. Based on the analysis of the existing algorithms, a new algorithm for maximal frequent itemsets mining was presented. Comparative experiments show that the new algorithm outperforms the current algorithms such as MAximal Frequent Itemset Algorithm for transactional database (MAFIA).
%K data mining
%K maximal frequent itemsets
%K association roles
数据挖掘
%K 最大频繁项目集
%K 关联规则
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=B70EEDBCA0CB6D65&yid=37904DC365DD7266&vid=96C778EE049EE47D&iid=708DD6B15D2464E8&sid=9389FC0666CA3EC2&eid=F575EA6B7F46096C&journal_id=1001-9081&journal_name=计算机应用&referenced_num=5&reference_num=11