Candidate Entity Search and Ranking of Knowledge Graph
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Ranking entities according to the relevance degree between the given entity and other entities in a Knowledge Graph (KG) is critical for related entity search. The relevance between entities is not only reflected in the KG but also the rapidly generated Web documents. In existing methods, the relevance degree is mainly calculated from the KG, which cannot reflect the knowledge rapidly evolving in the real world, and thus effective results cannot be obtained. Therefore, in this study, we first propose an algorithm for searching candidate entities on the basis of the TransH model by analyzing the semantic representation of entities in hyperplanes of different relations. To improve the precision of ranking candidate entities, we propose an Entity Undirected Weighted Graph (EUWG) model by quantifying the relevance between searched and candidate entities reflected in Web documents and KG. Experimental results show that the proposed method can precisely search and rank the candidate entities in the large-scale KG.

    Reference
    Related
    Cited by
Get Citation

沈航可,祁志卫,张子辰,岳昆.知识图谱的候选实体搜索与排序.计算机系统应用,2021,30(11):46-53

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:January 28,2021
  • Revised:February 26,2021
  • Adopted:
  • Online: October 22,2021
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063