2007
DOI: 10.1007/978-3-540-74377-4_31
|View full text |Cite
|
Sign up to set email alerts
|

Two Evolutionary Methods for Learning Bayesian Network Structures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0
7

Year Published

2009
2009
2020
2020

Publication Types

Select...
4
3
1

Relationship

2
6

Authors

Journals

citations
Cited by 13 publications
(18 citation statements)
references
References 11 publications
0
11
0
7
Order By: Relevance
“…For example, following on from the online algorithm of , Tian et al (2001) have a procedure (IEMA) that combines an evolutionary algorithm and the expectation-maximization procedure to learn structure in the context of hidden variables. Finally, Delaplace et al (2006) showcase a refined GA, which includes tabu search and a dynamic mutation rate. Morales et al (2004) use a fuzzy system that combines the values of different scoring criteria, while performing a GA search.…”
Section: Genetic and Evolutionary Algorithmsmentioning
confidence: 99%
“…For example, following on from the online algorithm of , Tian et al (2001) have a procedure (IEMA) that combines an evolutionary algorithm and the expectation-maximization procedure to learn structure in the context of hidden variables. Finally, Delaplace et al (2006) showcase a refined GA, which includes tabu search and a dynamic mutation rate. Morales et al (2004) use a fuzzy system that combines the values of different scoring criteria, while performing a GA search.…”
Section: Genetic and Evolutionary Algorithmsmentioning
confidence: 99%
“…First we learn the structure of the network by genetic algorithms proposed by Delaplace et al [22]. These are evolutionary algorithms, but in our case they have provided stable results (for a given dataset multiple invocations always returned identical network structures).…”
Section: Learning Phasementioning
confidence: 99%
“…We use a Bayesian network for symbol recognition. This network is learned from underlying training data by using the quite recently proposed genetic algorithms for Bayesian network learning by Delaplace et al [12]. A query symbol is classified by using Bayesian probabilistic inference (on encoded joint probability distribution).We have selected the features in signature very carefully to best suit them to linear graphic symbols and to restrict their number to minimum; as Bayesian network algorithms are known to perform better for a smaller number of nodes.…”
Section: Originality Of Our Approachmentioning
confidence: 99%