scholarly journals On using Bayesian networks for complexity reduction in decision trees

2009 ◽  
Vol 19 (1) ◽  
pp. 127-139 ◽  
Author(s):  
Adriana Brogini ◽  
Debora Slanzi
Author(s):  
Therese M. Donovan ◽  
Ruth M. Mickey

In the “Once-ler Problem,” the decision tree is introduced as a very useful technique that can be used to answer a variety of questions and assist in making decisions. This chapter builds on the “Lorax Problem” introduced in Chapter 19, where Bayesian networks were introduced. A decision tree is a graphical representation of the alternatives in a decision. It is closely related to Bayesian networks except that the decision problem takes the shape of a tree instead. The tree itself consists of decision nodes, chance nodes, and end nodes, which provide an outcome. In a decision tree, probabilities associated with chance nodes are conditional probabilities, which Bayes’ Theorem can be used to estimate or update. The calculation of expected values (or expected utility) of competing alternative decisions is provided on a step-by-step basis with an example from The Lorax.


Author(s):  
Ahmad Bashir ◽  
Latifur Khan ◽  
Mamoun Awad

A Bayesian network is a graphical model that finds probabilistic relationships among variables of a system. The basic components of a Bayesian network include a set of nodes, each representing a unique variable in the system, their inter-relations, as indicated graphically by edges, and associated probability values. By using these probabilities, termed conditional probabilities, and their interrelations, we can reason and calculate unknown probabilities. Furthermore, Bayesian networks have distinct advantages compared to other methods, such as neural networks, decision trees, and rule bases, which we shall discuss in this paper.


2006 ◽  
Vol 175 (1) ◽  
pp. 16-34 ◽  
Author(s):  
Davy Janssens ◽  
Geert Wets ◽  
Tom Brijs ◽  
Koen Vanhoof ◽  
Theo Arentze ◽  
...  

Author(s):  
Iñigo Monedero ◽  
Félix Biscarri ◽  
Carlos León ◽  
Juan I. Guerrero ◽  
Jesús Biscarri ◽  
...  

Author(s):  
Ahmed Chaouki Lokbani ◽  
Ahmed Lehireche ◽  
Reda Mohamed Hamou ◽  
Abdelmalek Amine

Given the increasing number of users of computer systems and networks, it is difficult to know the profile of the latter, and therefore, intrusion has become a highly prized area of network security. In this chapter, to address the issues mentioned above, the authors use data mining techniques, namely association rules, decision trees, and Bayesian networks. The results obtained on the KDD'99 benchmark have been validated by several evaluation measures and are promising and provide access to other techniques and hybridization to improve the security and confidentiality in the field.


2009 ◽  
Vol 9 (4) ◽  
pp. 1331-1342 ◽  
Author(s):  
Nicandro Cruz-Ramírez ◽  
Héctor-Gabriel Acosta-Mesa ◽  
Humberto Carrillo-Calvet ◽  
Rocío-Erandi Barrientos-Martínez

Sign in / Sign up

Export Citation Format

Share Document