Frequent itemset mining using cellular learning automata

被引:32
|
作者
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
相关论文
共 50 条
  • [41] A Review of Scalable Approaches for Frequent Itemset Mining
    Apiletti, Daniele
    Garza, Paolo
    Pulvirenti, Fabio
    [J]. NEW TRENDS IN DATABASES AND INFORMATION SYSTEMS (ADBIS 2015), 2015, 539 : 243 - 247
  • [42] The Choice of Optimal Algorithm for Frequent Itemset Mining
    Busarov, Vyacheslav
    Grafeeva, Natalia
    Mikhailova, Elena
    [J]. DATABASES AND INFORMATION SYSTEMS IX, 2016, 291 : 211 - 224
  • [43] Frequent Itemset Mining Techniques - A Technical Review
    Chaure, Tushar M.
    Singh, Kavita R.
    [J]. 2016 WORLD CONFERENCE ON FUTURISTIC TRENDS IN RESEARCH AND INNOVATION FOR SOCIAL WELFARE (STARTUP CONCLAVE), 2016,
  • [44] Parallel Analytical Model for Frequent Itemset Mining
    Poorva, K.
    Anushree, H. K.
    Mahesha, K., V
    Pavithra, T. R.
    Vinutha, D. C.
    Chandini, S. B.
    [J]. 2017 INTERNATIONAL CONFERENCE ON CURRENT TRENDS IN COMPUTER, ELECTRICAL, ELECTRONICS AND COMMUNICATION (CTCEEC), 2017, : 517 - 519
  • [45] PrivBasis: Frequent Itemset Mining with Differential Privacy
    Li, Ninghui
    Qardaji, Wahbeh
    Su, Dong
    Cao, Jianneng
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2012, 5 (11): : 1340 - 1351
  • [46] An Audit Environment for Outsourcing of Frequent Itemset Mining
    Wong, W. K.
    Cheung, David W.
    Hung, Edward
    Kao, Ben
    Mamoulis, Nikes
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2009, 2 (01): : 1162 - 1172
  • [47] Private Frequent Itemset Mining in the Local Setting
    Fu, Hang
    Yang, Wei
    Huang, Liusheng
    [J]. WIRELESS ALGORITHMS, SYSTEMS, AND APPLICATIONS, WASA 2021, PT II, 2021, 12938 : 338 - 350
  • [48] Revised ECLAT Algorithm for Frequent Itemset Mining
    Suvalka, Bharati
    Khandelwal, Sarika
    Patel, Chintal
    [J]. INFORMATION SYSTEMS DESIGN AND INTELLIGENT APPLICATIONS, VOL 2, INDIA 2016, 2016, 434 : 219 - 226
  • [49] Pushing convertible constraints in frequent itemset mining
    Pei, J
    Han, JW
    Lakshmanan, LVS
    [J]. DATA MINING AND KNOWLEDGE DISCOVERY, 2004, 8 (03) : 227 - 252
  • [50] A Federated Learning Approach to Frequent Itemset Mining in Cyber-Physical Systems
    Ahmed, Usman
    Srivastava, Gautam
    Lin, Jerry Chun-Wei
    [J]. JOURNAL OF NETWORK AND SYSTEMS MANAGEMENT, 2021, 29 (04)