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
相关论文
共 23 条