Rule Mining for Dynamic Databases
AbstractAssociation rules identify associations among data items and were introduced in 1993 by Agarwal et al.. Most of the algorithms to find association rules deal with the static databases. There are very few algorithms that deal with dynamic databases. The most classical algorithm to find association rules in dynamic database is Borders algorithm. This paper presents two modified version of the Borders algorithm called Modified Borders. Experimental results show that the modified version performs better than the Borders algorithm in terms of execution time. To address the scalability issue, the paper also proposes a distributed version of the Borders algorithm, called Distributed Borders.
Copyright (c) 2005 A Das, D Bhattacharyya
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
AJIS publishes open-access articles distributed under the terms of a Creative Commons Non-Commercial and Attribution License which permits non-commercial use, distribution, and reproduction in any medium, provided the original author and AJIS are credited. All other rights including granting permissions beyond those in the above license remain the property of the author(s).