A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Efficient mining of both positive and negative association rules
ACM Transactions on Information Systems
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 strategy and an interestingness measure, our method scales to large databases. The method has been evaluated using both synthetic and real-world databases, and our experimental results demonstrate itsdoi:10.1145/1010614.1010616 fatcat:6sw3mn57xjgcbfq6pntdarohqq