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 条
  • [1] An Algorithm of Mining Closed Frequent Itemsets
    Li, Haifeng
    PROCEEDINGS OF THE 2015 5TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCES AND AUTOMATION ENGINEERING, 2016, 42 : 95 - 98
  • [2] An Algorithm for Mining Frequent Closed Itemsets
    Zhang Tiejun
    Yang Junrui
    Wang Xiuqin
    2008 3RD INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEM AND KNOWLEDGE ENGINEERING, VOLS 1 AND 2, 2008, : 240 - +
  • [3] Research on an algorithm for mining frequent closed itemsets
    Zhu, Yuquan
    Song, Yuqing
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2007, 44 (07): : 1177 - 1183
  • [4] An efficient algorithm for mining frequent closed itemsets
    Fang, Gang
    Wu, Yue
    Li, Ming
    Chen, Jia
    Informatica (Slovenia), 2015, 39 (01): : 87 - 98
  • [5] An Efficient Algorithm for Mining Frequent Closed Itemsets
    Fang, Gang
    Wu, Yue
    Li, Ming
    Chen, Jia
    INFORMATICA-JOURNAL OF COMPUTING AND INFORMATICS, 2015, 39 (01): : 87 - 98
  • [6] Improved algorithm for mining frequent closed itemsets
    Song, Wei
    Yang, Bingru
    Xu, Zhangyan
    Gao, Jing
    2008, Science Press, 18,Shuangqing Street,Haidian, Beijing, 100085, China (45):
  • [7] New algorithm of mining frequent closed itemsets
    School of Computer and Information Technology, Liaoning Normal University, Dalian 116029, China
    J. Southeast Univ. Engl. Ed., 2008, 3 (335-338):
  • [8] An efficient algorithm for incrementally mining frequent closed itemsets
    Show-Jane Yen
    Yue-Shi Lee
    Chiu-Kuang Wang
    Applied Intelligence, 2014, 40 : 649 - 668
  • [9] An Optimization to CHARM Algorithm for Mining Frequent Closed Itemsets
    Ye, Xin
    Wei, Feng
    Jiang, Fan
    Cheng, Shaoyin
    CIT/IUCC/DASC/PICOM 2015 IEEE INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY - UBIQUITOUS COMPUTING AND COMMUNICATIONS - DEPENDABLE, AUTONOMIC AND SECURE COMPUTING - PERVASIVE INTELLIGENCE AND COMPUTING, 2015, : 226 - 235
  • [10] An efficient algorithm for incrementally mining frequent closed itemsets
    Yen, Show-Jane
    Lee, Yue-Shi
    Wang, Chiu-Kuang
    APPLIED INTELLIGENCE, 2014, 40 (04) : 649 - 668
12345