Action rules mining

Action rules assume that attributes in a database are divided into two groups: stable and flexible. In general, an action rule can be constructed from two rules extracted earlier from the same database. Furthermore, we assume that these two rules describe two different decision classes and our goal is to reclassify objects from one of these classes into the other one. Flexible attributes are essential in achieving that goal because they provide a tool for making hints to a user about what changes within some values of flexible attributes are needed for a given group of objects to reclassify them into a new decision class. A new subclass of attributes called semi‐stable attributes is introduced. Semi‐stable attributes are typically a function of time and undergo deterministic changes (e.g., attribute age or height). So, the set of conditional attributes is partitioned into stable, semi‐stable, and flexible. Depending on the semantics of attributes, some semi‐stable attributes can be treated as flexible and the same new action rules can be constructed. These new action rules are usually built to replace some existing action rules whose confidence is too low to be of any interest to a user. The confidence of new action rules is always higher than the confidence of rules they replace. Additionally, the notion of the cost and feasibility of an action rule is introduced in this article. A heuristic strategy for constructing feasible action rules that have high confidence and possibly the lowest cost is proposed. © 2005 Wiley Periodicals, Inc. Int J Int Syst 20: 719–736, 2005.

[1]  Abraham Silberschatz,et al.  What Makes Patterns Interesting in Knowledge Discovery Systems , 1996, IEEE Trans. Knowl. Data Eng..

[2]  Zbigniew W. Ras,et al.  Action-Rules: How to Increase Profit of a Company , 2000, PKDD.

[3]  Jiawei Han,et al.  Profit Mining: From Patterns to Actions , 2002, EDBT.

[4]  Andrzej Skowron,et al.  From the Rough Set Theory to the Evidence Theory , 1991 .

[5]  Dieter Fensel,et al.  Ontologies: A silver bullet for knowledge management and electronic commerce , 2002 .

[6]  Zbigniew W. Ras,et al.  Cooperative Discovery of Interesting Action Rules , 2006, FQAS.

[7]  Salvatore Greco,et al.  Measuring expected effects of interventions based on decision rules , 2005, J. Exp. Theor. Artif. Intell..

[8]  John F. Sowa,et al.  Ontology, Metadata, and Semiotics , 2000, ICCS.

[9]  Abraham Silberschatz,et al.  On Subjective Measures of Interestingness in Knowledge Discovery , 1995, KDD.

[10]  Einoshin Suzuki,et al.  Discovery of Surprising Exception Rules Based on Intensity of Implication , 1998, PKDD.

[11]  Zbigniew W. Ras,et al.  Discovering Semantic Inconsistencies to Improve Action Rules Mining , 2003, IIS.

[12]  Jerzy W. Grzymala-Busse,et al.  The Rule Induction System LERS-a version for personal computers in Foun-dations of Computing and Dec , 1993 .

[13]  Zbigniew W. Ras,et al.  Discovering Extended Action-Rules (System DEAR) , 2003, IIS.

[14]  Zbigniew W. Ras,et al.  Action Rules Discovery, a New Simplified Strategy , 2006, ISMIS.

[15]  Andrzej Skowron,et al.  Planning Based on Reasoning About Information Changes , 2006, RSCTC.

[16]  Zdzislaw Pawlak,et al.  Rough sets and decision tables , 1984, Symposium on Computation Theory.

[17]  Gediminas Adomavicius,et al.  Discovery of Actionable Patterns in Databases: the Action Hierarchy Approach , 1997, KDD.

[18]  Zengyou He,et al.  Mining action rules from scratch , 2005, Expert Syst. Appl..

[19]  Zbigniew W. Ras,et al.  Handling Semantic Inconsistencies in Query Answering Based on Distributed Knowledge Mining , 2002, Int. J. Pattern Recognit. Artif. Intell..

[20]  Zbigniew W. Ras,et al.  Action rules discovery: system DEAR2, method and experiments , 2005, J. Exp. Theor. Artif. Intell..

[21]  Wynne Hsu,et al.  Using General Impressions to Analyze Discovered Classification Rules , 1997, KDD.

[22]  Zbigniew W. Ras,et al.  Global Action Rules in Distributed Knowledge Systems , 2002, Fundam. Informaticae.

[23]  Jerzy W. Grzymala-Busse,et al.  A New Version of the Rule Induction System LERS , 1997, Fundam. Informaticae.

[24]  Z. Pawlak.  Rough Sets: Theoretical Aspects of Reasoning about Data , 1991 .

[25]  Zbigniew W. Ras,et al.  Action Rules Discovery System DEAR_3 , 2006, ISMIS.