Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2014, Vol. 37 ›› Issue (5): 36-40.doi: 10.13190/j.jbupt.2014.05.008

• Papers • Previous Articles     Next Articles

An Named Entity Disambiguation Algorithm Combining Entity Linking and Entity Clustering

TAN Yong-mei, YANG Xue   

  1. Center for Intelligence Science and Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Received:2013-07-11 Online:2014-10-28 Published:2014-11-07

Abstract:

In order to eliminate the ambiguity of named entities in the documents, a named entity disambiguation algorithm combining entity linking and entity clustering is proposed, and the proposed algorithm combines two methods to compensate for the limitations of only using one of the methods. The proposed algorithm expands the mentions in the background document firstly, and generates candidates in the English Wikipedia knowledge base for expansions secondly, then extracts a variety of features to rank candidates, lastly uses clustering to disambiguate the mentions which has none candidates in the knowledge base. The experimental results show that, in the proposed algorithm, the F measure in KBP2011 data set is 0.746 and the F measure in KBP2012 data set is 0.670.

Key words: named entity disambiguation, entity linking, clustering

CLC Number: