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...
Saved in:
| 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 http://umpir.ump.edu.my/id/eprint/27032/ https://doi.org/10.1007/978-3-642-34062-8_7 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|