Fusion, propagation, and structuring in belief networks
Artificial Intelligence
Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
HUGIN—a shell for building Bayesian belief universes for expert systems
Readings in uncertain reasoning
International Journal of Approximate Reasoning
Introduction to Bayesian Networks
Introduction to Bayesian Networks
Computing Marginals from the Marginal Representation in Markov Trees
IPMU'94 Selected papers from the 5th International Conference on Processing and Management of Uncertainty in Knowledge-Based Systems, Advances in Intelligent Computing
Searching for the best elimination sequence in Bayesian networks by using ant colony optimization
Pattern Recognition Letters
Technologies for constructing intelligent systems
Tree consistency and bounds on the performance of the max-product algorithm and its generalizations
Statistics and Computing
Coarticulation: an approach for generating concurrent plans in Markov decision processes
ICML '05 Proceedings of the 22nd international conference on Machine learning
Generalized value decomposition and structured multiattribute auctions
Proceedings of the 8th ACM conference on Electronic commerce
Adaptive preference elicitation for top-K recommendation tasks using GAI-networks
AIAP'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: artificial intelligence and applications
Journal of Biomedical Informatics
BayesChess: A computer chess program based on Bayesian networks
Pattern Recognition Letters
Measuring uncertainty in graph cut solutions
Computer Vision and Image Understanding
Thermal switching error versus delay tradeoffs in clocked QCA circuits
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Automatic parameter tuning with a Bayesian case-based reasoning system. A case of study
Expert Systems with Applications: An International Journal
Preference aggregation with graphical utility models
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
CUI networks: a graphical representation for conditional utility independence
Journal of Artificial Intelligence Research
Sequentially finding the N-best list in hidden Markov models
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Fast recommendations using GAI models
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Multiattribute auctions based on generalized additive independence
Journal of Artificial Intelligence Research
Probabilistic graphical models in artificial intelligence
Applied Soft Computing
Decision making with multiple objectives using GAI networks
Artificial Intelligence
Skeleton Search: Category-Specific Object Recognition and Segmentation Using a Skeletal Shape Model
International Journal of Computer Vision
Abductive plan recognition by extending Bayesian logic programs
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part II
Inferring laser-scan matching uncertainty with conditional random fields
Robotics and Autonomous Systems
Inference in hybrid networks: theoretical limits and practical algorithms
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
Abductive inference in bayesian networks: finding a partition of the explanation space
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part II
Bucket and mini-bucket schemes for m best solutions over graphical models
GKR'11 Proceedings of the Second international conference on Graph Structures for Knowledge Representation and Reasoning
Algorithms for generating ordered solutions for explicit and/or structures
Journal of Artificial Intelligence Research
Diverse M-best solutions in markov random fields
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part V
A review on evolutionary algorithms in Bayesian network learning and inference tasks
Information Sciences: an International Journal
Algorithms for generating ordered solutions for explicit AND/OR structures: extended abstract
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
A probabilistic expert system provides a graphical representation of a joint probability distribution which enables local computations of probabilities. Dawid (1992) provided a ’flow- propagation‘ algorithm for finding the most probable configuration of the joint distribution in such a system. This paper analyses that algorithm in detail, and shows how it can be combined with a clever partitioning scheme to formulate an efficient method for finding the M most probable configurations. The algorithm is a divide and conquer technique, that iteratively identifies the M most probable configurations.