Constructing Complete FP-Tree for Incremental Mining of Frequent Patterns in Dynamic Databases
Authors:
- 1 January 2006
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 363-372
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Performance analysis of incremental update of association rules mining approaches2005
- An Efficient Approach for Maintaining Association Rules Based on Adjusting FP-Tree Structures2004
- Rapid association rule mining2001
- Mining frequent patterns without candidate generation2000
- Using association rules for product assortment decisions1999
- An efficient algorithm to update large itemsets with early pruning1999
- A General Incremental Technique for Maintaining Discovered Association Rules1997
- Maintenance of discovered association rules in large databases: an incremental updating technique1996
- Mining association rules between sets of items in large databases1993