2000
DOI: 10.1007/3-540-44418-1_27
|View full text |Cite
|
Sign up to set email alerts
|

Mining for 4ft Association Rules

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2002
2002
2011
2011

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 25 publications
(14 citation statements)
references
References 3 publications
0
14
0
Order By: Relevance
“…In this sense, there is a relation with the work of [Rauch and Simunek 2001], where the notion of conditional association rules has been used to analyze a dataset of loans. A conditional rule A ⇔ C/B denotes a context B in which itemsets A and C are equivalent, namely where conf (A, B → C) = 1 and conf (¬A, B → ¬C) = 1.…”
Section: Extended Liftmentioning
confidence: 99%
See 1 more Smart Citation
“…In this sense, there is a relation with the work of [Rauch and Simunek 2001], where the notion of conditional association rules has been used to analyze a dataset of loans. A conditional rule A ⇔ C/B denotes a context B in which itemsets A and C are equivalent, namely where conf (A, B → C) = 1 and conf (¬A, B → ¬C) = 1.…”
Section: Extended Liftmentioning
confidence: 99%
“…However, we can say nothing about conf (B → C), and, consequently, about the relative strength of the rule with respect to the base classification rule. In addition to ⇔, the 4ft-Miner system [Rauch and Simunek 2001; allows for the extraction of conditional rules with other operators. The "above average dependence" operator defines rules A ∼ + C/B such that supp(A, B, C) ≥ ms, where ms is the minimum support threshold, and lif t B (A → C) ≥ 1 + p, where B = {T ∈ D | B ⊆ T } is the set of transactions verifying B.…”
Section: Extended Liftmentioning
confidence: 99%
“…Technically, we measured discrimination through a generalization of lift to cope with contexts, specified as non-discriminatory itemsets. In this sense, there is a relation with the work of [13], where the notion of conditional association rules has been studied. A conditional rule A ⇔ C/B denotes a context B in which itemsets A and C are equivalent, namely where conf (A, B → C) = 1 and conf (¬A, B → ¬C) = 1.…”
Section: Related Work and Conclusionmentioning
confidence: 99%
“…These measures are usually defined using the 2 × 2 contingency table presented in figure 1, and is a classical way of measuring association in the case of paired attributes [23], such as in the Guha method [21], in the 4ft-Miner tool [80] and in the Apriori algorithm [2].…”
Section: Interestingness Measuresmentioning
confidence: 99%