Sets of Robust Rules, and How to Find Them
Authors:
- 30 April 2020
- book chapter
- Published by Springer Nature
- p. 38-54
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- A Subsequence Interleaving Model for Sequential Pattern Mining2016
- Kingfisher: an efficient algorithm for searching for both positive and negative dependency rules with statistical significance measuresKnowledge and Information Systems, 2011
- Maximum entropy models and subjective interestingness: an application to tiles in binary databasesData Mining and Knowledge Discovery, 2010
- Mining Top-K Patterns from Binary Datasets in presence of Noise2010
- The Minimum Description Length Principle2007
- Non-derivable itemset miningData Mining and Knowledge Discovery, 2007
- Interestingness of frequent itemsets using Bayesian networks as background knowledge2004
- Mining frequent patterns without candidate generationACM SIGMOD Record, 2000
- Efficiently mining long patterns from databasesACM SIGMOD Record, 1998
- An Introduction to Kolmogorov Complexity and Its Applications1993