Mining Frequent Itemsets in Association Rule Mining Using Improved SETM Algorithm

被引：2
|
作者：
Hanirex, D. Kerana [1 ]
Kaliyamurthie, K. P. [1 ]
机构：
[1] Bharath Univ, Dept Comp Sci & Engn, Madras, Tamil Nadu, India
来源：
ARTIFICIAL INTELLIGENCE AND EVOLUTIONARY COMPUTATIONS IN ENGINEERING SYSTEMS, ICAIECES 2015 | 2016年 / 394卷
关键词：
D O I：
10.1007/978-81-322-2656-7_70
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
The Association rule mining is one of the recent data mining research. Mining frequent itemsets in relational databases using relational queries give great attention to researchers nowadays. This paper implements modified set oriented algorithm for mining frequent itemsets in relational databases. In this paper, the sort and merge scan algorithm SETM (Houtsma and Swami, IEEE 25-33 (1995)) [1] is implemented for super market data set which is further improved by integrating transaction reduction technique. Our proposed algorithm Improved SETM (ISETM) generate the frequent itemsets from the database and find its execution time. Finally the performance of the algorithm is compared with the traditional Apriori and SETM algorithm.
引用
收藏
页码：765 / 773
页数：9
相关论文
共 50 条
  • [41] A fast parallel algorithm for frequent itemsets mining
    Souliou, Dora
    Pagourtzis, Aris
    Tsanakas, Panayiotis
    [J]. ARTIFICIAL INTELLIGENCE AND INNOVATIONS 2007: FROM THEORY TO APPLICATIONS, 2007, : 213 - +
  • [42] New algorithm of mining frequent closed itemsets
    School of Computer and Information Technology, Liaoning Normal University, Dalian 116029, China
    [J]. J. Southeast Univ. Engl. Ed., 2008, 3 (335-338):
  • [43] MapReduce Frequent Itemsets for Mining Association Rules
    Al-Hamodi, Arkan A. G.
    Lu, Song-feng
    [J]. 2016 INTERNATIONAL CONFERENCE ON INFORMATION SYSTEM AND ARTIFICIAL INTELLIGENCE (ISAI 2016), 2016, : 281 - 284
  • [44] Text mining: Extraction of interesting association rule with frequent itemsets mining for Korean language from unstructured data
    Department of computer Engineering, INU , Incheon, Korea, Republic of
    [J]. Int. J. Multimedia Ubiquitous Eng., 11 (11-20):
  • [45] Set Representation for Itemsets in Association Rule Mining
    Kharkongor, Carynthia
    Nath, B.
    [J]. PROCEEDINGS OF THE 2018 SECOND INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING AND CONTROL SYSTEMS (ICICCS), 2018, : 1327 - 1331
  • [46] A Survey on Representation for Itemsets in Association Rule Mining
    Kharkongor, Carynthia
    Nath, Bhabesh
    [J]. ADVANCED COMPUTING AND INTELLIGENT ENGINEERING, 2020, 1082 : 163 - 178
  • [47] Generalized closed itemsets for association rule mining
    Pudi, V
    Haritsa, JR
    [J]. 19TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS, 2003, : 714 - 716
  • [48] An improved algorithm for mining maximal frequent itemsets based on FP-tree
    Chen TongQing
    Ye FeiYue
    Ge XiCong
    Liu Qi
    [J]. 2018 17TH INTERNATIONAL SYMPOSIUM ON DISTRIBUTED COMPUTING AND APPLICATIONS FOR BUSINESS ENGINEERING AND SCIENCE (DCABES), 2018, : 225 - 228
  • [49] Improved algorithm for parallel mining collaborative frequent itemsets in multiple data streams
    Fang’ai Liu
    Qianqian Wang
    Xin Wang
    [J]. Cluster Computing, 2019, 22 : 6133 - 6141
  • [50] Improved algorithm for parallel mining collaborative frequent itemsets in multiple data streams
    Liu, Fang'ai
    Wang, Qianqian
    Wang, Xin
    [J]. CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2019, 22 (Suppl 3): : S6133 - S6141
12345