• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2015, Vol. 37 ›› Issue (05): 895-900.

• 论文 • Previous Articles     Next Articles

An entity linking approach based on
massive RDF knowledge bases       

TANG Xiaoqin1,LIU Libo1,ZHOU Tao2   

  1. (1.College of Mathematics and Computer Science,Ningxia University,Yinchuan 750021;
    2.Institute of Agricultural Resources and Environment,
    Ningxia Academy of Agriculture and Forestry,Yinchuan 750002,China)
  • Received:2014-05-16 Revised:2014-07-30 Online:2015-05-25 Published:2015-05-25

Abstract:

More and more unstructured data products are produced,distributed and consumed over the Internet today.Resource Description Framework (RDF) is the Internet resources description standard proposed by W3C,which is quite suitable in describing the unstructured information on Internet.As a consequence,a large number of RDF knowledge bases have been developed,such as Freebase,Yago,DBPedia and so on.RDF knowledge bases contain rich semantic information,which not only label the named entities on Web pages, but also expand semantic information.The task of mapping named entities from web pages to the corresponding entities in knowledge bases is called entity linking.Entity linking includes two main parts: mapping between entities and entity disambiguation.In the paper, we propose an efficient entity linking approach based on the properties of RDF knowledge bases.The algorithms use a simple weighted graph approach to solve the entity disambiguation problem on cloud platform. Experimental results show that our solution is accurate and scalable. 

Key words: RDF knowledge bases;entity linking;graph weighting;entity disambiguation