Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Mining quantitative association rules in large relational tables
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Mining optimized association rules for numeric attributes
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Using a Hash-Based Method with Transaction Trimming for Mining Association Rules
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
Mining Generalized Association Rules
VLDB '95 Proceedings of the 21th 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)
A new incremental data mining algorithm using pre-large itemsets
Intelligent Data Analysis
An improved association rules mining method
Expert Systems with Applications: An International Journal
DBV-Miner: A Dynamic Bit-Vector approach for fast mining frequent closed itemsets
Expert Systems with Applications: An International Journal
Classification based on association rules: A lattice-based approach
Expert Systems with Applications: An International Journal
A new method for mining Frequent Weighted Itemsets based on WIT-trees
Expert Systems with Applications: An International Journal
CAR-Miner: An efficient algorithm for mining class-association rules
Expert Systems with Applications: An International Journal
Hi-index | 12.06 |
Modification of records in databases is common in real-world applications. Developing an efficient and effective mining algorithm to maintain discovered information as the records in a database are updated is thus quite important in the field of data mining. Although association rules for modification of records can be maintained by using deletion and insertion procedures, this requires twice the computation time needed for a single procedure. In this paper, we present a new modification algorithm to resolve this issue. The concept of pre-large itemsets is used to reduce the need for rescanning original databases and to save maintenance costs. The proposed algorithm does not require rescanning of original databases until a specified number of records have been modified. If the database is large, then the number of modified records allowed will also be large. This characteristic is especially useful for real-world applications.