A common approach for learning Bayesian networks (BNs) from data is based on the use of a scoring metric to evaluate the fitness of any given candidate network to the data and a method to explore the search space, which usually is the set of directed acyclic graphs (DAGs). The most efficient search
Priors on network structures. Biasing the search for Bayesian networks
β Scribed by Robert Castelo; Arno Siebes
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 309 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0888-613X
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper we show how a user can inΒ―uence recovery of Bayesian networks from a database by specifying prior knowledge. The main novelty of our approach is that the user only has to provide partial prior knowledge, which is then completed to a full prior over all possible network structures. This partial prior knowledge is expressed among variables in an intuitive pairwise way, which embodies the uncertainty of the user about his/her own prior knowledge. Thus, the uncertainty of the model is updated in the normal Bayesian way.
π SIMILAR VOLUMES
A Bayesian probabilistic approach is presented for smart structures monitoring (damage detection) based on the pattern matching approach utilizing dynamic data. Artificial neural networks (ANNs) are employed as tools for matching the "damage patterns" for the purpose of detecting damage locations an