Frequent itemset mining using cellular learning automata

被引:34
作者
Sohrabi, Mohammad Karim [1 ]
Roshani, Reza [1 ]
机构
[1] Islamic Azad Univ, Semnan Branch, Dept Comp Engn, Semnan, Iran
关键词
Frequent itemset mining; Cellular automata; Data mining; Association rules; Parallel frequent itemset mining; ALGORITHM;
D O I
10.1016/j.chb.2016.11.036
中图分类号
B84 [心理学];
学科分类号
04 ; 0402 ;
摘要
A core issue of the association rule extracting process in the data mining field is to find the frequent patterns in the database of operational transactions. If these patterns discovered, the decision making process and determining strategies in organizations will be accomplished with greater precision. Frequent pattern is a pattern seen in a significant number of transactions. Due to the properties of these data models which are unlimited and high-speed production, these data could not be stored in memory and for this reason it is necessary to develop techniques that enable them to be processed online and find repetitive patterns. Several mining methods have been proposed in the literature which attempt to efficiently extract a complete or a closed set of different types of frequent patterns from a dataset. In this paper, a method underpinned upon Cellular Learning Automata (CIA) is presented for mining frequent itemsets. The proposed method is compared with Apriori, FP-Growth and BitTable methods and it is ultimately concluded that the frequent itemset mining could be achieved in less running time. The experiments are conducted on several experimental data sets with different amounts of minsup for all the algorithms as well as the presented method individually. Eventually the results prod to the effectiveness of the proposed method. (C) 2016 Elsevier Ltd. All rights reserved.
引用
收藏
页码:244 / 253
页数:10
相关论文
共 27 条
[1]  
Agarwal R., 1993, P ACM SIGMOD INT C M
[2]   A tree projection algorithm for generation of frequent item sets [J].
Agarwal, RC ;
Aggarwal, CC ;
Prasad, VVV .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2001, 61 (03) :350-371
[3]  
Brin S., 1997, ACMSIGMOD INT C MAN
[4]  
CHEUNG DW, 1996, P INT C DAT ENG NEW
[5]   BitTableFI: An efficient mining frequent itemsets algorithm [J].
Dong, Jie ;
Han, Min .
KNOWLEDGE-BASED SYSTEMS, 2007, 20 (04) :329-335
[6]  
Esnaashari M., 2007, P 15 C EL ENG 15 ICE
[7]  
FathiNavid A. H., 2012, P 51 INT FITCE FED T
[8]  
Grahne G., 2003, FIMI
[9]  
Han JW, 2000, SIGMOD RECORD, V29, P1
[10]   Discovering valuable frequent patterns based on RFM analysis without customer identification information [J].
Hu, Ya-Han ;
Yeh, Tzu-Wei .
KNOWLEDGE-BASED SYSTEMS, 2014, 61 :76-88