NECLATCLOSED: A vertical algorithm for mining frequent closed itemsets

被引：12
|
作者：
Aryabarzan, Nader [1 ,2 ]
Minaei-Bidgoli, Behrouz [3 ]
机构：
[1] Islamic Azad Univ, Dept Comp Engn, Sci & Res Branch, Tehran, Iran
[2] Islamic Azad Univ, Dept Comp Engn, Marvdasht Branch, Marvdasht, Iran
[3] Iran Univ Sci & Technol, Sch Comp Engn, Tehran, Iran
来源：
EXPERT SYSTEMS WITH APPLICATIONS | 2021年 / 174卷
关键词：
Data mining; Frequent itemset; Closed itemset; Vertical; Association rule; EFFICIENT ALGORITHM; PATTERNS;
D O I：
10.1016/j.eswa.2021.114738
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Frequent closed itemsets provide a lossless and concise collection of all frequent itemsets to reduce the runtime and memory requirement of frequent itemsets mining tasks. This study presents an algorithm named NECLAT-CLOSED for fast mining of frequent closed itemsets. We introduce concepts and techniques based on the vertical database format and employ them in the mining process. The experimental results show that NECLATCLOSED outperforms the leading algorithms in terms of runtime and memory usage, especially runtime, in most cases.
引用
收藏
页数：11
相关论文
共 50 条
  • [21] Mining Frequent Weighted Closed Itemsets
    Bay Vo
    Nhu-Y Tran
    Duong-Ha Ngo
    ADVANCED COMPUTATIONAL METHODS FOR KNOWLEDGE ENGINEERING, 2013, 479 : 379 - 390
  • [22] Mining Frequent and Homogeneous Closed Itemsets
    Hilali, Ines
    Jen, Tao-Yuan
    Laurent, Dominique
    Marinica, Claudia
    Ben Yahia, Sadok
    INFORMATION SEARCH, INTEGRATION AND PERSONALIZATION, ISIP 2014, 2016, 497 : 51 - 65
  • [23] An Algorithm for Mining Frequent Itemsets
    Hernandez Leon, Raudel
    Perez Suarez, Airel
    Feregrino Uribe, Claudia
    Guzman Zavaleta, Zobeida Jezabel
    2008 5TH INTERNATIONAL CONFERENCE ON ELECTRICAL ENGINEERING, COMPUTING SCIENCE AND AUTOMATIC CONTROL (CCE 2008), 2008, : 236 - +
  • [24] Mining frequent closed itemsets with the frequent pattern list
    Tseng, FC
    Hsu, CC
    Chen, H
    2001 IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2001, : 653 - 654
  • [25] A New Algorithm for Mining Frequent Closed Itemsets from Data Streams
    Mao, Guojun
    Yang, Xialing
    Wu, Xindong
    2008 7TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-23, 2008, : 154 - +
  • [26] An Efficient Algorithm for Mining Frequent Closed Itemsets over Data Stream
    Li Guodong
    Xia Kewen
    NEW TRENDS IN MECHATRONICS AND MATERIALS ENGINEERING, 2012, 151 : 570 - 575
  • [27] An algorithm for mining frequent closed itemsets with density from data streams
    Caiyan D.
    Ling C.
    Caiyan, Dai (daicaiyan@gmail.com), 1600, Inderscience Enterprises Ltd., 29, route de Pre-Bois, Case Postale 856, CH-1215 Geneva 15, CH-1215, Switzerland (12): : 146 - 154
  • [28] Cherry: An algorithm for mining frequent closed itemsets without subset checking
    Tao, Li-Min
    Huang, Lin-Peng
    Ruan Jian Xue Bao/Journal of Software, 2008, 19 (02): : 379 - 388
  • [29] An Efficient Frequent Closed Itemsets Mining Algorithm Over Data Streams
    Tan, Jun
    Bu, Yingyong
    Yang, Bo
    2009 INTERNATIONAL CONFERENCE ON INFORMATION MANAGEMENT, INNOVATION MANAGEMENT AND INDUSTRIAL ENGINEERING, VOL 3, PROCEEDINGS, 2009, : 65 - +
  • [30] An Efficient Frequent Closed Itemsets Mining Algorithm Over Data Streams
    Tan, Jun
    Yu, Shao-jun
    2011 SECOND INTERNATIONAL CONFERENCE ON INFORMATION, COMMUNICATION AND EDUCATION APPLICATION (ICEA 2011), 2011, : 197 - 201
12345