Abstract

Mining association rules is an important task of dara mining and knowledge discovery. Traditional association rules mining is built on transaction databases, which has some limitations. Two of these limitations are 1) each transaction merely contains binary items, meaning that an item either occurs in a transaction or not; 2) only positive association rules are discovered, while negative associations are ignored. Mining fuzzy association rules has been proposed to address the first limitation, while mining algorithms for negative association rules have been developed to resolve the second limitation. In this paper, we combine these two approaches to propose a novel approach for mining both positive and negative fuzzy association rules. The interestingness measure for both positive and negative fuzzy association rule is proposed, the algorithm for mining these rules is described, and an illustrative example is presented to demonstrate how the measure and the algorithm work.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call