首页> 外文会议>Asian conference on intelligent information and database systems;ACIIDS 2012 >Ranking Semantic Associations between Two Entities - Extended Model
【24h】

Ranking Semantic Associations between Two Entities - Extended Model

机译:对两个实体之间的语义关联进行排名-扩展模型

获取原文

摘要

Semantic association is a set of relationships between two entities in knowledge base represented as graph paths consisting of a sequence of links. The number of relationships between entities in a knowledge base might be much greater than the number of entities. So, ranking the relationship paths is required to find the relevant relationships with respect to the user's domain of interest. In some situations, user may expect the semantic relationships with respect to specific domain closer to any one of these entities. Consider the example for finding the semantic association between the person X and person Y. If the user has already known something about the person X such as person X may be associated with financial activities or scientific research etc., then the user wants to focus on finding and ranking the relationship between two persons in which the users' context is closer to person X. In many of the existing systems, there is no consideration given into context closeness during ranking process. In this paper, we present an approach which allows the extraction of semantic associations between two entities depending on the choice of the user in which the context is closer to left or right entity. The average correlation coefficient between proposed ranking and human ranking is 0.70. We compare the results of our proposed method with other existing methods. It explains that the proposed ranking is highly correlated with human ranking. According to our experiments, the proposed system provides the highest precision rate in ranking the semantic association paths.
机译:语义关联是知识库中两个实体之间的一组关系,这些关系表示为由一系列链接组成的图形路径。知识库中实体之间的关系数量可能远大于实体数量。因此,需要对关系路径进行排名,以找到与用户感兴趣的领域相关的关系。在某些情况下,用户可能期望与特定领域的语义关系更接近这些实体中的任何一个。考虑用于找到人X和人Y之间的语义关联的示例。如果用户已经知道有关人X的某些信息,例如人X,可能与金融活动或科学研究等相关联,则用户希望专注于在用户的上下文更接近人X的两个人之间找到关系并对其进行排名。在许多现有系统中,在排名过程中没有考虑上下文的​​紧密度。在本文中,我们提出了一种方法,该方法允许根据上下文上下文更接近左侧或右侧实体的用户的选择来提取两个实体之间的语义关联。建议排名与人类排名之间的平均相关系数为0.70。我们将我们提出的方法与其他现有方法的结果进行比较。它解释了提议的排名与人类排名高度相关。根据我们的实验,提出的系统在对语义关联路径进行排名时提供了最高的准确率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号