Proceedings 14th International Conference on Data Engineering
DOI: 10.1109/icde.1998.655812
|View full text |Cite
|
Sign up to set email alerts
|

Mining for strong negative associations in a large database of customer transactions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
152
0
2

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 196 publications
(154 citation statements)
references
References 5 publications
0
152
0
2
Order By: Relevance
“…Negative association was first pointed out by Brin et al in [6]. Since then, many techniques for mining negative associations have been developed [10,14,18]. In the case of negative associations we are interested in finding itemsets that have a very low probability of occurring together.…”
Section: A Negative Association Rulesmentioning
confidence: 99%
See 2 more Smart Citations
“…Negative association was first pointed out by Brin et al in [6]. Since then, many techniques for mining negative associations have been developed [10,14,18]. In the case of negative associations we are interested in finding itemsets that have a very low probability of occurring together.…”
Section: A Negative Association Rulesmentioning
confidence: 99%
“…However, their sole purpose of using probe attributes is to perform attribute clustering. Indirect association is closely related to the notion of negative association rules [27]. In both cases, we are dealing with itemsets that do not have sufficiently high support.…”
Section: Related Work In Indirect Association Rule Miningmentioning
confidence: 99%
See 1 more Smart Citation
“…The fuzzy ARM algorithm [4] transforms quantitative value into a fuzzy set with the linguistic terms by using the membership functions. The scalar count of each linguistic term is estimated.…”
Section: Algorithm For Mining Positive and Negative Weighted Fuzzymentioning
confidence: 99%
“…end if (11) end for (12) // Pruning using Apriori property (13) for each (k-1)-subsets s of c in C k (14) If s is not a member of L k-1 (15) C k =C k -{c} (16) end if (17) end for (18) PC k = C k; (19) for each c in PC K (20) NC The generation of positive rules continues without disruption and the rich but valuable negative rules are produced as by-products of the Apriori process.…”
Section: Inputmentioning
confidence: 99%