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 条
  • [1] Frequent Itemset Mining on Hadoop
    Ferenc Kovacs
    Illes, Janos
    [J]. IEEE 9TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL CYBERNETICS (ICCC 2013), 2013, : 241 - 245
  • [2] On A Visual Frequent Itemset Mining
    Lim, SeungJin
    [J]. 2009 FOURTH INTERNATIONAL CONFERENCE ON DIGITAL INFORMATION MANAGEMENT, 2009, : 25 - 30
  • [3] Mining φ-Frequent Itemset Using FP-Tree
    李天瑞
    [J]. Railway Engineering Science, 2001, (01) : 67 - 74
  • [4] Parallel frequent itemset mining using systolic arrays
    Sohrabi, Mohammad Karim
    Barforoush, Ahmad Abdollahzadeh
    [J]. KNOWLEDGE-BASED SYSTEMS, 2013, 37 : 462 - 471
  • [5] Efficiently Using Matrix in Mining Maximum Frequent Itemset
    Liu Zhen-yu
    Xu Wei-xiang
    Liu Xumin
    [J]. THIRD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING: WKDD 2010, PROCEEDINGS, 2010, : 50 - 54
  • [6] Recommendation using Frequent Itemset Mining in Big Data
    Kunjachan, Honeytta
    Hareesh, M. J.
    Sreedevi, K. M.
    [J]. PROCEEDINGS OF THE 2018 SECOND INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING AND CONTROL SYSTEMS (ICICCS), 2018, : 561 - 566
  • [7] A Survey Paper on Frequent Itemset Mining
    Sastry, J. S. V. R. S.
    Suresh, V
    [J]. INTERNATIONAL CONFERENCE ON COMPUTER VISION AND MACHINE LEARNING, 2019, 1228
  • [8] Frequent Itemset Mining in Multirelational Databases
    Jimenez, Aida
    Berzal, Fernando
    Cubero, Juan-Carlos
    [J]. FOUNDATIONS OF INTELLIGENT SYSTEMS, PROCEEDINGS, 2009, 5722 : 15 - 24
  • [9] Verified Programs for Frequent Itemset Mining
    Loulergue, Frederic
    Whitney, Christopher D.
    [J]. 2018 IEEE SMARTWORLD, UBIQUITOUS INTELLIGENCE & COMPUTING, ADVANCED & TRUSTED COMPUTING, SCALABLE COMPUTING & COMMUNICATIONS, CLOUD & BIG DATA COMPUTING, INTERNET OF PEOPLE AND SMART CITY INNOVATION (SMARTWORLD/SCALCOM/UIC/ATC/CBDCOM/IOP/SCI), 2018, : 1516 - 1523
  • [10] A primer to frequent itemset mining for bioinformatics
    Naulaerts, Stefan
    Meysman, Pieter
    Bittremieux, Wout
    Trung Nghia Vu
    Vanden Berghe, Wim
    Goethals, Bart
    Laukens, Kris
    [J]. BRIEFINGS IN BIOINFORMATICS, 2015, 16 (02) : 216 - 231