The Closed Keys Base of Frequent Itemsets
DaWaK 2000 Proceedings of the 4th International Conference on Data Warehousing and Knowledge Discovery
Concise Representations of Association Rules
Proceedings of the ESF Exploratory Workshop on Pattern Detection and Discovery
Constraining and summarizing association rules in medical data
Knowledge and Information Systems
Comparing association rules and decision trees for disease prediction
HIKM '06 Proceedings of the international workshop on Healthcare information and knowledge management
A new and useful syntactic restriction on rule semantics for tabular datasets
ICFCA'07 Proceedings of the 5th international conference on Formal concept analysis
Two measures of objective novelty in association rule mining
PAKDD'09 Proceedings of the 13th Pacific-Asia international conference on Knowledge discovery and data mining: new frontiers in applied data mining
Association reducts: a framework for mining multi-attribute dependencies
ISMIS'05 Proceedings of the 15th international conference on Foundations of Intelligent Systems
Formal and computational properties of the confidence boost of association rules
ACM Transactions on Knowledge Discovery from Data (TKDD)
| Hi-index | 0.00 |
We define the concept of the representative basic for interesting association rules, and an inference system which is purely qualitative. The representative basis is unique, and minimal with respect to (wrt) the inference system. On the representative basis, the inference system is correct and complete. Experimental results show that the number of rule in the representative basis is significantly reduced wrt the number of rules generated by other existing approaches.