Efficient mining of both positive and negative association rules.
This paper presents an efficient method for mining both positive and negative association rules in databases. The method extends traditional associations to include association rules of forms A ⇒ ¬ B, ¬ A ⇒ B, and ¬ A ⇒ ¬ B, which indicate negative associations between itemsets. With a pruning strat...
| הוצא לאור ב: | ACM transactions on information systems. 22, 3 (2004). |
|---|---|
| מחבר ראשי: | |
| מחברים אחרים: | , |
| פורמט: | Article |
| שפה: | English |
| נושאים: |