Borders: An efficient algorithm for association generation in dynamic databases

Citation
Y. Aumann et al., Borders: An efficient algorithm for association generation in dynamic databases, J INTELL IN, 12(1), 1999, pp. 61-73
Citations number
13
Language
INGLESE
art.tipo
Article
Categorie Soggetti
Information Tecnology & Communication Systems
Journal title
JOURNAL OF INTELLIGENT INFORMATION SYSTEMS
ISSN journal
0925-9902 → ACNP
Volume
12
Issue
1
Year of publication
1999
Pages
61 - 73
Database
ISI
SICI code
0925-9902(199904)12:1<61:BAEAFA>2.0.ZU;2-C
Abstract
We consider the problem of finding association rules in a database with bin ary attributes. Most algorithms for finding such rules assume that all the data is available at the start of the data mining session. In practice, the data in the database may change over time, with records being added and de leted. At any given time, the rules for the current set of data are of inte rest. The naive, and highly inefficient, solution would be to rerun the ass ociation generation algorithm from scratch following the arrival of each ne w batch of data. This paper describes the Borders algorithm, which provides an efficient method for generating associations incrementally, from dynami cally changing databases. Experimental results show an improved performance of the new algorithm when compared with previous solutions to the problem.