0


小麦或箔条——实用可行的交互式本体修改

Wheat or chaff - Practically feasible inferactive ontology revision
课程网址: http://videolectures.net/iswc2011_nikitina_revision/  
主讲教师: Nadeschda Nikitina
开课单位: 牛津大学
开课时间: 2011-11-25
课程语种: 英语
中文简介:
当自动获取本体知识时,质量控制是必不可少的。我们考虑最严格的方法 - 对获得的数据进行详尽的手动检查。通过使用自动推理,我们部分地自动化过程:在每个专家决策之后,已经批准的陈述所引用的公理被自动批准,而导致不一致的公理被拒绝。在这种情况下,适当的公理排名策略对于最小化专家决策的数量至关重要。在本文中,我们提出了先前提出的排名技术的推广,其适用于任意有效性比率 - 数据集中有效声明的比例 - 而之前描述的排名功能要么针对正确的100%和0%的有效性比率而定制,要么正在优化最坏情况。有效率 - 通常不是先验的 - 在检查过程中连续估计。我们进一步采用分区技术来显着减少计算工作量。我们提供了支持所有这些优化的实现,以及用于连续公理评估的用户前端,从而使我们提出的策略适用于实际场景。我们的评估表明,新的参数化排名函数几乎实现了最大可能的自动化,并且基于每个基于推理的自动决策所需的计算时间平均减少到不超过一秒的超过25,000个语句的测试数据集。
课程简介: When ontological knowledge is acquired automatically, quality control is essential. We consider the tightest possible approach – an exhaustive manual inspection of the acquired data. By using automated reasoning, we partially automate the process: after each expert decision, axioms that are entailed by the already approved statements are automatically approved, whereas axioms that would lead to an inconsistency are declined. Adequate axiom ranking strategies are essential in this setting to minimize the amount of expert decisions. In this paper, we present a generalization of the previously proposed ranking techniques which works well for arbitrary validity ratios – the proportion of valid statements within a dataset – whereas the previously described ranking functions were either tailored towards validity ratios of exactly 100% and 0% or were optimizing the worst case. The validity ratio – generally not known a priori – is continuously estimated over the course of the inspection process. We further employ partitioning techniques to significantly reduce the computational effort. We provide an implementation supporting all these optimizations as well as featuring a user front-end for successive axiom evaluation, thereby making our proposed strategy applicable to practical scenarios. This is witnessed by our evaluation showing that the novel parameterized ranking function almost achieves the maximum possible automation and that the computation time needed for each reasoning-based, automatic decision is reduced to less than one second on average for our test dataset of over 25,000 statements.
关 键 词: 排名技术; 分区技术; 参数化
课程来源: 视频讲座网
最后编审: 2019-05-05:lxf
阅读次数: 49