کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
397563 1438522 2007 20 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
پیش نمایش صفحه اول مقاله
Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks
چکیده انگلیسی

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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: International Journal of Approximate Reasoning - Volume 44, Issue 3, March 2007, Pages 261-280