Mining Meta-Actions for Action Rules Reduction

  • Authors:
  • Hakim Touati;Zbigniew W. Ras

  • Affiliations:
  • College of Computing and Informatics, University of North Carolina, Charlotte, NC 28223, USA. htouati@uncc.edu;College of Computing and Informatics, University of North Carolina, Charlotte, NC 28223, USA and Institute of Computer Science, Warsaw University of Technology, 00-665 Warsaw, Poland. ras@uncc.edu

  • Venue:
  • Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Meta-actions effect and selection are the fundamental core for a successful action rule execution. All atomic action terms on the left-hand side of an action rule have to be covered by well chosen meta-actions in order for it to be executed. The choice of meta-actions depends on the antecedent side of action rules; however, it also depends on their list of atomic actions that are outside of the action rule scope, seen as side effects. In this paper, we strive to minimize the side effects by decomposing the left-hand side of an action rule into executable action rules covered by a minimal number of meta-actions and resulting in a cascading effect. This process was tested and compared to original action rules. Experimental results show that side effects are diminished in comparison with the original meta-actions applied while keeping a good execution confidence. ding effect. This process was tested and compared to original action rules. Experimental results show that side effects are diminished in comparison with the original meta-actions applied while keeping a good execution confidence.