Fast algorithm for mining maximal frequent itemsets

被引：2
|
作者：
Ma, Lisheng [1 ]
Deng, Huiwen [2 ]
机构：
[1] Chuzhou Univ, Dept Comp Sci & Technol, Chuzhou, Anhui, Peoples R China
[2] Southwest Univ, Res Ctr Log & Intelligence, Chongqing, Peoples R China
来源：
PROCEEDINGS OF THE FIRST INTERNATIONAL SYMPOSIUM ON DATA, PRIVACY, AND E-COMMERCE | 2007年
关键词：
D O I：
10.1109/ISDPE.2007.66
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Efficient algorithms for mining frequent itemsets are crucial for mining association rules. Most existing work focuses on mining all frequent itemsets. However since any subset of a frequent set also is frequent, it is sufficient to mine only the set of maximal frequent itemsets. In this paper, we study the performance of two existing approaches, MAFIA and FpMAX, for mining maximal frequent itemsets. We also develop an algorithm, called FMFIA. In this algorithm, we develop and integrate two techniques in order to improve the efficiency of mining maximal frequent itemsets. We also present experimental results which show that our method outperforms the existing methods MAFIA and FpMAX.
引用
收藏
页码：86 / +
页数：2
相关论文
共 50 条
  • [41] An Algorithm for Mining Frequent Closed Itemsets
    Zhang Tiejun
    Yang Junrui
    Wang Xiuqin
    2008 3RD INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEM AND KNOWLEDGE ENGINEERING, VOLS 1 AND 2, 2008, : 240 - +
  • [42] An Algorithm of Mining Closed Frequent Itemsets
    Li, Haifeng
    PROCEEDINGS OF THE 2015 5TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCES AND AUTOMATION ENGINEERING, 2016, 42 : 95 - 98
  • [43] Parallel mining of maximal frequent itemsets in PC clusters
    Veng, Vong Chan
    IMECS 2008: INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS, VOLS I AND II, 2008, : 480 - 485
  • [44] Mining maximal frequent itemsets from data streams
    Mao, Guojun
    Wu, Xindong
    Zhu, Xingquan
    Chen, Gong
    Liu, Chunnian
    JOURNAL OF INFORMATION SCIENCE, 2007, 33 (03) : 251 - 262
  • [45] A novel pruning technique for mining maximal frequent itemsets
    Ao, Fujiang
    Yan, Yuejin
    Huang, Jian
    Huang, Kedi
    FOURTH INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, VOL 3, PROCEEDINGS, 2007, : 469 - +
  • [46] Parallel mining of maximal frequent itemsets from databases
    Chung, SM
    Luo, C
    15TH IEEE INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2003, : 134 - 139
  • [47] Efficiently mining maximal frequent itemsets based on digraph
    Ren, Zhibo
    Zhang, Qiang
    Ma, Xiujuan
    FOURTH INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, VOL 2, PROCEEDINGS, 2007, : 140 - +
  • [48] Algorithm of fast discovery frequent itemsets
    Bai, Shilei
    Mao, Xuemin
    Wang, Rujing
    Xiong, Fanlun
    Moshi Shibie yu Rengong Zhineng/Pattern Recognition and Artificial Intelligence, 2003, 16 (04):
  • [49] Mining Maximal Frequent Itemsets over Sampling Databases
    Li, Haifeng
    PROCEEDINGS OF THE 2015 2ND INTERNATIONAL FORUM ON ELECTRICAL ENGINEERING AND AUTOMATION (IFEEA 2015), 2016, 54 : 28 - 31
  • [50] HASHMAX: A NEW METHOD FOR MINING MAXIMAL FREQUENT ITEMSETS
    Vanetik, Natalia
    Gudes, Ehud
    KDIR 2011: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND INFORMATION RETRIEVAL, 2011, : 140 - 145
12345