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...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
Springer
2012
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/27032/1/DFP-growth-%20An%20efficient%20algorithm%20for%20mining%20frequent%20patterns%20in%20dynamic%20database.pdf |
| _version_ | 1825813090833268736 |
|---|---|
| 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 |
| collection | UMP |
| 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. |
| first_indexed | 2024-03-06T12:38:52Z |
| format | Conference or Workshop Item |
| id | UMPir27032 |
| institution | Universiti Malaysia Pahang |
| language | English |
| last_indexed | 2024-03-06T12:38:52Z |
| publishDate | 2012 |
| publisher | Springer |
| record_format | dspace |
| spelling | UMPir270322019-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 (Published) https://doi.org/10.1007/978-3-642-34062-8_7 |
| 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 |
| title | 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_short | 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 |
| topic | QA76 Computer software |
| url | http://umpir.ump.edu.my/id/eprint/27032/1/DFP-growth-%20An%20efficient%20algorithm%20for%20mining%20frequent%20patterns%20in%20dynamic%20database.pdf |
| work_keys_str_mv | AT zailaniabdullah dfpgrowthanefficientalgorithmforminingfrequentpatternsindynamicdatabase AT herawantutut dfpgrowthanefficientalgorithmforminingfrequentpatternsindynamicdatabase AT noraziahahmad dfpgrowthanefficientalgorithmforminingfrequentpatternsindynamicdatabase AT mustafamatderis dfpgrowthanefficientalgorithmforminingfrequentpatternsindynamicdatabase |