Objective Bayesian Nets for Integrating Consistent Datasets
From MaRDI portal
Publication:5094018
DOI10.1613/jair.1.13363OpenAlexW4281739710MaRDI QIDQ5094018
Publication date: 2 August 2022
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1613/jair.1.13363
Related Items
Logical perspectives on the foundations of probability ⋮ Rules of proof for maximal entropy inference ⋮ A further step for efficient corrections of inconsistent probabilistic data sets ⋮ Determining maximal entropy functions for objective Bayesian inductive logic
Cites Work
- Objective Bayesianism and the maximum entropy principle
- Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood
- On the applicability of the ``number of possible states argument in multi-expert reasoning
- Combining probabilistic logic programming with the power of maximum entropy
- Minimal triangulations of graphs: a survey
- The max-min hill-climbing Bayesian network structure learning algorithm
- A note on the inevitability of maximum entropy
- Innovations in Bayesian networks. Theory and applications
- The multidimensional maximum entropy moment problem: a review on numerical methods
- Characterizing the principle of minimum cross-entropy within a conditional-logical framework
- In defense of the maximum entropy inference process
- Maximum likelihood bounded tree-width Markov networks
- Maximum cardinality search for computing minimal triangulations of graphs
- A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
- High-dimensional consistency in score-based and hybrid structure learning
- Who learns better Bayesian network structures: accuracy and speed of structure learning algorithms
- Statistical matching of multiple sources: A look through coherence
- Incidence matrices and interval graphs
- Belief revision and information fusion on optimum entropy
- Information Theory and Statistical Mechanics
- In Defence of Objective Bayesianism
- Introduction to Meta‐Analysis
- Efficient Markov Network Structure Discovery Using Independence Tests
- An efficient algorithm to compute maximum entropy densities
- The Uncertain Reasoner's Companion
- Probability Theory
- Parameterized Complexity Results for Exact Bayesian Network Structure Learning
- Explainable Deep Learning: A Field Guide for the Uninitiated
- Jointly Interventional and Observational Data: Estimation of Interventional Markov Equivalence Classes of Directed Acyclic Graphs
- A wide-range algorithm for minimal triangulation from an arbitrary ordering
- Statistical Matching
- Efficient numerical approximation of maximum entropy estimates
- A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration
- ON FILLING-IN MISSING CONDITIONAL PROBABILITIES IN CAUSAL NETWORKS
- A note on the infeasibility of some inference processes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
