Record Details

An adaptive algorithm for incremental mining of association rules

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title An adaptive algorithm for incremental mining of association rules
 
Creator SARDA, NL
SRINIVAS, NV
 
Subject adaptive systems
deductive databases
knowledge acquisition
very large databases
 
Description The association rules represent an important class of knowledge that can be discovered from data warehouses. Current research efforts are focused on inventing efficient ways of discovering these rules from large databases. As databases grow, the discovered rules need to be verified and new rules need to be added to the knowledge base. Since mining afresh every time the database grows is inefficient, algorithms for incremental mining are being investigated. Their primary aim is to avoid or minimize scans of the older database by using the intermediate data constructed during the earlier mining. We present one such algorithm. We make use of large and candidate itemsets and their counts in the older database, and scan the increment to find which rules continue to prevail and which ones fail in the merged database. We are also able to find new rules for the incremental and updated database. The algorithm is adaptive in nature, as it infers the nature of the increment and avoids altogether if possible, multiple scans of the incremental database. Another salient feature is that it does not need multiple scans of the older database. We also indicate some results on its performance against synthetic data.
 
Publisher IEEE
 
Date 2009-05-08T02:31:35Z
2011-11-28T07:48:36Z
2011-12-15T09:57:13Z
2009-05-08T02:31:35Z
2011-11-28T07:48:36Z
2011-12-15T09:57:13Z
1998
 
Type Article
 
Identifier Proceedings of the Ninth International Workshop on Database and Expert Systems Applications, Vienna, Austria, 26-28 August 1998, 240-245
0-8186-8353-8
10.1109/DEXA.1998.707409
http://hdl.handle.net/10054/1290
http://dspace.library.iitb.ac.in/xmlui/handle/10054/1290
 
Language en