A Low-Scan Incremental Association Rule Maintenance Method Based on the Apriori Property

  • Authors:
  • Zequn Zhou;C. I. Ezeife

  • Affiliations:
  • -;-

  • Venue:
  • AI '01 Proceedings of the 14th Biennial Conference of the Canadian Society on Computational Studies of Intelligence: Advances in Artificial Intelligence
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

As new transactions update data sources and subsequently the data warehouse, the previously discovered association rules in the old database may no longer be interesting rules in the new database. Furthermore, some new interesting rules may appear in the new database. This paper presents a new algorithm for efficiently maintaining discovered association rules in the updated database, which starts by computing the high n level large itemsets in the new database using the available high n level large itemsets in the old database. Some parts of the n - 1, n - 2, . . ., 1 level large itemsets can then be quickly generated by applying the apriori property, thereby avoiding the overhead of calculating many lower level large itemsets that involve huge table scans.