提升动态联合树算法中不必要接地的防止
Preventing Unnecessary Groundings in the Lifted Dynamic Junction Tree Algorithm
摘要:
提升的动态连接树算法(LDJT)有效地回答过滤和预测查询的概率关系时态模型,通过建立,然后重用一个一阶聚类表示的知识库的多个查询和时间步长。不幸的是,一个非理想的淘汰顺序可能会导致接地,即使一个模型的提升运行是可能的。我们扩展LDJT(i),以确定不必要的接地,同时进行的时间和(ii),以防止接地延迟消除通过时间的一阶聚类表示的变化。LDJT的扩展版本回答多个时间查询的数量级比原来的版本更快。
英文摘要:
The lifted dynamic junction tree algorithm (LDJT) efficiently answers filtering and prediction queries for probabilistic relational temporal models by building and then reusing a first-order cluster representation of a knowledge base for multiple queries and time steps. Unfortunately, a non-ideal elimination order can lead to groundings even though a lifted run is possible for a model. We extend LDJT (i) to identify unnecessary groundings while proceeding in time and (ii) to prevent groundings by delaying eliminations through changes in a temporal first-order cluster representation. The extended version of LDJT answers multiple temporal queries orders of magnitude faster than the original version.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。