Constraint Based Action Rule Discovery with Single Classification Rules

  • Authors:
  • Angelina Tzacheva;Zbigniew W. Raś

  • Affiliations:
  • University of South Carolina Upstate, Department of Informatics, Spartanburg, SC 29303,;University of North Carolina at Charlotte, Department of Computer Science, Charlotte, N.C. 28223, and Polish-Japanese Institute of Information Technology, 02-008 Warsaw, Poland

  • Venue:
  • RSFDGrC '07 Proceedings of the 11th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Action rules can be seen as an answer to the question: what one can do with results of data mining and knowledge discovery? Some applications include: medical field, e-commerce, market basket analysis, customer satisfaction, and risk analysis. Action rules are logical terms describing knowledge about possible actions associated with objects, which is hidden in a decision system. Classical strategy for discovering them from a database requires prior extraction of classification rules which next are evaluated pair by pair with a goal to suggest an action, based on condition features in order to get a desired effect on a decision feature. An actionable strategy is represented as a term $r = [(\omega) \wedge (\alpha \rightarrow \beta)] \Rightarrow [\phi \rightarrow \psi]$, where ï戮驴, ï戮驴, β, ï戮驴, and ï戮驴are descriptions of objects or events. The term rstates that when the fixed condition ï戮驴is satisfied and the changeable behavior (ï戮驴ï戮驴β) occurs in objects represented as tuples from a database so does the expectation (ï戮驴ï戮驴ï戮驴). With each object a number of actionable strategies can be associated and each one of them may lead to different expectations and the same to different re-classifications of objects. In this paper we will focus on a new strategy of constructing action rules directly from single classification rules instead of pairs of classification rules. It presents a gain on the simplicity of the method of action rules construction, as well as on its time complexity. We present A*-type heuristic strategy for discovering only interesting action rules, which satisfy user-defined constraints such as: feasibility, maximal cost, and minimal confidence. We, therefore, propose a new method for fast discovery of interesting action rules.