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
|
Pdf
DFP-growth- An efficient algorithm for mining frequent patterns in dynamic database.pdf Download (275kB) | Preview |
Abstract
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.
| Item Type: | Conference or Workshop Item (Lecture) |
|---|---|
| Additional Information: | Indexed by Scopus |
| Uncontrolled Keywords: | Efficient algorithm; Frequent patterns; Dynamic database |
| Subjects: | Q Science > QA Mathematics > QA76 Computer software |
| Faculty/Division: | Faculty of Computer System And Software Engineering |
| Depositing User: | Mrs. Neng Sury Sulaiman |
| Date Deposited: | 18 Dec 2019 02:00 |
| Last Modified: | 18 Dec 2019 02:00 |
| URI: | http://umpir.ump.edu.my/id/eprint/27032 |
| Download Statistic: | View Download Statistics |
Actions (login required)
 |
View Item |