Deduction Schemes for Association Rules

Authors:
José L. Balcázar
Affiliations:
Departament de Llenguatges i Sistemes Informàtics Laboratori d'Algorísmica Relacional, Complexitat i Aprenentatge, Universitat Politècnica de Catalunya, Barcelona,
Venue:
DS '08 Proceedings of the 11th International Conference on Discovery Science
Year:
2008

Citing 12
Cited 1

Reasoning with models

Artificial Intelligence
Fast discovery of association rules

Advances in knowledge discovery and data mining
A first course in database systems

A first course in database systems
Understanding the crucial differences between classification and discovery of association rules: a position paper

ACM SIGKDD Explorations Newsletter
A New Approach to Online Generation of Association Rules

IEEE Transactions on Knowledge and Data Engineering
Representative Association Rules and Minimum Condition Maximum Consequence Association Rules

PKDD '98 Proceedings of the Second European Symposium on Principles of Data Mining and Knowledge Discovery
Representative Association Rules

PAKDD '98 Proceedings of the Second Pacific-Asia Conference on Research and Development in Knowledge Discovery and Data Mining
Generating an informative cover for association rules

ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Mining Non-Redundant Association Rules

Data Mining and Knowledge Discovery
Generating a Condensed Representation for Association Rules

Journal of Intelligent Information Systems
Association mining

ACM Computing Surveys (CSUR)
Minimum-Size Bases of Association Rules

ECML PKDD '08 Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I

Tractable reasoning problems with fully-characterized association rules

ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several notions of redundancy exist for Association Rules. Often, these notions take the form "any dataset in which this first rule holds must obey also that second rule, therefore the second is redundant"; if we see datasets as interpretations (or models) in the logical sense, this is a form of logical entailment. In many logics, entailment has a syntactic counterpart in the form of a deduction calculus. We provide such a deduction calculus for existing notions of redundancy; then, we consider a very general notion of entailment, where a confidence threshold is fixed and several rules can act as simultaneous premises, and identify exactly the cases where a partial rule follows from two partial rules; we also give a deduction calculus for this setting.