Corpus ID: 2322267

Interestingness and Pruning of Mined Patterns

@inproceedings{Shah1999InterestingnessAP,
  title={Interestingness and Pruning of Mined Patterns},
  author={D. Shah and L. Lakshmanan and K. Ramamritham and S. Sudarshan},
  booktitle={1999 ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery},
  year={1999}
}
  • D. Shah, L. Lakshmanan, +1 author S. Sudarshan
  • Published in
    ACM SIGMOD Workshop on…
    1999
  • Computer Science
  • 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. Speciically, 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… CONTINUE READING
    60 Citations

    Topics from this paper.

    The Interestingness Paradox in Pattern Discovery
    • 9
    Statistical Pruning of Discovered Association Rules
    • 13
    Discovering hidden association rules
    • 8
    • PDF
    Finding anomalies in databases
    On characterization and discovery of minimal unexpected patterns in rule discovery
    • 53
    • Highly Influenced
    Small is beautiful: discovering the minimal set of unexpected patterns
    • 170
    • Highly Influenced
    • PDF
    Interestingness preprocessing
    • Sigal Sahar
    • Computer Science
    • Proceedings 2001 IEEE International Conference on Data Mining
    • 2001
    • 16
    • PDF
    Mining Short‐Rule Covers in Relational Databases
    • 3
    • PDF
    Finding interesting rules from large data sets
    • 2