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 条

[31] PARALLEL BRANCH-AND-BOUND ALGORITHMS FOR COMBINATORIAL OPTIMIZATION
PARDALOS, P
LI, XO
[J]. SUPERCOMPUTER, 1990, 7 (05): : 23 - 30
[32] PARALLEL BRANCH-AND-BOUND ALGORITHMS - SURVEY AND SYNTHESIS
GENDRON, B
CRAINIC, TG
[J]. OPERATIONS RESEARCH, 1994, 42 (06) : 1042 - 1066
[33] Approximate Inference in Credal Networks by Variational Mean Field Methods
Ide, Jaime Shinsuke
Cozman, Fabio Gagliardi
[J]. ISIPTA 05-PROCEEDINGS OF THE FOURTH INTERNATIONAL SYMPOSIUM ON IMPRECISE PROBABILITIES AND THEIR APPLICATIONS, 2005, : 203 - 212
[34] Exact Complexity Certification of Suboptimal Branch-and-Bound Algorithms for Mixed-Integer Linear Programming
Shoja, Shamisa
Axehill, Daniel
[J]. IFAC PAPERSONLINE, 2023, 56 (02): : 7428 - 7435
[35] Simultaneous generalized hill-climbing algorithms for addressing sets of discrete optimization problems
Vaughan, DE
Jacobson, SH
Hall, SN
McLay, LA
[J]. INFORMS JOURNAL ON COMPUTING, 2005, 17 (04) : 438 - 450
[36] ANALYSIS AND IMPLEMENTATION OF BRANCH-AND-BOUND ALGORITHMS ON A HYPERCUBE MULTICOMPUTER
QUINN, MJ
[J]. IEEE TRANSACTIONS ON COMPUTERS, 1990, 39 (03) : 384 - 387
[37] BRANCH-AND-BOUND ALGORITHMS FOR SOLUTION OF RANGE ASSIGNMENT PROBLEMS
SCHON, B
[J]. ANGEWANDTE INFORMATIK, 1971, 13 (12): : 546 - &
[38] AN UPPER BOUND FOR THE SPEEDUP OF PARALLEL BEST-BOUND BRANCH-AND-BOUND ALGORITHMS
QUINN, MJ
DEO, N
[J]. BIT, 1986, 26 (01): : 35 - 43
[39] THEORETICAL COMPARISONS OF SEARCH STRATEGIES IN BRANCH-AND-BOUND ALGORITHMS
IBARAKI, T
[J]. INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1976, 5 (04): : 315 - 344
[40] DEPTH-M SEARCH IN BRANCH-AND-BOUND ALGORITHMS
IBARAKI, T
[J]. INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1978, 7 (04): : 315 - 343

← 1 2 3 4 5 →