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
相关论文
共 64 条
[41]   Map-optimize-reduce: CAN tree assisted FP-growth algorithm for clusters based FP mining on Hadoop [J].
Ragaventhiran, J. ;
Kavithadevi, M. K. .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2020, 103 :111-122
[42]   EAFIM: efficient apriori-based frequent itemset mining algorithm on Spark for big transactional data [J].
Raj, Shashi ;
Ramesh, Dharavath ;
Sreenu, M. ;
Sethi, Krishan Kumar .
KNOWLEDGE AND INFORMATION SYSTEMS, 2020, 62 (09) :3565-3583
[43]   An effective association rule mining scheme using a new generic basis [J].
Sahoo, Jayakrushna ;
Das, Ashok Kumar ;
Goswami, A. .
KNOWLEDGE AND INFORMATION SYSTEMS, 2015, 43 (01) :127-156
[44]  
Shenoy P, 2000, SIGMOD RECORD, V29, P22, DOI 10.1145/335191.335376
[45]  
Singh N. G., 2005, 5 IEEE INT C DAT MIN 5 IEEE INT C DAT MIN, P4
[46]   A high utility itemset mining algorithm based on subsume index [J].
Song, Wei ;
Zhang, Zihan ;
Li, Jinhong .
KNOWLEDGE AND INFORMATION SYSTEMS, 2016, 49 (01) :315-340
[47]   CLS-Miner: efficient and effective closed high-utility itemset mining [J].
Thu-Lan Dam ;
Li, Kenli ;
Fournier-Viger, Philippe ;
Quang-Huy Duong .
FRONTIERS OF COMPUTER SCIENCE, 2019, 13 (02) :357-381
[48]   FMaxCloHUSM: An efficient algorithm for mining frequent closed and maximal high utility sequences [J].
Tin Truong ;
Hai Duong ;
Bac Le ;
Fournier-Viger, Philippe .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2019, 85 :1-20
[49]   An N-list-based algorithm for mining frequent closed patterns [J].
Tuong Le ;
Bay Vo .
EXPERT SYSTEMS WITH APPLICATIONS, 2015, 42 (19) :6648-6657
[50]  
Uno T, 2004, LECT NOTES COMPUT SC, V3245, P16
1234567