Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks

Andrés Cano; Manuel Gómez‐Olmedo; Serafı́n Moral; Joaquín Abellán

doi:10.1016/j.ijar.2006.07.020

ScienceGate Book Chapters

JOURNAL ARTICLE

Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks

Andrés Cano Manuel Gómez‐Olmedo Serafı́n Moral Joaquín Abellán

Year: 2006 Journal: International Journal of Approximate Reasoning Vol: 44 (3)Pages: 261-280 Publisher: Elsevier BV

DOI: 10.1016/j.ijar.2006.07.020

Get Full-Text PDF Get Analytical Report

Keywords:

Inference Algorithm Directed acyclic graph Hill climbing Computer science Branch and bound Upper and lower bounds Mathematics Theoretical computer science Artificial intelligence

Metrics

Cited By

2.36

FWCI (Field Weighted Citation Impact)

Refs

0.89

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Bayesian Modeling and Causal Inference

Physical Sciences → Computer Science → Artificial Intelligence

Computational Drug Discovery Methods

Physical Sciences → Computer Science → Computational Theory and Mathematics

Machine Learning and Algorithms

Physical Sciences → Computer Science → Artificial Intelligence

Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks

Metrics

Citation History

Topics

Related Documents

Approximate Inference in Logical Credal Networks

Inference in credal networks: branch-and-bound methods and the A/R+ algorithm

Approximate algorithms for credal networks with binary variables

Exact and approximate USCP with branch and bound

Approximate graph matching using probabilistic hill climbing algorithms