arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1301.0564cs.AI
收藏

迭代连接图传播

Iterative Join-Graph Propagation

University of California, Irvine(加州大学尔湾分校)

Rina Dechter, Kalev Kask, Robert Mateescu

摘要:

本文提出了一种迭代的连接树聚类算法,将连接树聚类算法的消息传递应用于连接图,而不是连接树,迭代。它一方面受到Pearl的置信传播算法作为迭代近似方案的成功的启发,另一方面受到最近引入的一种小型聚类算法的启发。另一方面,成功作为一种随时近似的方法。建议的迭代连接图传播IJGP属于类的广义的信念传播方法,最近提出的统计物理学中的算法使用类比。这种方法对一些问题类的实证评估表明,即使是最省时的变体几乎总是优于IBP和MC i,有时更准确的几个数量级。

英文摘要:

The paper presents an iterative version of join-tree clustering that applies the message passing of join-tree clustering algorithm to join-graphs rather than to join-trees, iteratively. It is inspired by the success of Pearl's belief propagation algorithm as an iterative approximation scheme on one hand, and by a recently introduced mini-clustering i. success as an anytime approximation method, on the other. The proposed Iterative Join-graph Propagation IJGP belongs to the class of generalized belief propagation methods, recently proposed using analogy with algorithms in statistical physics. Empirical evaluation of this approach on a number of problem classes demonstrates that even the most time-efficient variant is almost always superior to IBP and MC i, and is sometimes more accurate by as much as several orders of magnitude.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑