2005
DOI: 10.1023/b:apin.0000047380.15356.7a
|View full text |Cite
|
Sign up to set email alerts
|

Logic of Association Rules

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
37
0

Year Published

2006
2006
2017
2017

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 60 publications
(38 citation statements)
references
References 5 publications
1
37
0
Order By: Relevance
“…ARs are produced by humans, although the use of natural language generation was also studied [18]. Prior to entering the reports, the sets of discovered hypotheses (understood as formulae in the socalled observational calculus) can be transformed using formal deduction rules [15,16] into 'canonical form' (which is, among other, free of redundancies). In the cardiovascular risk application, a collection of ARs has been created by junior researchers based upon results of selected 4ft-Miner tasks on STULONG data.…”
Section: Results Deployment Over Semantic Webmentioning
confidence: 99%
“…ARs are produced by humans, although the use of natural language generation was also studied [18]. Prior to entering the reports, the sets of discovered hypotheses (understood as formulae in the socalled observational calculus) can be transformed using formal deduction rules [15,16] into 'canonical form' (which is, among other, free of redundancies). In the cardiovascular risk application, a collection of ARs has been created by junior researchers based upon results of selected 4ft-Miner tasks on STULONG data.…”
Section: Results Deployment Over Semantic Webmentioning
confidence: 99%
“…The task of association rule mining is to find the rule A  B which the support and confidence in transaction database D satisfy the min_sup and the min_con specified by the users, that is strong association rules. Association rules mining is a two step process: (1) finding all frequent item sets; (2) generating strong association rules by frequent item sets [7] . Apriori algorithm is a classic frequent item sets mining algorithm.…”
Section: Association Rules and Improvement Of Apriori Algorithmmentioning
confidence: 99%
“…Background Association Rules are GUHA-like association rules [36], but they are defined over meta-fields rather than over data fields or derived fields. A more formal definition is in [26].…”
Section: Background Knowledge: Patternsmentioning
confidence: 99%
“…A more formal definition is in [26]. A Mutual Influence can be transformed into Background Association Rules (BAR) of the form A(ω A ) ≈ B(ω B ), where A(ω A ) and B(ω B ) are Basic Boolean Meta-attributes [36]. The coefficient ω X is a subset of values of meta-field X that are perceived as 'high'.…”
Section: Background Knowledge: Patternsmentioning
confidence: 99%