.png){kind=icon}
Return
Learning Bayesian Network Structures Without Variable Ordering Influence: A Markov Blanket-Based Approach
.png){kind=icon}
PRE
AI
DOI：10.1111/coin.70175.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Several methods in the literature address the discovery, from data, of a directed acyclic graph that is the structure of a Bayesian network. This is a challenging task, due to the combinatorial nature of the space of graphs, which grows exponentially with the number of variables. This paper proposes a new method to learn Bayesian network structures, based on Markov blankets. The proposed method, called DMBBN (Dynamic Markov Blanket Bayesian Network), builds a graph from a set of local structures that are induced based on the Markov blanket of each variable of interest. The local structures are combined to generate a single Bayesian network structure, without repetition of nodes and without cycles. The experiments carried out show that DMBBN is promising, especially in large datasets, as it does not depend on a prior ordering of the variables.
Keywords:
Bayesian networks
Markov blanket
structure learning
Journal
C
IF:
1.7
Papers:
113
Citations:
1.6K
Organization
Cited Papers
.png){kind=icon}
Who learns better Bayesian network structures: Accuracy and speed of structure learning algorithms
OAAI
OAAIShareSave
ShareSaveShareSaveCOMBINING MICROARRAYS AND BIOLOGICAL KNOWLEDGE FOR ESTIMATING GENE NETWORKS VIA BAYESIAN NETWORKS
PREAI
ShareSaveLEARNING BAYESIAN NETWORKS IN THE SPACE OF ORDERINGS WITH ESTIMATION OF DISTRIBUTION ALGORITHMS
PREAI
ShareSaveShareSave
View more