Mining of Frequent Action Rules

被引:7
|
作者
Dardzinska, Agnieszka [1 ]
Romaniuk, Anna [1 ]
机构
[1] Bialystok Tech Univ, Dept Mech & Comp Sci, Ul Wiejska 45a, PL-15351 Bialystok, Poland
关键词
Action rules; Association; Action base; FP-growth; Frequent action tree; Decision system; Information system; Diabetic;
D O I
10.1007/978-3-319-30315-4_8
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
An action rule is constructed as a series of changes, or actions, which can be made to some of the flexible characteristics of the information system that ultimately triggers a change in the targeted attribute. The existing action rules discovery methods consider the input decision system as their search domain and are limited to expensive and ambiguous strategies. In this paper, we define and propose the notion of action base as the search domain for actions, and then propose a strategy based on the FP-Growth algorithm to achieve high performance in action rules extraction. This method was initially tested on real medical diabetic database. The obtained results are quite promising.
引用
收藏
页码:87 / 95
页数:9
相关论文
共 50 条
  • [21] Mining Traditional Association Rules using Frequent Itemsets Lattice
    Vo, Bay
    Le, Bac
    CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2009, : 1401 - +
  • [22] Mining Layered Grammar Rules for Action Recognition
    Wang, Liang
    Wang, Yizhou
    Gao, Wen
    INTERNATIONAL JOURNAL OF COMPUTER VISION, 2011, 93 (02) : 162 - 182
  • [23] Mining Layered Grammar Rules for Action Recognition
    Liang Wang
    Yizhou Wang
    Wen Gao
    International Journal of Computer Vision, 2011, 93 : 162 - 182
  • [24] Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy
    Daniel Kunkle
    张冬晖
    Gene Cooperman
    JournalofComputerScience&Technology, 2008, 23 (01) : 77 - 102
  • [25] Mining Opened Frequent Itemsets to Generate Maximal Boolean Association Rules
    Jiang, Baoqing
    Han, Chong
    Li, Lingsheng
    2009 IEEE INTERNATIONAL CONFERENCE ON GRANULAR COMPUTING ( GRC 2009), 2009, : 274 - 277
  • [26] arules -: A computational environment for mining association rules and frequent item sets
    Hahsler, M
    Grün, B
    Hornik, K
    JOURNAL OF STATISTICAL SOFTWARE, 2005, 14 (15):
  • [27] MINING MOST GENERALIZATION ASSOCIATION RULES BASED ON FREQUENT CLOSED ITEMSET
    Vo, Bay
    Hong, Tzung-Pei
    Le, Bac
    INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2012, 8 (10B): : 7117 - 7132
  • [28] Association Rules Mining Based on Minimal Generator of Frequent Closed Itemset
    Chen, Xiao-mei
    Wang, Chang-ying
    Cao, Han
    ECOSYSTEM ASSESSMENT AND FUZZY SYSTEMS MANAGEMENT, 2014, 254 : 275 - 282
  • [29] Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy
    Daniel Kunkle
    Donghui Zhang
    Gene Cooperman
    Journal of Computer Science and Technology, 2008, 23 : 77 - 102
  • [30] Algorithm for mining negative association rules based on frequent pattern tree
    Zhu, Yuquan
    Sun, Lei
    Yang, Hebiao
    Song, Yuqing
    Jisuanji Gongcheng/Computer Engineering, 2006, 32 (22): : 51 - 52