Selective Augmented Bayesian Network Classifiers Based on Rough Set Theory
Author(s) -
Zhihai Wang,
Geoffrey I. Webb,
Fei Zheng
Publication year - 2004
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
DOI - 10.1007/978-3-540-24775-3_40
Subject(s) - computer science , naive bayes classifier , classifier (uml) , rough set , bayesian network , bayes error rate , artificial intelligence , machine learning , bayesian programming , data mining , pattern recognition (psychology) , extension (predicate logic) , computation , independence (probability theory) , bayes' theorem , bayesian probability , bayes classifier , algorithm , mathematics , support vector machine , bayes factor , statistics , programming language
The naive Bayes classifier is widely used in interactive appli- cations due to its computational efficiency, direct theoretical base, and competitive accuracy. However, its attribute independence assumption can result in sub-optimal accuracy. A number of techniques have explored simple relaxations of the attribute independence assumption in order to increase accuracy. TAN is a state-of-the-art extension of naive Bayes, that can express limited forms of inter-dependence among attributes. Rough sets theory provides tools for expressing inexact or partial depen- dencies within dataset. In this paper, we present a variant of TAN using rough sets theory and compare their tree classifier structures, which can be thought of as a selective restricted trees Bayesian classifier. It delivers lower error than both pre-existing TAN-based classifiers, with substan- tially less computation than is required by the SuperParent approach.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom