Subjective measures, used to model interestingness of rules, are user-driven, domain-dependent, and include unexpectedness, novelty and actionability (Adomavicius and Tuzhilin 1997, Liu et al. 1997, Silberschatz and Tuzhilin 1995). Liu et al. (1997) define a rule as actionable, if a user can do an action to his/her advantage based on that rule. Their notion of actionability is too vague and leaves the door open to a number of different interpretations. Raś and Wieczorkowska (2000) assume that actionability has to be expressed in terms of attributes that are present in the database. They have introduced a new class of rules (called action rules) that are constructed from certain pairs of association rules extracted from that database. A conceptually similar definition of an action rule was proposed independently by Geffner and Wainer (1998). Action rules have been investigated further in Raś and Gupta (2002), Raś and Tsay (2003), Raś et al. (2005) and Tzacheva and Raś (2004). In order to construct action rules, it is required that attributes in a database are divided into two groups: stable and flexible. Flexible attributes are used in a decision rule as a tool for making hints to a user what changes within some of their values are needed to reclassify a group of objects from one decision class into another one. Two strategies for generating action rules are presented. The first one, implemented as system DEAR, generates action rules from certain pairs of association rules. The second one, implemented as system DEAR2, is based on a tree structure that partitions the set of rules, having the same decision value, into equivalence classes each labelled by values of stable attributes (two rules belong to the same equivalence class, if values of their stable attributes are not conflicting each other). Now, instead of comparing all pairs of rules, only pairs of rules belonging to some of these equivalence classes are compared to construct action rules. This strategy significantly reduces the number of steps needed to generate action rules in comparison to DEAR system.
[1]
Abraham Silberschatz,et al.
What Makes Patterns Interesting in Knowledge Discovery Systems
,
1996,
IEEE Trans. Knowl. Data Eng..
[2]
Jerzy W. Grzymala-Busse,et al.
The Rule Induction System LERS-a version for personal computers in Foun-dations of Computing and Dec
,
1993
.
[3]
Zbigniew W. Ras,et al.
Global Action Rules in Distributed Knowledge Systems
,
2002,
Fundam. Informaticae.
[4]
Jerzy W. Grzymala-Busse,et al.
A New Version of the Rule Induction System LERS
,
1997,
Fundam. Informaticae.
[5]
Lech Polkowski,et al.
Rough Sets in Knowledge Discovery 2
,
1998
.
[6]
Zbigniew W. Ras,et al.
Discovering Non-Standard Semantics of Semi-Stable Attributes
,
2003,
FLAIRS Conference.
[7]
Wynne Hsu,et al.
Using General Impressions to Analyze Discovered Classification Rules
,
1997,
KDD.
[8]
Abraham Silberschatz,et al.
On Subjective Measures of Interestingness in Knowledge Discovery
,
1995,
KDD.
[9]
Angelina A. Tzacheva,et al.
Action rules mining
,
2005,
Int. J. Intell. Syst..
[10]
Z..
INFORMATION SYSTEMS THEORETICAL FOUNDATIONS
,
2022
.
[11]
Zbigniew W. Ras,et al.
Action-Rules: How to Increase Profit of a Company
,
2000,
PKDD.
[12]
Gediminas Adomavicius,et al.
Discovery of Actionable Patterns in Databases: the Action Hierarchy Approach
,
1997,
KDD.
[13]
Jacques Wainer,et al.
Modeling Action, Knowledge and Control
,
1998,
ECAI.
[14]
Zbigniew W. Ras,et al.
Discovering Extended Action-Rules (System DEAR)
,
2003,
IIS.
[15]
Janusz Zalewski,et al.
Rough sets: Theoretical aspects of reasoning about data
,
1996
.