Generating Hierarchical Association Rules with the Use of Bayesian Network

被引:0
作者
Iqbal, Khalid [1 ]
Asghar, Sohail [2 ]
机构
[1] Shaheed Zulfikar Ali Bhutto Inst Sci & Technol, Dept Comp Sci, Islamabad, Pakistan
[2] Mohammad Ali Jinnah Univ, Fac Engn & Appl Sci, Dept Comp Sci, Islamabad, Pakistan
来源
NSS: 2009 3RD INTERNATIONAL CONFERENCE ON NETWORK AND SYSTEM SECURITY | 2009年
关键词
Association Rules; BSM; Bayesian Network;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Bayesian Network (BN) is used to build a model using a probability distribution over a set of variables. The benefit of BN is the compact representation of complex problem domains. Also, BN provides decision making, smooth, consistent and flexible applicability in the complex domains. On the other hand, association rules are based on antecedent and consequent part which have condition attributes and decision attributes respectively. Each association rule has a confidence percentage value which shows the rule effectiveness in terms of probability. Thus, association rules and Bayesian Network can be linked up due to probabilistic approach. Therefore, we focus on association rules to develop an automated data mining technique with the use of Bayesian Network For this purpose, we suggested Associated Rules Binary Symmetric Matrix using K2 (ARBSM-K2) technique in order to generate Hierarchical Association Rules (HAR). This structure shows the relations among the association rules which show more certainty in the hierarchy after maximizing the probability for each association rule treated as a node. Hence, this hierarchy may open new research dimensions to academia community by refining the existing techniques with the latest techniques to further obtain knowledge in any domain. Thus, the significance of the paper is to utilize it for fraud detection from the start to the end showing all steps in sequence.
引用
收藏
页码:528 / +
页数:2
相关论文
共 11 条
  • [1] BRESSAN, 2009, ENG APPL ARTIF INTEL, P579
  • [2] A BAYESIAN METHOD FOR THE INDUCTION OF PROBABILISTIC NETWORKS FROM DATA
    COOPER, GF
    HERSKOVITS, E
    [J]. MACHINE LEARNING, 1992, 9 (04) : 309 - 347
  • [3] DOGUC O, 2008, P REL ENG SYST SAF
  • [4] Fauré C, 2006, LECT NOTES ARTIF INT, V4248, P326
  • [5] GUO HP, AAAI 02 P
  • [6] A slot allocation strategy for clustered ad hoc networks
    Huang, Tsung-Chuan
    Yao, Chin-Yi
    [J]. INTERNATIONAL JOURNAL OF AD HOC AND UBIQUITOUS COMPUTING, 2007, 2 (01) : 3 - 11
  • [7] Lamma E, 2004, FR ART INT, V110, P500
  • [8] LAMMA E, IMPROVING K2 ALGORIT
  • [9] Learning Bayesian network structures by searching for the best ordering with genetic algorithms
    Larranaga, P
    Kuijpers, CMH
    Murga, RH
    Yurramendi, Y
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 1996, 26 (04): : 487 - 493
  • [10] RUIZ C, ILLUSTRATION K2 ALGO