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...
Disimpan dalam:
| Pengarang-pengarang Utama: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Diterbitkan: |
2012
|
| Subjek-subjek: | |
| Capaian Atas Talian: | http://dx.doi.org/10.1007/978-3-642-34062-8_7 http://dx.doi.org/10.1007/978-3-642-34062-8_7 |
| Penanda-penanda: |
Tambah Penanda
Tiada Penanda, Jadilah orang pertama menanda rekod ini!
|