DFP-growth: An efficient algorithm for mining frequent patterns in dynamic database

DFP-growth: An efficient algorithm for mining frequent patterns in dynamic database

Mining frequent patterns in a large database is still an important and relevant topic in data mining. Nowadays, FP-Growth is one of the famous and benchmarked algorithms to mine the frequent patterns from FP-Tree data structure. However, the major drawback in FP-Growth is, the FP-Tree must be rebuil...

Full description

Bibliographic Details
Main Authors: Zailani, Abdullah, Herawan, Tutut, Noraziah, Ahmad, Mustafa, Mat Deris
Format: Conference or Workshop Item
Language:English
Published: Springer 2012
Subjects:
QA76 Computer software
Online Access:http://umpir.ump.edu.my/id/eprint/27032/
http://umpir.ump.edu.my/id/eprint/27032/
http://umpir.ump.edu.my/id/eprint/27032/1/DFP-growth-%20An%20efficient%20algorithm%20for%20mining%20frequent%20patterns%20in%20dynamic%20database.pdf
id ump-27032
recordtype eprints
spelling ump-270322019-12-18T02:00:35Z http://umpir.ump.edu.my/id/eprint/27032/ DFP-growth: An efficient algorithm for mining frequent patterns in dynamic database Zailani, Abdullah Herawan, Tutut Noraziah, Ahmad Mustafa, Mat Deris QA76 Computer software Mining frequent patterns in a large database is still an important and relevant topic in data mining. Nowadays, FP-Growth is one of the famous and benchmarked algorithms to mine the frequent patterns from FP-Tree data structure. However, the major drawback in FP-Growth is, the FP-Tree must be rebuilt all over again once the original database is changed. Therefore, in this paper we introduce an efficient algorithm called Dynamic Frequent Pattern Growth (DFP-Growth) to mine the frequent patterns from dynamic database. Experiments with three UCI datasets show that the DFP-Growth is up to 1.4 times faster than benchmarked FP-Growth, thus verify it efficiencies. Springer 2012 Conference or Workshop Item PeerReviewed pdf en http://umpir.ump.edu.my/id/eprint/27032/1/DFP-growth-%20An%20efficient%20algorithm%20for%20mining%20frequent%20patterns%20in%20dynamic%20database.pdf Zailani, Abdullah and Herawan, Tutut and Noraziah, Ahmad and Mustafa, Mat Deris (2012) DFP-growth: An efficient algorithm for mining frequent patterns in dynamic database. In: 3rd International Conference on Information Computing and Applications (ICICA 2012), 14-16 September 2012 , Chengde, China. pp. 51-58.. ISSN 0302-9743 ISBN 978-3-642-34062-8 https://doi.org/10.1007/978-3-642-34062-8_7
repository_type Digital Repository
institution_category Local University
institution Universiti Malaysia Pahang
building UMP Institutional Repository
collection Online Access
language English
topic QA76 Computer software
spellingShingle QA76 Computer software
Zailani, Abdullah
Herawan, Tutut
Noraziah, Ahmad
Mustafa, Mat Deris
DFP-growth: An efficient algorithm for mining frequent patterns in dynamic database
description Mining frequent patterns in a large database is still an important and relevant topic in data mining. Nowadays, FP-Growth is one of the famous and benchmarked algorithms to mine the frequent patterns from FP-Tree data structure. However, the major drawback in FP-Growth is, the FP-Tree must be rebuilt all over again once the original database is changed. Therefore, in this paper we introduce an efficient algorithm called Dynamic Frequent Pattern Growth (DFP-Growth) to mine the frequent patterns from dynamic database. Experiments with three UCI datasets show that the DFP-Growth is up to 1.4 times faster than benchmarked FP-Growth, thus verify it efficiencies.
format Conference or Workshop Item
author Zailani, Abdullah
Herawan, Tutut
Noraziah, Ahmad
Mustafa, Mat Deris
author_facet Zailani, Abdullah
Herawan, Tutut
Noraziah, Ahmad
Mustafa, Mat Deris
author_sort Zailani, Abdullah
title DFP-growth: An efficient algorithm for mining frequent patterns in dynamic database
title_short DFP-growth: An efficient algorithm for mining frequent patterns in dynamic database
title_full DFP-growth: An efficient algorithm for mining frequent patterns in dynamic database
title_fullStr DFP-growth: An efficient algorithm for mining frequent patterns in dynamic database
title_full_unstemmed DFP-growth: An efficient algorithm for mining frequent patterns in dynamic database
title_sort dfp-growth: an efficient algorithm for mining frequent patterns in dynamic database
publisher Springer
publishDate 2012
url http://umpir.ump.edu.my/id/eprint/27032/
http://umpir.ump.edu.my/id/eprint/27032/
http://umpir.ump.edu.my/id/eprint/27032/1/DFP-growth-%20An%20efficient%20algorithm%20for%20mining%20frequent%20patterns%20in%20dynamic%20database.pdf
first_indexed 2023-09-18T22:42:23Z
last_indexed 2023-09-18T22:42:23Z
_version_ 1777417001108504576

Similar Items