Detecting Temporally Redundant Association Rules

  • Authors:
  • Mirko Bottcher;Martin Spott;Detlef Nauck

  • Affiliations:
  • Intelligent Systems Research Centre, UK;Intelligent Systems Research Centre, UK;Intelligent Systems Research Centre, UK

  • Venue:
  • ICMLA '05 Proceedings of the Fourth International Conference on Machine Learning and Applications
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Methods for association rule discovery and pruning assume implicitly that the associations hidden in the data are stable over time and thus provide a rather static view on data and their underlying structure. This is unrealistic in time-stamped domains, which are standard for reallife business data. The question "Which association rules exist?" is replaced by"How do properties of association rules change" In order to cope with the vast number of detectable rule changes, pre-processing techniques are required that find those rules which are root cause to interesting rule changes. The paper proposes an approach based on statistical tests that finds derivative rule change histories and marks the respective rules as redundant. The effectiveness in reducing the number of rule histories is demonstrated using real-life survey data.