Structural learning of Bayesian networks from complete data using the scatter search documents

@article{DjanSampson2004StructuralLO,
  title={Structural learning of Bayesian networks from complete data using the scatter search documents},
  author={Patrick O. Djan-Sampson and Ferat Sahin},
  journal={2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583)},
  year={2004},
  volume={4},
  pages={3619-3624 vol.4}
}
Bayesian networks are directed acyclic graphs that model the dependency relationships between variables of interest. These networks are characterized by the structure of the network and the conditional probabilities that specify the dependencies that exist between the variables. In this paper, the scatter search optimization algorithm is utilized in learning the structure of the Bayesian network from complete data. This involves a heuristic search for the best network structure that maximizes a… Expand
Learning Bayesian networks from incomplete databases using a novel evolutionary algorithm
This paper proposes a novel method for learning Bayesian networks from incomplete databases in the presence of missing values, which combines an evolutionary algorithm with the traditionalExpand
Evaluation of Bayesian Network Structure Learning Using Elephant Swarm Water Search Algorithm
Bayesian networks are useful analytical models for designing the structure of knowledge in machine learning which can represent probabilistic dependency relationships among the variables. The authorsExpand
Distributed Particle Swarm Optimization for Structural Bayesian Network Learning
TLDR
Particle Swarm Optimization was first introduced as a concept for a non-linear optimizer by Kennedy and Eberhart in 1995 and it was stated that the simulation of the graceful but unpredictable choreography of a bird flock by collision-proof agents could be used as an effective optimizer for a wide range of functions. Expand
Structure Learning of Bayesian Networks Using Elephant Swarm Water Search Algorithm
TLDR
The Bayesian Network, Elephant Swarm, Global Search, Local Search, Search and Score Structure Learning, Water Search. Expand
SCATTER SEARCH METHOD FOR SOLVING INDUSTRIAL PROBLEMS : LITERATURE SURVEY
The evolutionary approach called scatter search is originated from strategies for creating composite decision rules and surrogate constraints. Recent studies demonstrate the practical advantages ofExpand
A Primer for Agent-Based Simulation and Modeling in Transportation Applications
Agent-based modeling and simulation (ABMS) methods have been applied across a spectrum of domains within transportation studies. Different paradigms for ABMS in transportation exist; in general ABMSExpand
A neural network-based method for risk factor analysis of West Nile virus.
TLDR
A neural network model was developed for analysis of risk factors in WNV infection and is tested with the dead bird surveillance data in Ontario, Canada, demonstrating the effectiveness of the proposed approach. Expand
Integrated Human Decision Behavior Modeling under an Extended Belief-Desire-Intention Framework
TLDR
This research focuses on how a human adjusts his perception process dynamically against his performance in predicting the environment as part of his decision-planning, and proposes a new approach to represent learning in the human decision behavior under the context of the BDI framework. Expand
A Scatter Search Method for Multiobjective Fuzzy Permutation Flow Shop Scheduling Problem: A Real World Application
In this chapter, a scatter search (SS) method is proposed to solve the multiobjective permutation fuzzy flow shop scheduling problem. The objectives are minimizing the average tardiness and theExpand
A Primer for Agent-Based Simulation and Modeling in Transportation Applications
b Foreword Agent-based modeling and simulation (ABMS) methods have been applied in a spectrum of research domains. This primer focuses on ABMS in the transportation interdisciplinary domain,Expand
...
1
2
...

References

SHOWING 1-10 OF 29 REFERENCES
Learning Bayesian Networks: Search Methods and Experimental Results
TLDR
A metric for computing the relative posterior probability of a network structure given data developed by Heckerman et al. (1994a,b,c) has a property useful for inferring causation from data and is described. Expand
An evolutionary algorithmic approach to learning a Bayesian network from complete data
TLDR
It is found that allowing cyclic networks to exist in the particle swarm of candidate solutions can dramatically reduce the number of objective function evaluations required to converge to a target fitness value. Expand
Structure Learning of Bayesian Networks by Genetic Algorithms: A Performance Analysis of Control Parameters
TLDR
This work tackles the problem of the search for the best Bayesian network structure, given a database of cases, using the genetic algorithm philosophy for searching among alternative structures, by assuming an ordering between the nodes of the network structures. Expand
A Bayesian method for the induction of probabilistic networks from data
TLDR
This paper presents a Bayesian method for constructing probabilistic networks from databases, focusing on constructing Bayesian belief networks, and extends the basic method to handle missing data and hidden variables. Expand
A Guide to the Literature on Learning Probabilistic Networks from Data
The literature review presented discusses different methods under the general rubric of learning Bayesian networks from data, and includes some overlapping work on more general probabilisticExpand
A new approach for learning belief networks using independence criteria
TLDR
The proposed algorithm avoids some of the drawbacks of this approach by making an intensive use of low order conditional independence tests, and uses the set of zero- and first-order independence statements in order to obtain a prior skeleton of the network. Expand
Ant colony optimization for learning Bayesian networks
TLDR
This paper proposes a new algorithm for learning BNs based on a recently introduced metaheuristic, which has been successfully applied to solve a variety of combinatorial optimization problems: ant colony optimization (ACO). Expand
Probalistic Network Construction Using the Minimum Description Length Principle
TLDR
This paper presents a procedure for the construction of probabilistic networks from a database of observations based on the minimum description length principle, and preliminary test results show that the algorithm performs comparable to the algorithmbased on the Bayesian approach. Expand
Approximating discrete probability distributions with dependence trees
TLDR
It is shown that the procedure derived in this paper yields an approximation of a minimum difference in information when applied to empirical observations from an unknown distribution of tree dependence, and the procedure is the maximum-likelihood estimate of the distribution. Expand
The recovery of causal poly-trees from statistical data
TLDR
The method guarantees that, if the measured distributions are generated by a causal process structured as a ply-tree then the topological structure of such tree can be recovered precisely and the causal directionality of the branches can be determined up to the maximum extent possible. Expand
...
1
2
3
...