Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Theory refinement on Bayesian networks
Proceedings of the seventh conference (1991) on Uncertainty in artificial intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Adaptive Probabilistic Networks with Hidden Variables
Machine Learning - Special issue on learning with probabilistic representations
Learning Bayesian networks from data: an information-theory based approach
Artificial Intelligence
IBERAMIA 2002 Proceedings of the 8th Ibero-American Conference on AI: Advances in Artificial Intelligence
Improved learning of Bayesian networks
UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Learning equivalence classes of bayesian-network structures
The Journal of Machine Learning Research
Journal of Artificial Intelligence Research
Comparing Bayesian network classifiers
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
A transformational characterization of equivalent Bayesian network structures
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Learning Bayesian network structures by searching for the best ordering with genetic algorithms
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Conditional independence structure and its closure: Inferential rules and algorithms
International Journal of Approximate Reasoning
Learning Bayesian network equivalence classes with Ant Colony optimization
Journal of Artificial Intelligence Research
IPMU'10 Proceedings of the Computational intelligence for knowledge-based systems design, and 13th international conference on Information processing and management of uncertainty
Acyclic directed graphs representing independence models
International Journal of Approximate Reasoning
On open questions in the geometric approach to structural learning Bayesian nets
International Journal of Approximate Reasoning
SemCaDo: a serendipitous strategy for learning causal Bayesian networks using ontologies
ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
Review: learning bayesian networks: Approaches and issues
The Knowledge Engineering Review
A dynamic bayesian network based structural learning towards automated handwritten digit recognition
HAIS'10 Proceedings of the 5th international conference on Hybrid Artificial Intelligence Systems - Volume Part I
DBN-based structural learning and optimisation for automated handwritten character recognition
Pattern Recognition Letters
Conservative independence-based causal structure learning in absence of adjacency faithfulness
International Journal of Approximate Reasoning
Score-based methods for learning Markov boundaries by searching in constrained spaces
Data Mining and Knowledge Discovery
A Multi-Objective Evolutionary Algorithm for enhancing Bayesian Networks hybrid-based modeling
Computers & Mathematics with Applications
Software project risk analysis using Bayesian networks with causality constraints
Decision Support Systems
Hi-index | 0.00 |
The use of several types of structural restrictions within algorithms for learning Bayesian networks is considered. These restrictions may codify expert knowledge in a given domain, in such a way that a Bayesian network representing this domain should satisfy them. The main goal of this paper is to study whether the algorithms for automatically learning the structure of a Bayesian network from data can obtain better results by using this prior knowledge. Three types of restrictions are formally defined: existence of arcs and/or edges, absence of arcs and/or edges, and ordering restrictions. We analyze the possible interactions between these types of restrictions and also how the restrictions can be managed within Bayesian network learning algorithms based on both the score+search and conditional independence paradigms. Then we particularize our study to two classical learning algorithms: a local search algorithm guided by a scoring function, with the operators of arc addition, arc removal and arc reversal, and the PC algorithm. We also carry out experiments using these two algorithms on several data sets.