Dynamic FP-Tree Pruning for Concurrent Frequent Itemsets Mining

被引：0
|
作者：
Song, Wei [1 ]
Liu, Wenbo [1 ]
Li, Jinhong [1 ]
机构：
[1] N China Univ Technol, Coll Informat Engn, Beijing 100144, Peoples R China
来源：
COMPUTATIONAL INTELLIGENCE AND INTELLIGENT SYSTEMS | 2012年 / 316卷
关键词：
Data Mining; Frequent Itemset; FP-Tree; Concurrency;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
To solve the problem of huge memory usage of FP-tree construction and traversal in FP-growth, Dynamic-prune, which is a concurrent frequent itemsets mining algorithm based on FP-tree is proposed. On the one hand, by recording the change of support counts of frequent items during the process of FP-tree construction, dynamic FP-tree pruning is implemented. And the rationality is discussed. On the other hand, by using the concurrency strategy, the construction of FP-tree and the discovery of frequent itemsets can be realized simultaneously. Compared with FP-growth, it is not necessary to mine frequent itemsets after the construction of the whole FP-tree in Dynamic-prune. Experimental results show Dynamic-prune is efficient and scalable.
引用
收藏
页码：111 / 120
页数：10
相关论文
共 50 条
  • [31] Fast Updating Maximal Frequent Itemsets Based On Full Merged Sorted FP-Tree
    Guo Yunkai
    Yang Junrui
    Huang Yulei
    2008 4TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-31, 2008, : 11444 - 11447
  • [32] Improved algorithm for mining maximum frequent patterns based on FP-Tree
    Liu, Naili
    Ma, Lei
    PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION APPLICATIONS (ICCIA 2012), 2012, : 833 - 836
  • [33] Mining weighted frequent patterns based on an improved weighted FP-tree
    Wang, Yan
    Xue, Haiyan
    Journal of Information and Computational Science, 2010, 7 (02): : 527 - 533
  • [34] Mining maximal frequent patterns based on improved FP-tree in database
    Liu Wenzhou
    Hao Xinghai
    Meng Xiangping
    Wang Huajin
    3RD INT CONF ON CYBERNETICS AND INFORMATION TECHNOLOGIES, SYSTEMS, AND APPLICAT/4TH INT CONF ON COMPUTING, COMMUNICATIONS AND CONTROL TECHNOLOGIES, VOL 2, 2006, : 297 - +
  • [35] A Skipping FP-tree for Incrementally Intersecting Closed Itemsets in On-Line Stream Mining
    Nishina, Takumi
    Iwanuma, Koji
    Yamamoto, Yoshitaka
    2019 IEEE INTERNATIONAL CONFERENCE ON BIG DATA AND SMART COMPUTING (BIGCOMP), 2019, : 127 - 130
  • [36] Modified FP-Growth: An Efficient Frequent Pattern Mining Approach from FP-Tree
    Ahmed, Shafiul Alom
    Nath, Bhabesh
    PATTERN RECOGNITION AND MACHINE INTELLIGENCE, PREMI 2019, PT I, 2019, 11941 : 47 - 55
  • [37] Building FP-Tree on the Fly: Single-Pass Frequent Itemset Mining
    Shahbazi, Nima
    Soltani, Rohollah
    Gryz, Jarek
    An, Aijun
    MACHINE LEARNING AND DATA MINING IN PATTERN RECOGNITION (MLDM 2016), 2016, 9729 : 387 - 400
  • [38] An Efficient Frequent Patterns Mining Algorithm based on Apriori Algorithm and the FP-tree Structure
    Wu, Bo
    Zhang, Defu
    Lan, Qihua
    Zheng, Jiemin
    THIRD 2008 INTERNATIONAL CONFERENCE ON CONVERGENCE AND HYBRID INFORMATION TECHNOLOGY, VOL 1, PROCEEDINGS, 2008, : 1099 - +
  • [39] Parallelization of Frequent Itemset Mining Methods with FP-tree: An Experiment with PrePost+ Algorithm
    Jamsheela, Olakara
    Gopalakrishna, Raju
    INTERNATIONAL ARAB JOURNAL OF INFORMATION TECHNOLOGY, 2021, 18 (02) : 208 - 213
  • [40] CONCURRENT FREQUENT ITEMSETS MINING IN A SHARED PREFIX TREE USING THE APRIORI ALGORITHM
    Puscian, Marek
    PHOTONICS APPLICATIONS IN ASTRONOMY, COMMUNICATIONS, INDUSTRY, AND HIGH-ENERGY PHYSICS EXPERIMENTS 2018, 2018, 10808
12345