| L. Cristofor and D. Simovici. Generating an informative cover for association rules, 2002. |
....frequent sets pass; thus, the information can be presented in a more careful way, combining well with exploratory analysis, but still being able to generate exactly the same set of rules that would be found at the chosen support and confidence. We describe next such a notion of cover, due to [CS], who applied it to a synthetic dataset and to the Mushroom database. We describe the results of employing this cover strategy on the databases Car (which is close to synthetic) and Contraceptive Method Choice, with real world data coming from (a subset of) the 1987 National Indonesia ....
....too. Most (though not all) sources also require X and Y to be disjoint. We follow the standard support confidence setting since optimal rules for other interest measures can be found on the optimal support confidence border [BA] besides, the original formulation of the Coverage Inference Scheme [CS] belonged there. The support of a rule X Y is the support of the itemset X [ Y (or its scaling when all supports are considered scaled by m) the confidence of 3 the rule is sup(X [ Y ) sup(X) The data mining process is assumed to start from userspecified thresholds for confidence, and ....
[Article contains additional citation context not shown here]
L. Cristofor, D. Simovici. Generating an informative cover for association rules. 2002, http://www.cs.umb.edu/~laur
No context found.
L. Cristofor and D. Simovici. Generating an informative cover for association rules. In Proceedings of International Conference on Data Mining, Maebashi, Japan, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC