z
Download:
|
|
by Devavrat Shah, Laks V. S. Lakshmanan, Krithi Ramamritham, S. Sudarshan
http://www.almaden.ibm.com/cs/dmkd/papers/shah.ps
Add To MetaCart
Abstract:
We study the following question: when can a mined pattern, which may be an association, a correlation, ratio rule, or any other, be regarded as interesting? Previous approaches to answering this question have been largely numeric. Specifically, we show that the presence of some rules may make others redundant, and therefore uninteresting. We articulate these principles and formalize them in the form of pruning rules. Pruning rules, when applied to a collection of mined patterns, can be used to eliminate redundant ones. As a concrete instance, we applied our pruning rules on association rules/positive association rules derived from a census database, and demonstrate that significant pruning results. 1
Citations
| 1673 | R.: Fast algorithms for mining association rules – Agrawal, Srikant |
| 1505 | Mining Association rules between sets of items in large databases – Agrawal, Imielinski, et al. - 1993 |
| 365 | Mining Generalized Association Rules – Srikant |
| 218 | Data mining: a performance perspective – Agrawal, Imielinski, et al. - 1993 |
| 218 | A.: Exploratory mining and pruning optimizations of constrained associations rules – Ng, Lakshmanan, et al. |
| 69 | Classification Algorithms – James - 1985 |
| 42 | A new framework for itemset generation – Aggarwal, Yu - 1998 |
| 22 | Ratio Rules: A New Paradigm for Fast, Quantifiable Data Mining – Korn, Labrinidis - 1998 |
| 2 | Rajeev Motwani and C Silverstein. Beyond Market Basket : Generalizing Association Rules – Brin - 1997 |
| 2 | Rajeev Motwani and C Silverstein. Scalable Techniques for Mining Causal Structures – Brin - 1998 |
| 2 | Sunita Sarawagi and Byron Dom. Mining Surprising patterns using temporal description length – Chakrabarti - 1998 |
