Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic Networks and Expert Systems
Probabilistic Networks and Expert Systems
A Guide to the Literature on Learning Probabilistic Networks from Data
IEEE Transactions on Knowledge and Data Engineering
Equivalence and synthesis of causal models
UAI '90 Proceedings of the Sixth Annual Conference on Uncertainty in Artificial Intelligence
Learning equivalence classes of bayesian-network structures
The Journal of Machine Learning Research
Learning Bayesian Networks
Distribution-free learning of Bayesian network structure in continuous domains
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Operations for learning with graphical models
Journal of Artificial Intelligence Research
Mining and visualising ordinal data with non-parametric continuous BBNs
Computational Statistics & Data Analysis
A transformational characterization of equivalent Bayesian network structures
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Hi-index | 0.00 |
Bayesian networks are graphical models that represent the joint distribution of a set of variables using directed acyclic graphs. The graph can be manually built by domain experts according to their knowledge. However, when the dependence structure is unknown (or partially known) the network has to be estimated from data by using suitable learning algorithms. In this paper, we deal with a constraint-based method to perform Bayesian networks structural learning in the presence of ordinal variables. We propose an alternative version of the PC algorithm, which is one of the most known procedures, with the aim to infer the network by accounting for additional information inherent to ordinal data. The proposal is based on a nonparametric test, appropriate for ordinal variables. A comparative study shows that, in some situations, the proposal discussed here is a slightly more efficient solution than the PC algorithm.