Please use this identifier to cite or link to this item:
Title: Entity linking with effective acronym expansion, instance selection and topic modeling
Authors: Zhang, W.
Sim, Y.C.
Su, J.
Tan, C.L. 
Issue Date: 2011
Citation: Zhang, W., Sim, Y.C., Su, J., Tan, C.L. (2011). Entity linking with effective acronym expansion, instance selection and topic modeling. IJCAI International Joint Conference on Artificial Intelligence : 1909-1914. ScholarBank@NUS Repository.
Abstract: Entity linking maps name mentions in the documents to entries in a knowledge base through resolving the name variations and ambiguities. In this paper, we propose three advancements for entity linking. Firstly, expanding acronyms can effectively reduce the ambiguity of the acronym mentions. However, only rule-based approaches relying heavily on the presence of text markers have been used for entity linking. In this paper, we propose a supervised learning algorithm to expand more complicated acronyms encountered, which leads to 15.1% accuracy improvement over state-of-the-art acronym expansion methods. Secondly, as entity linking annotation is expensive and labor intensive, to automate the annotation process without compromise of accuracy, we propose an instance selection strategy to effectively utilize the automatically generated annotation. In our selection strategy, an informative and diverse set of instances are selected for effective disambiguation. Lastly, topic modeling is used to model the semantic topics of the articles. These advancements give statistical significant improvement to entity linking individually. Collectively they lead the highest performance on KBP-2010 task.
Source Title: IJCAI International Joint Conference on Artificial Intelligence
ISBN: 9781577355120
ISSN: 10450823
DOI: 10.5591/978-1-57735-516-8/IJCAI11-319
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Dec 10, 2018

Page view(s)

checked on Dec 8, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.