Paper Info
Title
Deduction Schemes for Association Rules
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.
Year
DOI
Venue
2008
10.1007/978-3-540-88411-8_14
Discovery Science
Keywords
Field
DocType
syntactic counterpart,association rules,deductive calculus,logical entailment,deduction schemes,general notion,redundancy,simultaneous premise,confidence threshold,partial rule,deduction calculus,logical sense,association rule
Discrete mathematics,Logical consequence,Natural deduction,Computer science,Association rule learning,Redundancy (engineering),Artificial intelligence,Differentiation rules,Syntax,Rule of inference,Calculus,Machine learning
Conference
Volume
ISSN
Citations 
5255
0302-9743
6
PageRank 
References 
Authors
0.46
12
1
Name
Order
Citations
PageRank
José L. Balcázar170162.06