A new version of the rule induction system LERS
Fundamenta Informaticae
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Rough sets and boolean reasoning
Granular computing
Ontologies: A Silver Bullet for Knowledge Management and Electronic Commerce
Ontologies: A Silver Bullet for Knowledge Management and Electronic Commerce
Mining for Interesting Action Rules
IAT '05 Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology
Developing event-condition-action rules in real-time active database
Proceedings of the 2007 ACM symposium on Applied computing
Mining action rules from scratch
Expert Systems with Applications: An International Journal
ARAS: action rules discovery based on agglomerative strategy
MCD'07 Proceedings of the 3rd ECML/PKDD international conference on Mining complex data
Action rules discovery, a new simplified strategy
ISMIS'06 Proceedings of the 16th international conference on Foundations of Intelligent Systems
Action rules discovery system DEAR_3
ISMIS'06 Proceedings of the 16th international conference on Foundations of Intelligent Systems
Action Rules Discovery without Pre-existing Classification Rules
RSCTC '08 Proceedings of the 6th International Conference on Rough Sets and Current Trends in Computing
Mining Non-redundant Reclassification Rules
IEA/AIE '09 Proceedings of the 22nd International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: Next-Generation Applied Intelligence
Action Rules Discovery Based on Tree Classifiers and Meta-actions
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Action Rules and the GUHA Method: Preliminary Considerations and Results
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Hi-index | 0.00 |
In this paper, we present an algorithm that discovers action rules from a decision table. Action rules describe possible transitions of objects from one state to another with respect to a distinguished attribute. The previous research on action rule discovery required the extraction of classification rules before constructing any action rule. The new proposed algorithm does not require pre-existing classification rules, and it uses a bottom up approach to generate action rules having minimal attribute involvement.