Tractability of most probable explanations in multidimensional Bayesian network classifiers
From MaRDI portal
Publication:1726375
Recommendations
- Most probable explanations in Bayesian networks: complexity and tractability
- Structure approximation of most probable explanations in Bayesian networks
- Most Inforbable Explanations: Finding Explanations in Bayesian Networks That Are Both Probable and Informative
- The complexity of finding \(k\)th most probable explanations in probabilistic networks
- Inference and Learning in Multi-dimensional Bayesian Network Classifiers
- Most frugal explanations in Bayesian networks
- Most relevant explanation in Bayesian networks
- SIMPLIFYING EXPLANATIONS IN BAYESIAN BELIEF NETWORKS
Cites work
- scientific article; zbMATH DE number 3624650 (Why is no real title available?)
- A linear time algorithm for finding tree-decompositions of small treewidth
- A scalable pairwise class interaction framework for multidimensional classification
- Algorithmic Aspects of Vertex Elimination on Graphs
- An extension on ``Statistical comparisons of classifiers over multiple data sets for all pairwise comparisons
- Complexity of Finding Embeddings in a k-Tree
- Discrete Bayesian network classifiers: a survey
- Discriminative learning of Bayesian networks via factorized conditional log-likelihood
- Heuristic and metaheuristic methods for computing graph treewidth
- Inference and Learning in Multi-dimensional Bayesian Network Classifiers
- Machine Learning: ECML 2004
- Maximum cardinality search for computing minimal triangulations of graphs
- Modified Sequentially Rejective Multiple Test Procedures
- Most probable explanations in Bayesian networks: complexity and tractability
- Multi-classifiers of small treewidth
- Multi-dimensional classification with Bayesian networks
- On exact algorithms for treewidth
- Statistical comparisons of classifiers over multiple data sets
- The elimination form of the inverse and its application to linear programming
- Trading off speed and accuracy in multilabel classification
- Tree induction for probability-based ranking
- Treewidth computation and extremal combinatorics
Cited in
(6)- Learning tractable Bayesian networks in the space of elimination orders
- Multi-classifiers of small treewidth
- Balanced sensitivity functions for tuning multi-dimensional Bayesian network classifiers
- Most probable explanations in Bayesian networks: complexity and tractability
- Most Inforbable Explanations: Finding Explanations in Bayesian Networks That Are Both Probable and Informative
- Inference and Learning in Multi-dimensional Bayesian Network Classifiers
This page was built for publication: Tractability of most probable explanations in multidimensional Bayesian network classifiers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1726375)
