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

基于无向图模型推理的案例推理适应性引导检索

Approaching Adaptation Guided Retrieval in Case-Based Reasoning through Inference in Undirected Graphical Models

Università del Piemonte Orientale(东皮埃蒙特大学)

Luigi Portinale

摘要:

在基于案例的推理中,当相似性假设不成立时,检索一组结构上与查询相似的案例并不能保证得到可重用或可修改的解决方案。知识的适应性的解决方案,必须加以利用,以定义一种方法,适应引导检索。我们提出了一种新的方法来解决这个问题,知识的适应性的解决方案被捕获内的度量马尔可夫随机场(MRF)。MRF的节点表示情况,边连接解空间中解接近的节点。节点的状态表示相对于潜在查询的不同适应水平。基于度量的潜力强制连接的节点共享相同的状态,因为具有类似解决方案的情况下应该具有相同的适应性水平相对于查询。其主要目标是扩大一组潜在的适应性的情况下,检索不显着牺牲检索的精度和准确性。我们将报告一些关于检索架构的实验,其中一个简单的kNN检索(对问题的描述)之后,由MRF推理的基础上进一步检索步骤。

英文摘要:

In Case-Based Reasoning, when the similarity assumption does not hold, the retrieval of a set of cases structurally similar to the query does not guarantee to get a reusable or revisable solution. Knowledge about the adaptability of solutions has to be exploited, in order to define a method for adaptation-guided retrieval. We propose a novel approach to address this problem, where knowledge about the adaptability of the solutions is captured inside a metric Markov Random Field (MRF). Nodes of the MRF represent cases and edges connect nodes whose solutions are close in the solution space. States of the nodes represent different adaptation levels with respect to the potential query. Metric-based potentials enforce connected nodes to share the same state, since cases having similar solutions should have the same adaptability level with respect to the query. The main goal is to enlarge the set of potentially adaptable cases that are retrieved without significantly sacrificing the precision and accuracy of retrieval. We will report on some experiments concerning a retrieval architecture where a simple kNN retrieval (on the problem description) is followed by a further retrieval step based on MRF inference.

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

↑