Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Artificial Intelligence
Fast discovery of association rules
Advances in knowledge discovery and data mining
A first course in database systems
A first course in database systems
Pruning and summarizing the discovered associations
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Multi-level organization and summarization of the discovered rules
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
ACM SIGKDD Explorations Newsletter
Levelwise Search and Borders of Theories in KnowledgeDiscovery
Data Mining and Knowledge Discovery
A New Approach to Online Generation of Association Rules
IEEE Transactions on Knowledge and Data Engineering
Representative Association Rules and Minimum Condition Maximum Consequence Association Rules
PKDD '98 Proceedings of the Second European Symposium on Principles of Data Mining and Knowledge Discovery
Mining All Non-derivable Frequent Itemsets
PKDD '02 Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery
Representative Association Rules
PAKDD '98 Proceedings of the Second Pacific-Asia Conference on Research and Development in Knowledge Discovery and Data Mining
Querying multiple sets of discovered rules
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Discovering all most specific sentences
ACM Transactions on Database Systems (TODS)
Generating an informative cover for association rules
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Mining Non-Redundant Association Rules
Data Mining and Knowledge Discovery
Generating a Condensed Representation for Association Rules
Journal of Intelligent Information Systems
ACM Computing Surveys (CSUR)
Interestingness measures for data mining: A survey
ACM Computing Surveys (CSUR)
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
Deduction Schemes for Association Rules
DS '08 Proceedings of the 11th International Conference on Discovery Science
Mining non-redundant information-theoretic dependencies between itemsets
DaWaK'10 Proceedings of the 12th international conference on Data warehousing and knowledge discovery
Tractable reasoning problems with fully-characterized association rules
ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
20 years of pattern mining: a bibliometric survey
ACM SIGKDD Explorations Newsletter
Hi-index | 0.00 |
We focus on confidence-bounded association rules; we model a rather practical situation in which the confidence threshold is fixed by the user, as usually happens in applications. Within this model, we study notions of redundancy among association rules from a fundamental perspective: we discuss several existing alternative definitions and provide new characterizations and relationships between them. We show that these alternatives correspond actually to just two variants, which differ in the special treatment of full-confidence implications. For each of these two notions of redundancy, we show how to construct complete bases of absolutely minimum size.