روش نمایه سازی کارآمد برای تجزیه بازگشتی از شبکه های بیزی
|کد مقاله||سال انتشار||مقاله انگلیسی||ترجمه فارسی||تعداد کلمات|
|29182||2012||19 صفحه PDF||سفارش دهید||12047 کلمه|
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : International Journal of Approximate Reasoning, Volume 53, Issue 7, October 2012, Pages 969–987
We consider efficient indexing methods for conditioning graphs, which are a form of recursive decomposition for Bayesian networks. We compare two well-known methods for indexing, a top-down method and a bottom-up method, and discuss the redundancy that each of these suffer from. We present a new method for indexing that combines the advantages of each model in order to reduce this redundancy. We also introduce the concept of an update manager, which is a node in the conditioning graph that controls when other nodes update their current index. Empirical evaluations over a suite of standard test networks show a considerable reduction both in the amount of indexing computation that takes place, and the overall runtime required by the query algorithm. Highlights ► A new model for indexing the probability tables in a conditioning graph is proposed. ► This new model is a hybrid of two existing indexing approaches. ► Several optimizations to the new technique are also demonstrated. ► Tests on benchmark networks show improvements to existing indexing methods.