Comparative Analysis of Frequent Pattern Mining for Large Data Using FP-Tree and CP-Tree Methods

被引：0
|
作者：
Annapoorna, V. [1 ]
Murty, M. Rama Krishna [1 ]
Priyanka, J. S. V. S. Hari [1 ]
Chittineni, Suresh [1 ]
机构：
[1] ANITS, Visakhapatnam, Andhra Pradesh, India
来源：
INFORMATION AND DECISION SCIENCES | 2018年 / 701卷
关键词：
Knowledge discovery; Frequent pattern; Compact pattern tree; ALGORITHM;
D O I：
10.1007/978-981-10-7563-6_7
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Association rule mining plays a crucial role in many of the business organizations like retail, telecommunications, manufacturing, insurance, banking, etc., to identify association among different objects in the dataset. In the process of rule mining, identify frequent patterns, which can help to improve the business decisions. FP-growth and CP-tree are the well-known algorithms to find the frequent patterns. This work performs comparative analysis of FP-growth and CP (compact pattern)-tree based on time and space complexity parameters. The comparative analysis also focuses on scalability parameter with various benchmark dataset sizes. Outcomes of this work help others to choose the algorithm to implement in their application.
引用
收藏
页码：59 / 67
页数：9
相关论文
共 50 条
  • [31] ADMiner: An incremental data mining approach using a compressed FP-tree
    Yang, D.-L. (dlyang.tw@gmail.com), 1600, Academy Publisher (08):
  • [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] 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
  • [34] 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
  • [35] Mining frequent itemsets with positive and negative items based on FP-tree
    College of Computer Science, Chongqing University, Chongqing 400030, China
    不详
    不详
    Moshi Shibie yu Rengong Zhineng, 2008, 2 (246-253):
  • [36] 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 - +
  • [37] 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
  • [38] Fast Mining Maximal Frequent Itemsets Based On Sorted FP-Tree
    Yang, Junrui
    Guo, Yunkai
    Liu, Nanyan
    2008 7TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-23, 2008, : 5391 - 5395
  • [39] Tidset-based parallel FP-tree algorithm for the frequent pattern mining problem on PC clusters
    Zhou, Jiayi
    Yu, Kun-Ming
    ADVANCES IN GRID AND PERVASIVE COMPUTING, PROCEEDINGS, 2008, 5036 : 18 - 28
  • [40] Dynamic FP-Tree based mining of frequent patterns satisfying succinct constraints
    Leung, CKS
    CONSTRAINT DATABASES, PROCEEDINGS, 2004, 3074 : 112 - 127
12345