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 条

[41] NUCLEAR: An Efficient Methods for Mining Frequent Itemsets and Generators from Closed Frequent Itemsets
Huy Quang Pham
Duc Tran
Ninh Bao Duong
Fournier-Viger, Philippe
Alioune Ngom
INFORMATION TECHNOLOGY IN INDUSTRY, 2019, 7 (02): : 1 - 13
[42] An Incremental Closed Frequent Itemsets Mining Algorithm Based on Shadow Prefix Tree
Li, Yun
Xu, Jie
Zhang, Xiaobing
Li, Chen
Zhang, Yingjuan
2013 10TH WEB INFORMATION SYSTEM AND APPLICATION CONFERENCE (WISA 2013), 2013, : 440 - 445
[43] A density-based algorithm for mining frequent closed itemsets in data streams
Chen, Yong
BASIC & CLINICAL PHARMACOLOGY & TOXICOLOGY, 2019, 125 : 127 - 128
[44] Privacy preserving frequent closed itemsets mining algorithm in vertically partitioned data
Ming, Mei, 1600, Binary Information Press (10):
[45] A Fast Algorithm for Mining Frequent Closed Itemsets over Stream Sliding Window
Yen, Show-Jane
Wu, Cheng-Wei
Lee, Yue-Shi
Tseng, Vincent S.
Hsieh, Chaur-Heh
IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS (FUZZ 2011), 2011, : 996 - 1002
[46] GC-Tree: A fast Online algorithm for mining frequent closed itemsets
Chen, Junbo
Li, ShanPing
EMERGING TECHNOLOGIES IN KNOWLEDGE DISCOVERY AND DATA MINING, 2007, 4819 : 457 - +
[47] An Efficient Mining Algorithm of Closed Frequent Itemsets on Multi-core Processor
Phan, Huan
ADVANCED DATA MINING AND APPLICATIONS, ADMA 2019, 2019, 11888 : 107 - 118
[48] TFP: An efficient algorithm for mining top-K frequent closed itemsets
Wang, JY
Han, JW
Lu, Y
Tzvetkov, P
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2005, 17 (05) : 652 - 664
[49] Efficient algorithm for mining closed itemsets
Liu, Jun-Qiang
Pan, Yun-He
Journal of Zhejiang University: Science, 2004, 5 (01): : 8 - 15
[50] An efficient algorithm for mining closed itemsets
Liu Jun-qiang
Pan Yun-he
Journal of Zhejiang University-SCIENCE A, 2004, 5 (1): : 8 - 15

← 1 2 3 4 5 →