Action rules mining

被引:33
|
作者
Tzacheva, AA
Ras, ZW [1 ]
机构
[1] Univ N Carolina, Dept Comp Sci, Charlotte, NC 28223 USA
[2] Polish Acad Sci, Inst Comp Sci, PL-01237 Warsaw, Poland
关键词
D O I
10.1002/int.20092
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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. Anew 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. (c) 2005 Wiley Periodicals, Inc.
引用
收藏
页码:719 / 736
页数:18
相关论文
共 50 条
  • [21] Mining clusters with association rules
    Kosters, WA
    Marchiori, E
    Oerlemans, AAJ
    ADVANCES IN INTELLIGENT DATA ANALYSIS, PROCEEDINGS, 1999, 1642 : 39 - 50
  • [22] Mining negative association rules
    Yuan, XH
    Buckles, BP
    Yuan, ZS
    Zhang, J
    ISCC 2002: SEVENTH INTERNATIONAL SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS, PROCEEDINGS, 2002, : 623 - 628
  • [23] Mining Utility Association Rules
    Lee, Yue-Shi
    Yen, Show-Jane
    PROCEEDINGS OF 2018 10TH INTERNATIONAL CONFERENCE ON COMPUTER AND AUTOMATION ENGINEERING (ICCAE 2018), 2018, : 6 - 10
  • [24] Mining indirect association rules
    Hamano, S
    Sato, M
    ADVANCES IN DATA MINING: APPLICATIONS IN IMAGE MINING, MEDICINE AND BIOTECHNOLOGY, MANAGEMENT AND ENVIRONMENTAL CONTROL, AND TELECOMMUNICATIONS, 2004, 3275 : 106 - 116
  • [25] Mining quantitative association rules
    Zhu, WH
    Yin, J
    Zhou, XF
    CONCURRENT ENGINEERING: THE WORLDWIDE ENGINEERING GRID, PROCEEDINGS, 2004, : 315 - 320
  • [26] Mining generalized association rules
    Srikant, R
    Agrawal, R
    FUTURE GENERATION COMPUTER SYSTEMS, 1997, 13 (2-3) : 161 - 180
  • [27] Mining vague association rules
    Lu, An
    Ke, Yiping
    Cheng, James
    Ng, Wilfred
    ADVANCES IN DATABASES: CONCEPTS, SYSTEMS AND APPLICATIONS, 2007, 4443 : 891 - +
  • [28] Hierarchical decision rules mining
    Feng, Qinrong
    Miao, Duoqian
    Cheng, Yi
    EXPERT SYSTEMS WITH APPLICATIONS, 2010, 37 (03) : 2081 - 2091
  • [29] Parallel mining of association rules
    Agrawal, R
    Shafer, JC
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 1996, 8 (06) : 962 - 969
  • [30] Mining influential association rules
    Zhang, X
    Chen, Z
    Zhu, Q
    PROCEEDINGS OF THE 6TH JOINT CONFERENCE ON INFORMATION SCIENCES, 2002, : 490 - 493