0


通过扩展贝叶斯逻辑程序识别诱导计划

Abductive Plan Recognition by Extending Bayesian Logic Programs
课程网址: http://videolectures.net/ecmlpkdd2011_raghavan_abductive/  
主讲教师: Sindhu Raghavan
开课单位: 德克萨斯大学
开课时间: 2011-11-30
课程语种: 英语
中文简介:
计划识别是根据其观察到的行为预测代理商的顶级计划的任务。这是一个诱导性的推理任务,涉及从效果中推断原因。大多数现有的计划识别方法使用一阶逻辑或概率图形模型。虽然前者不能处理不确定性,但后者无法处理结构化表示。为了克服这些限制,我们开发了一种使用贝叶斯逻辑程序(BLP)来计划识别的方法,该程序结合了一阶逻辑和贝叶斯网络。由于BLP采用逻辑演绎来构建网络,因此无法有效地用于计划识别。因此,我们扩展BLP以使用逻辑外展来构建贝叶斯网络并调用所得模型贝叶斯外展逻辑程序(BALP)。我们使用适用于BLP的期望最大化算法来学习BALP中的参数。最后,我们提出了对三个基准数据集的BALP的实验评估,并将其性能与计划识别的现有技术进行了比较。
课程简介: Plan recognition is the task of predicting an agent’s top-level plans based on its observed actions. It is an abductive reasoning task that involves inferring cause from effect. Most existing approaches to plan recognition use either first-order logic or probabilistic graphical models. While the former cannot handle uncertainty, the latter cannot handle structured representations. In order to overcome these limitations, we develop an approach to plan recognition using Bayesian Logic Programs (BLPs), which combine first-order logic and Bayesian networks. Since BLPs employ logical deduction to construct the networks, they cannot be used effectively for plan recognition. Therefore, we extend BLPs to use logical abduction to construct Bayesian networks and call the resulting model Bayesian Abductive Logic Programs (BALPs). We learn the parameters in BALPs using the Expectation Maximization algorithm adapted for BLPs. Finally, we present an experimental evaluation of BALPs on three benchmark data sets and compare its performance with the state-of-the-art for plan recognition.
关 键 词: 计划识别; 贝叶斯逻辑程序; 一阶逻辑
课程来源: 视频讲座网
最后编审: 2020-06-10:yumf
阅读次数: 49