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

被引：19

作者：

Cano, Andres ^{[1
]}

Gomez, Manuel ^{[1
]}

Moral, Serafin ^{[1
]}

Abellan, Joaquin ^{[1
]}

机构：

[1] Univ Granada, ETS Ingn Informat, Dept Comp Sci & Artificial Intelligence, E-18071 Granada, Spain

来源：

INTERNATIONAL JOURNAL OF APPROXIMATE REASONING | 2007年 / 44卷 / 03期

关键词：

credal network; probability intervals; Bayesian networks; strong independence; hill-climbing; branch-and-bound algorithms;

D O I：

10.1016/j.ijar.2006.07.020

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

This paper proposes two new algorithms for inference in credal networks. These algorithms enable probability intervals to be obtained for the states of a given query variable. The first algorithm is approximate and uses the hill-climbing technique in the Shenoy-Shafer architecture to propagate in join trees; the second is exact and is a modification of Rocha and Cozman's branch-and-bound algorithm, but applied to general directed acyclic graphs, (C) 2006 Elsevier Inc. All rights reserved.

引用

页码：261 / 280

页数：20

共 50 条

[21] Immunization of complex networks using stochastic hill-climbing algorithm
Shams, Bita
Khansari, Mohammad
[J]. PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON COMPUTER AND KNOWLEDGE ENGINEERING (ICCKE 2013), 2013, : 283 - 288
[22] Handling Lower Bound and Hill-Climbing Strategies for Sphere Packing Problems
Hifi, Mhand
Yousef, Labib
[J]. RECENT ADVANCES IN COMPUTATIONAL OPTIMIZATION: RESULTS OF THE WORKSHOP ON COMPUTATIONAL OPTIMIZATION WCO 2014, 2016, 610 : 145 - 164
[23] Genetic and hill-climbing algorithms for high power laser beam correction
Sheldakova, JV
Cherezova, TY
Kudryashov, AV
[J]. TOPICAL PROBLEMS OF NONLINEAR WAVE PHYSICS, 2006, 5975
[24] POWER OF DOMINANCE RELATIONS IN BRANCH-AND-BOUND ALGORITHMS
IBARAKI, T
[J]. JOURNAL OF THE ACM, 1977, 24 (02) : 264 - 279
[25] Comparison of hill-climbing and genetic algorithms for digital predistortion models sizing
Wang, Siqi
Hussein, Mazen Abi
Baudoin, Genevieve
Venard, Olivier
Gotthans, Tomas
[J]. 23RD IEEE INTERNATIONAL CONFERENCE ON ELECTRONICS CIRCUITS AND SYSTEMS (ICECS 2016), 2016, : 289 - 292
[26] Branch-and-bound algorithms for the test cover problem
De Bontridder, KMJ
Lageweg, BJ
Lenstra, JK
Orlin, JB
Stougie, L
[J]. ALGORITHMS-ESA 2002, PROCEEDINGS, 2002, 2461 : 223 - 233
[27] COPING WITH ANOMALIES IN PARALLEL BRANCH-AND-BOUND ALGORITHMS
LI, GJ
WAH, BW
[J]. IEEE TRANSACTIONS ON COMPUTERS, 1986, 35 (06) : 568 - 573
[28] Probabilistic subproblem selection in branch-and-bound algorithms
Dür, M
Stix, V
[J]. JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2005, 182 (01) : 67 - 80
[29] On the hybridization of memetic algorithms with branch-and-bound techniques
Gallardo, Jose E.
Cotta, Carlos
Fernandez, Antonio J.
[J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2007, 37 (01): : 77 - 83
[30] EFFICIENT MODULAR IMPLEMENTATION OF BRANCH-AND-BOUND ALGORITHMS
JOHNSON, RV
[J]. DECISION SCIENCES, 1988, 19 (01) : 17 - 38

← 1 2 3 4 5 →