Interestingness of frequent itemsets using Bayesian networks as background knowledge

  • Authors:
  • Szymon Jaroszewicz;Dan A. Simovici

  • Affiliations:
  • Technical University of Szczecin, Szczecin, Poland;University of Massachusetts at Boston, Boston, MA

  • Venue:
  • Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
  • Year:
  • 2004

Quantified Score

Hi-index 0.01

Visualization

Abstract

The paper presents a method for pruning frequent itemsets based on background knowledge represented by a Bayesian network. The interestingness of an itemset is defined as the absolute difference between its support estimated from data and from the Bayesian network. Efficient algorithms are presented for finding interestingness of a collection of frequent itemsets, and for finding all attribute sets with a given minimum interestingness. Practical usefulness of the algorithms and their efficiency have been verified experimentally.