Efficient mining of emerging patterns: discovering trends and differences
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Detecting Group Differences: Mining Contrast Sets
Data Mining and Knowledge Discovery
Machine Learning
Classification Rule Learning with APRIORI-C
EPIA '01 Proceedings of the10th Portuguese Conference on Artificial Intelligence on Progress in Artificial Intelligence, Knowledge Extraction, Multi-agent Systems, Logic Programming and Constraint Solving
Subgroup Discovery with CN2-SD
The Journal of Machine Learning Research
Advances in frequent itemset mining implementations: report on FIMI'03
ACM SIGKDD Explorations Newsletter - Special issue on learning from imbalanced datasets
Mining Non-Redundant Association Rules
Data Mining and Knowledge Discovery
Learning Rules from Highly Unbalanced Data Sets
ICDM '04 Proceedings of the Fourth IEEE International Conference on Data Mining
Essential classification rule sets
ACM Transactions on Database Systems (TODS)
Data Mining: Practical Machine Learning Tools and Techniques, Second Edition (Morgan Kaufmann Series in Data Management Systems)
Expert-guided subgroup discovery: methodology and application
Journal of Artificial Intelligence Research
The Journal of Machine Learning Research
Feature construction based on closedness properties is not that simple
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
Hi-index | 0.00 |
Closed sets are being successfully applied in the context of compacted data representation for association rule learning. However, their use is mainly descriptive. This paper shows that, when considering labeled data, closed sets can be adapted for prediction and discrimination purposes by conveniently contrasting covering properties on positive and negative examples. We formally justify that these sets characterize the space of relevant combinations of features for discriminating the target class. In practice, identifying relevant/irrelevant combinations of features through closed sets is useful in many applications. Here we apply it to compacting emerging patterns and essential rules and to learn descriptions for subgroup discovery.