A Statistical Theory for Quantitative Association Rules

  • Authors:
  • Yonatan Aumann;Yehuda Lindell

  • Affiliations:
  • Department of Computer Science, Bar-Ilan University, Ramat Gan, Israel 52900. aumann@cs.biu.ac.il;IBM T.J. Watson Research, 19 Skyline Drive, Hawthorne, New York 10532, USA. lindell@us.ibm.com

  • Venue:
  • Journal of Intelligent Information Systems
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Association rules are a key data-mining tool and as such have been well researched. So far, this research has focused predominantly on databases containing categorical data only. However, many real-world databases contain quantitative attributes and current solutions for this case are so far inadequate. In this paper we introduce a new definition of quantitative association rules based on statistical inference theory. Our definition reflects the intuition that the goal of association rules is to find extraordinary and therefore interesting phenomena in databases. We also introduce the concept of sub-rules which can be applied to any type of association rule. Rigorous experimental evaluation on real-world datasets is presented, demonstrating the usefulness and characteristics of rules mined according to our definition.