.png){kind=icon}
.png){kind=icon}
Return
Mining disjunctive consequent association rules
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2010.07.011.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
When association rules A -> B and A -> C cannot be discovered from the database, it does not mean that A -> B boolean OR C will not be an association rule from the same database. In fact, when A, B or C is the newly marketed product, A > B boolean OR C shall be a very useful rule in some cases. Since the consequent item of this kind of rule is formed by a disjunctive composite item, we call this type of rules as the disjunctive consequent association rules. Therefore, we propose a simple but efficient algorithm to discover this type of rules. Moreover, when we apply our algorithm to insurance policy for cross selling, the useful results have been proven by the insurance company. (C) 2010 Elsevier B. V. All rights reserved.
Keywords:
Data mining
Association rule
Disjunctive composite items
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W