Dynamic FP-Tree Pruning for Concurrent Frequent Itemsets Mining

被引：0

作者：

Song, Wei ^{[1
]}

Liu, Wenbo ^{[1
]}

Li, Jinhong ^{[1
]}

机构：

[1] N China Univ Technol, Coll Informat Engn, Beijing 100144, Peoples R China

来源：

COMPUTATIONAL INTELLIGENCE AND INTELLIGENT SYSTEMS | 2012年 / 316卷

关键词：

Data Mining; Frequent Itemset; FP-Tree; Concurrency;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

To solve the problem of huge memory usage of FP-tree construction and traversal in FP-growth, Dynamic-prune, which is a concurrent frequent itemsets mining algorithm based on FP-tree is proposed. On the one hand, by recording the change of support counts of frequent items during the process of FP-tree construction, dynamic FP-tree pruning is implemented. And the rationality is discussed. On the other hand, by using the concurrency strategy, the construction of FP-tree and the discovery of frequent itemsets can be realized simultaneously. Compared with FP-growth, it is not necessary to mine frequent itemsets after the construction of the whole FP-tree in Dynamic-prune. Experimental results show Dynamic-prune is efficient and scalable.

引用

页码：111 / 120

页数：10

共 50 条

[21] Mining Closed Frequent Itemset based on FP-Tree
Li, Shengwei
Li, Lingsheng
Han, Chong
2009 IEEE INTERNATIONAL CONFERENCE ON GRANULAR COMPUTING ( GRC 2009), 2009, : 354 - 357
[22] Dynamic FP-Tree based mining of frequent patterns satisfying succinct constraints
Leung, CKS
CONSTRAINT DATABASES, PROCEEDINGS, 2004, 3074 : 112 - 127
[23] Constructing complete FP-tree for incremental mining of frequent patterns in dynamic databases
Adnan, Muhaimenul
Alhajj, Reda
Barker, Ken
ADVANCES IN APPLIED ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2006, 4031 : 363 - 372
[24] An FP-tree approach for mining N-most interesting itemsets
Cheung, YL
Fu, AWC
DATA MINING AND KNOWLEDGE DISCOVERY: THEORY, TOOLS AND TECHNOLOGY IV, 2002, 4730 : 460 - 471
[25] Mining frequent trajectory using FP-tree in GPS data
Li, J. (lijunhuai@xaut.edu.cn), 1600, Binary Information Press, P.O. Box 162, Bethel, CT 06801-0162, United States (09):
[26] A Survey on FP-Tree Based Incremental Frequent Pattern Mining
Ahmed, Shafiul Alom
Nath, Bhabesh
BIOLOGICALLY INSPIRED TECHNIQUES IN MANY-CRITERIA DECISION MAKING, 2020, 10 : 203 - 210
[27] Frequent XML query pattern mining based on FP-TRee
Gu, Mi Sug
Hwang, Jeong Hee
Ryu, Keun Ho
DEXA 2007: 18TH INTERNATIONAL CONFERENCE ON DATABASE AND EXPERT SYSTEMS APPLICATIONS, PROCEEDINGS, 2007, : 555 - +
[28] An Improved FP-tree Algorithm for Mining Maximal Frequent Patterns
Pan Zhaopeng
Liu Peiyu
Yi Jing
2018 10TH INTERNATIONAL CONFERENCE ON MEASURING TECHNOLOGY AND MECHATRONICS AUTOMATION (ICMTMA), 2018, : 309 - 312
[29] Mining frequent patterns without conditional FP-tree generation
Lan, YJ
ICEMI 2005: Conference Proceedings of the Seventh International Conference on Electronic Measurement & Instruments, Vol 7, 2005, : 487 - 491
[30] EFP-tree: an efficient FP-tree for incremental mining of frequent patterns
Davashi, Razieh
Nadimi-Shahraki, Mohammad-Hossein
INTERNATIONAL JOURNAL OF DATA MINING MODELLING AND MANAGEMENT, 2019, 11 (02) : 144 - 166

← 1 2 3 4 5 →