Constructing complete FP-Tree for incremental mining of frequent patterns in dynamic databases

Authors:
Muhaimenul Adnan;Reda Alhajj;Ken Barker
Affiliations:
Department of Computer Science, University of Calgary, Calgary, AB, Canada;Department of Computer Science, University of Calgary, Calgary, AB, Canada;Department of Computer Science, University of Calgary, Calgary, AB, Canada
Venue:
IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems
Year:
2006

Citing 10
Cited 1

Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
A new and versatile method for association generation

Information Systems
Using association rules for product assortment decisions: a case study

KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
An efficient algorithm to update large itemsets with early pruning

KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Mining frequent patterns without candidate generation

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Rapid association rule mining

Proceedings of the tenth international conference on Information and knowledge management
DEMON: Mining and Monitoring Evolving Data

IEEE Transactions on Knowledge and Data Engineering
Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique

ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
A General Incremental Technique for Maintaining Discovered Association Rules

Proceedings of the Fifth International Conference on Database Systems for Advanced Applications (DASFAA)

DRFP-tree: disk-resident frequent pattern tree

Applied Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a novel approach that extends the FP-tree in two ways. First, the tree is maintained to include every attribute that occurs at least once in the database. This facilitates mining with different support values without constructing several FP-trees to satisfy the purpose. Second, the tree is manipulated in a unique way that reflects updates to the corresponding database by scanning only the updated portion, thereby reducing execution time in general. Test results on two datasets demonstrate the applicability, efficiency and effectiveness of the proposed approach.