首页> 外文会议>International Conference on Information Engineering >Computing semantic relatedness for domain entities from encyclopaedias of digital publishing resource
【24h】

Computing semantic relatedness for domain entities from encyclopaedias of digital publishing resource

机译:从数字出版资源百科全书的域实体计算语义相关性

获取原文

摘要

The task of computing semantic relatedness for domain-specific entities may be seen as one of the pivotal processes for implementation of the domain-specific knowledge service. Encyclopedias of digital publishing resources are a kind of reference book which generally holds a relatively complete and authoritative collection of entities in a specific domain. In this paper, a novel method named Globally Explicit and Implicit Analysis (GEIA) is proposed to compute semantic relatedness for entities created from encyclopedias. First, a weighted directed graph is built with the entities as vertexes and explicit relations between the entities as edges. The implicit relations between the entities are then computed from the graph based on the explicit relations extracted from the encyclopedias. With this method, both the explicit and implicit relations are used to compute the semantic relatedness. Experiment results show that the method is effective.
机译:计算域特定实体的语义相关性的任务可以被视为实现域特定知识服务的关键过程之一。数字出版资源的百科全书是一种参考书,通常在特定域中拥有相对完整和权威的实体集合。在本文中,提出了一种名为全局显式和隐式分析(徽章)的新型方法,以计算从百科全书创建的实体的语义相关性。首先,将加权定向图用实体作为顶点构建,并将实体之间的明确关系作为边缘。然后基于从百科全书中提取的显式关系从图中计算实体之间的隐式关系。通过这种方法,可以使用显式和隐式关系来计算语义相关性。实验结果表明,该方法是有效的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号