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: | Zailani, Abdullah, Herawan, Tutut, Noraziah, Ahmad, Mustafa, Mat Deris |
---|---|
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!
|
Similar Items
-
EFP-M2: Efficient model for mining frequent patterns in transactional database
by: Herawan, Tutut, et al.
Published: (2012) -
A Scalable Algorithm for Constructing Frequent Pattern Tree
by: Noraziah, Ahmad, et al.
Published: (2014) -
Visualizing the construction of incremental Disorder Trie Itemset data structure (DOSTrieIT) for Frequent Pattern Tree (FP-Tree)
by: Zailani, Abdullah, et al.
Published: (2011) -
IncSPADE: An Incremental Sequential Pattern Mining Algorithm Based on SPADE Property
by: Omer, Adam, et al.
Published: (2016) -
Mining Least Association Rules of Degree Level Programs Selected by Students
by: Zailani, Abdullah, et al.
Published: (2014)