An Efficient Frequent Patterns Mining Algorithm based on Apriori Algorithm and the FP-tree Structure

被引：14
|
作者：
Wu, Bo [1 ]
Zhang, Defu [2 ]
Lan, Qihua [2 ]
Zheng, Jiemin [2 ]
机构：
[1] Xiamen Univ, Dept Comp Sci, Xiamen 361005, Peoples R China
[2] Longtop Grp Post Doctoral Res, Xiamen 361005, Peoples R China
来源：
THIRD 2008 INTERNATIONAL CONFERENCE ON CONVERGENCE AND HYBRID INFORMATION TECHNOLOGY, VOL 1, PROCEEDINGS | 2008年
关键词：
D O I：
10.1109/ICCIT.2008.109
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Association rule mining is to find association relationships among large data sets. Mining frequent patterns is an important aspect in association rule mining. In this paper, an efficient algorithm named Apriori-Growth based on Apriori algorithm and the FP-tree structure is presented to mine frequent patterns. The advantage of the Apriori-Growth algorithm is that it doesn't need to generate conditional pattern bases and sub- conditional pattern tree recursively. Computational results show the Apriori-Growth algorithm performs faster than Apriori algorithm, and it is almost as fast as FP-Growth, but it needs smaller memory.
引用
收藏
页码：1099 / +
页数：2
相关论文
共 50 条
  • [1] A New Algorithm For Frequent Itemsets Mining Based On Apriori And FP-Tree
    Lan, Qihua
    Zhang, Defu
    Wu, Bo
    PROCEEDINGS OF THE 2009 WRI GLOBAL CONGRESS ON INTELLIGENT SYSTEMS, VOL II, 2009, : 360 - 364
  • [2] 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
  • [3] An Improved FP-tree Algorithm for Mining Maximal Frequent Patterns
    Pan Zhaopeng
    Liu Peiyu
    Yi Jing
    2018 10TH INTERNATIONAL CONFERENCE ON MEASURING TECHNOLOGY AND MECHATRONICS AUTOMATION (ICMTMA), 2018, : 309 - 312
  • [4] The Mining Algorithm of Frequent Itemsets based on Mapreduce and FP-tree
    He, Bo
    Zhang, Hongyuan
    Pei, Jianhui
    2017 INTERNATIONAL CONFERENCE ON COMPUTER NETWORK, ELECTRONIC AND AUTOMATION (ICCNEA), 2017, : 108 - 111
  • [5] A new FP-Tree algorithm for mining frequent itemsets
    Li, YC
    Chang, CC
    CONTENT COMPUTING, PROCEEDINGS, 2004, 3309 : 266 - 277
  • [6] An improved algorithm for mining maximal frequent itemsets based on FP-tree
    Chen TongQing
    Ye FeiYue
    Ge XiCong
    Liu Qi
    2018 17TH INTERNATIONAL SYMPOSIUM ON DISTRIBUTED COMPUTING AND APPLICATIONS FOR BUSINESS ENGINEERING AND SCIENCE (DCABES), 2018, : 225 - 228
  • [7] FREQUENT ITEMSETS MINING ALGORITHM BASED ON DIFFERENTIAL PRIVACY AND FP-TREE
    Ding Zhe
    Wu Chunwang
    Zhao Jun
    Li Binyong
    2020 17TH INTERNATIONAL COMPUTER CONFERENCE ON WAVELET ACTIVE MEDIA TECHNOLOGY AND INFORMATION PROCESSING (ICCWAMTIP), 2020, : 271 - 274
  • [8] SFP-max - A sorted FP-tree based algorithm for maximal frequent patterns mining
    2005, Science Press, Beijing, China (42):
  • [9] Mining frequent patterns based on compressed FP-tree without conditional FP-tree generation
    Chen, Fei
    Shang, Lin
    Li, Ming
    Chen, Zhao-qian
    Chen, Shi-fu
    2006 IEEE INTERNATIONAL CONFERENCE ON GRANULAR COMPUTING, 2006, : 478 - +
  • [10] EFP-tree: an efficient FP-tree for incremental mining of frequent patterns
    Davashi, Razieh
    Nadimi-Shahraki, Mohammad-Hossein
    INTERNATIONAL JOURNAL OF DATA MINING MODELLING AND MANAGEMENT, 2019, 11 (02) : 144 - 166
12345