A Formal and Computational Properties of the Confidence Boost of Association Rules

@inproceedings{Balczar2011AFA,
  title={A Formal and Computational Properties of the Confidence Boost of Association Rules},
  author={Jos{\'e} L. Balc{\'a}zar},
  year={2011}
}
Some existing notions of redundancy among association rules allow for a logical-style characterization and lead to irredundant bases of absolutely minimum size. We push the intuition of redundancy further, to find an intuitive notion of novelty of an association rule, with respect to other rules. Namely: an irredundant rule is so because its confidence is… CONTINUE READING