2004
DOI: 10.1142/s0218001404003332
|View full text |Cite
|
Sign up to set email alerts
|

Learning Bayesian Networks in the Space of Orderings With Estimation of Distribution Algorithms

Abstract: The search for the optimal ordering of a set of variables in order to solve a computational problem is a difficulty that can appear in several circumstances. One of these situations is the automatic learning of a network structure, for example, a Bayesian Network structure (BN) starting from a dataset. Searching in the space of structures is often unmanageable, especially if the number of variables is high. Popular heuristic approaches, like Cooper and Herskovits's K2 algorithm, depend on a given ordering of v… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2004
2004
2016
2016

Publication Types

Select...
5
4

Relationship

1
8

Authors

Journals

citations
Cited by 25 publications
(11 citation statements)
references
References 15 publications
0
9
0
Order By: Relevance
“…This assumption dramatically reduces the cardinality of the search to n !. Seminal works include Singh and Valtorta ( 1993 ) using conditional independence tests, Bouckaert ( 1992 ) who manipulates the ordering of the variables with operations similar to arc reversals, Larrañaga et al ( 1996a ) with a genetic algorithm-based search, and Romero et al ( 2004 ) using estimation of distribution algorithms.…”
Section: Learning Bayesian Network From Datamentioning
confidence: 99%
“…This assumption dramatically reduces the cardinality of the search to n !. Seminal works include Singh and Valtorta ( 1993 ) using conditional independence tests, Bouckaert ( 1992 ) who manipulates the ordering of the variables with operations similar to arc reversals, Larrañaga et al ( 1996a ) with a genetic algorithm-based search, and Romero et al ( 2004 ) using estimation of distribution algorithms.…”
Section: Learning Bayesian Network From Datamentioning
confidence: 99%
“…In [46] authors use two versions of EDA namely UMDA and MIMIC to obtain the VO for the K2 algorithm. Works that use VOs to learn BNs from data, which are not based on EA approaches, can be found in [46] and references therein.…”
Section: A View Into Work Related To Evolutionary Algorithms and Baymentioning
confidence: 99%
“…In (Romero et al, 2004), two approaches (UMDA and MIMIC) have been applied to the topological orders space. Individuals (i.e.…”
Section: Wwwintechopencommentioning
confidence: 99%