Collective entity linking via greedy search and Monte Carlo calculation Online publication date: Wed, 23-Oct-2019
by Lei Chen; Chong Wu
International Journal of Computational Science and Engineering (IJCSE), Vol. 20, No. 1, 2019
Abstract: Facing the large amount of entities appearing on the web, entity linking becomes popular recently. It assigns an entrance of a resource to one entity to help users grasp the meaning of this entity. Apparently, the entities that usually co-occur are related and can be considered together to find their best assignments. This approach is called collective entity linking and is often conducted based on entity graph. However, traditional collective entity linking methods either consume much time due to the large-scale of entity graph or obtain low accuracy due to simplifying graph to boost speed. To improve both accuracy and efficiency, this paper proposes a novel collective entity linking method based on greedy search and Monte Carlo calculation. Experimental results show that our linking algorithm can obtain both accurate results and low running time meanwhile.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com