On-line association rules mining with dynamic support

Authors:
Hsuan-Shih Lee
Affiliations:
Department of Shipping and Transportation Management, Department of Computer Science, National Taiwan Ocean University, Taiwan, Republic of China
Venue:
KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part II
Year:
2006

Citing 10
Cited 0

Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Dynamic itemset counting and implication rules for market basket data

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Database Mining: A Performance Perspective

IEEE Transactions on Knowledge and Data Engineering
Mining Sequential Patterns

ICDE '95 Proceedings of the Eleventh International Conference on 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)
An Adaptive Algorithm for Incremental Mining of Association Rules

DEXA '98 Proceedings of the 9th International Workshop on Database and Expert Systems Applications
A new incremental data mining algorithm using pre-large itemsets

Intelligent Data Analysis
Incremental association mining based on maximal itemsets

KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we use maximal itemsets to represent itemsets in a database. We show that the set of supreme covers, which are the maximal itemsets whose proper subsets are not maximal itemsets, induces an equivalence relation on the set itemsets. Based on maximal itemsets, we propose a large itemset generation algorithm with dynamic support, which runs in time O(M′2N+M′logM), where N is the maximum number of items in a maximal itemset, M′ is the number of the maximal itemsets with minimum support greater than the required support, and M is the number of the maximal itemsets.