A two-way hybrid algorithm for maximal frequent itemsets mining

被引：1
|
作者：
Chen, Fu-zan [1 ]
Li, Min-qiang [1 ]
机构：
[1] Tianjin Univ, Sch Management, Tianjin 300072, Peoples R China
来源：
FOURTH INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, VOL 3, PROCEEDINGS | 2007年
关键词：
D O I：
10.1109/FSKD.2007.130
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
A new two-way-hybrid algorithm for mining maximal frequent itemsets is proposed. A flexible two-way-hybrid search method is given. The two-way-hybrid search begins the mining procedure in both the top-down and bottom-up directions at the same time. Moreover, information gathered in the bottom-up can be used to prune the search space in the other top-down direction. Some efficient decomposition and pruning strategies are implied in this method, which can reduce the original search space rapidly in the iterations. Experimental and analytical results are presented in the end.
引用
收藏
页码：499 / 503
页数：5
相关论文
共 50 条
  • [1] Fast algorithm for mining maximal frequent itemsets
    Ma, Lisheng
    Deng, Huiwen
    [J]. PROCEEDINGS OF THE FIRST INTERNATIONAL SYMPOSIUM ON DATA, PRIVACY, AND E-COMMERCE, 2007, : 86 - +
  • [2] Scalable algorithm for mining maximal frequent itemsets
    Li, QH
    Wang, H
    He, Y
    Jiang, SY
    [J]. 2003 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-5, PROCEEDINGS, 2003, : 143 - 146
  • [3] MMFI: An effective algorithm for mining maximal frequent itemsets
    Ju, Shiguang
    Chen, Chen
    [J]. 2008 INTERNATIONAL SYMPOSIUM ON INFORMATION PROCESSING AND 2008 INTERNATIONAL PACIFIC WORKSHOP ON WEB MINING AND WEB-BASED APPLICATION, 2008, : 144 - 148
  • [4] GenMax: An Efficient Algorithm for Mining Maximal Frequent Itemsets
    Karam Gouda
    Mohammed J. Zaki
    [J]. Data Mining and Knowledge Discovery, 2005, 11 : 223 - 242
  • [5] GenMax: An efficient algorithm for mining maximal frequent itemsets
    Gouda, K
    Zaki, MJ
    [J]. DATA MINING AND KNOWLEDGE DISCOVERY, 2005, 11 (03) : 223 - 242
  • [6] A graph-based algorithm for mining maximal frequent itemsets
    Liu, Bo
    Pan, Jiuhui
    [J]. FOURTH INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, VOL 3, PROCEEDINGS, 2007, : 263 - 267
  • [7] A Maximal Frequent Itemsets Mining Algorithm Based on Adjacency Table
    Yin Ming
    Wang Wenjie
    Zhang Xuanyu
    Jiang Jijiao
    [J]. JOURNAL OF ELECTRONICS & INFORMATION TECHNOLOGY, 2019, 41 (08) : 2009 - 2016
  • [8] An algorithm for mining maximal frequent itemsets without candidate generation
    Li Haiwen
    Yang Li
    Hong De
    [J]. 2011 INTERNATIONAL CONFERENCE ON COMPUTER, ELECTRICAL, AND SYSTEMS SCIENCES, AND ENGINEERING (CESSE 2011), 2011, : 330 - 333
  • [9] An efficient maximal frequent itemsets mining algorithm - Based on frequent pattern tree
    Xue, XR
    Wang, GY
    Wu, Y
    Yang, SX
    [J]. DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 2005, 1 : 176 - 181
  • [10] Efficiently mining maximal frequent itemsets
    Gouda, K
    Zaki, MJ
    [J]. 2001 IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2001, : 163 - 170
12345