首页> 外文期刊>Computational Intelligence Magazine, IEEE >Reasoning with Large Scale Ontologies in Fuzzy pD* Using MapReduce
【24h】

Reasoning with Large Scale Ontologies in Fuzzy pD* Using MapReduce

机译:使用MapReduce在模糊pD *中进行大规模本体推理

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

The MapReduce framework has proved to be very efficient for data-intensive tasks. Earlier work has successfully applied MapReduce for large scale RDFS/OWL reasoning. In this paper, we move a step forward by considering scalable reasoning on semantic data under fuzzy pD* semantics (i.e., an extension of OWL pD* semantics with fuzzy vagueness). To the best of our knowledge, this is the first work to investigate how MapReduce can be applied to solve the scalability issue of fuzzy reasoning in OWL. While most of the optimizations considered by the existing MapReduce framework for pD* semantics are also applicable for fuzzy pD* semantics, unique challenges arise when we handle the fuzzy information. Key challenges are identified with solution proposed for each of these challenges. Furthermore, a prototype system is implemented for the evaluation purpose. The experimental results show that the running time of our system is comparable with that of WebPIE, the state-of-the-art inference engine for scalable reasoning in pD* semantics.
机译:实践证明,MapReduce框架对于数据密集型任务非常有效。早期的工作已成功将MapReduce应用于大规模RDFS / OWL推理。在本文中,我们通过考虑在模糊pD *语义(即OWL pD *语义的模糊模糊性扩展)上对语义数据进行可伸缩性推理来向前迈进了一步。据我们所知,这是研究MapReduce如何用于解决OWL中模糊推理的可伸缩性问题的第一项工作。现有MapReduce框架考虑的针对pD *语义的大多数优化方法也适用于模糊pD *语义,但是当我们处理模糊信息时会遇到独特的挑战。通过针对每个挑战提出的解决方案来确定关键挑战。此外,出于评估目的实施了原型系统。实验结果表明,我们的系统的运行时间与WebPIE的运行时间相当,WebPIE是用于pD *语义的可扩展推理的最新推理引擎。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号