Pair-linking for collective entity disambiguation : two could be better than all
Collective entity disambiguation, or collective entity linking aims to jointly resolve multiple mentions by linking them to their associated entities in a knowledge base. Previous works are primarily based on the underlying assumption that entities within the same document are highly related. Howeve...
Saved in:
Main Authors: | , , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2019
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/106420 http://hdl.handle.net/10220/50043 http://dx.doi.org/10.1109/TKDE.2018.2857493 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-106420 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-1064202019-12-06T22:11:18Z Pair-linking for collective entity disambiguation : two could be better than all Phan, Minh C. Sun, Aixin Tay, Yi Han, Jialong Li, Chenliang School of Computer Science and Engineering Collective Entity Disambiguation MINTREE Engineering::Computer science and engineering Collective entity disambiguation, or collective entity linking aims to jointly resolve multiple mentions by linking them to their associated entities in a knowledge base. Previous works are primarily based on the underlying assumption that entities within the same document are highly related. However, the extent to which these entities are actually connected in reality is rarely studied and therefore raises interesting research questions. For the first time, this paper shows that the semantic relationships between mentioned entities within a document are in fact less dense than expected. This could be attributed to several reasons such as noise, data sparsity, and knowledge base incompleteness. As a remedy, we introduce MINTREE, a new tree-based objective for the problem of entity disambiguation. The key intuition behind MINTREE is the concept of coherence relaxation which utilizes the weight of a minimum spanning tree to measure the coherence between entities. Based on this new objective, we design Pair-Linking, a novel iterative solution for the MINTREE optimization problem. The idea of Pair-Linking is simple: instead of considering all the given mentions, Pair-Linking iteratively selects a pair with the highest confidence at each step for decision making. Via extensive experiments on eight benchmark datasets, we show that our approach is not only more accurate but also surprisingly faster than many state-of-the-art collective linking algorithms MOE (Min. of Education, S’pore) Accepted version 2019-09-30T06:57:36Z 2019-12-06T22:11:18Z 2019-09-30T06:57:36Z 2019-12-06T22:11:18Z 2018 Journal Article Phan, M. C., Sun, A., Tay, Y., Han, J., & Li, C. (2019). Pair-linking for collective entity disambiguation : two could be better than all. IEEE Transactions on Knowledge and Data Engineering, 31(7), 1383-1396. doi:10.1109/TKDE.2018.2857493 1041-4347 https://hdl.handle.net/10356/106420 http://hdl.handle.net/10220/50043 http://dx.doi.org/10.1109/TKDE.2018.2857493 en IEEE Transactions on Knowledge and Data Engineering © 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: https://doi.org/10.1109/TKDE.2018.2857493. 14 p. application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
country |
Singapore |
collection |
DR-NTU |
language |
English |
topic |
Collective Entity Disambiguation MINTREE Engineering::Computer science and engineering |
spellingShingle |
Collective Entity Disambiguation MINTREE Engineering::Computer science and engineering Phan, Minh C. Sun, Aixin Tay, Yi Han, Jialong Li, Chenliang Pair-linking for collective entity disambiguation : two could be better than all |
description |
Collective entity disambiguation, or collective entity linking aims to jointly resolve multiple mentions by linking them to their associated entities in a knowledge base. Previous works are primarily based on the underlying assumption that entities within the same document are highly related. However, the extent to which these entities are actually connected in reality is rarely studied and therefore raises interesting research questions. For the first time, this paper shows that the semantic relationships between mentioned entities within a document are in fact less dense than expected. This could be attributed to several reasons such as noise, data sparsity, and knowledge base incompleteness. As a remedy, we introduce MINTREE, a new tree-based objective for the problem of entity disambiguation. The key intuition behind MINTREE is the concept of coherence relaxation which utilizes the weight of a minimum spanning tree to measure the coherence between entities. Based on this new objective, we design Pair-Linking, a novel iterative solution for the MINTREE optimization problem. The idea of Pair-Linking is simple: instead of considering all the given mentions, Pair-Linking iteratively selects a pair with the highest confidence at each step for decision making. Via extensive experiments on eight benchmark datasets, we show that our approach is not only more accurate but also surprisingly faster than many state-of-the-art collective linking algorithms |
author2 |
School of Computer Science and Engineering |
author_facet |
School of Computer Science and Engineering Phan, Minh C. Sun, Aixin Tay, Yi Han, Jialong Li, Chenliang |
format |
Article |
author |
Phan, Minh C. Sun, Aixin Tay, Yi Han, Jialong Li, Chenliang |
author_sort |
Phan, Minh C. |
title |
Pair-linking for collective entity disambiguation : two could be better than all |
title_short |
Pair-linking for collective entity disambiguation : two could be better than all |
title_full |
Pair-linking for collective entity disambiguation : two could be better than all |
title_fullStr |
Pair-linking for collective entity disambiguation : two could be better than all |
title_full_unstemmed |
Pair-linking for collective entity disambiguation : two could be better than all |
title_sort |
pair-linking for collective entity disambiguation : two could be better than all |
publishDate |
2019 |
url |
https://hdl.handle.net/10356/106420 http://hdl.handle.net/10220/50043 http://dx.doi.org/10.1109/TKDE.2018.2857493 |
_version_ |
1681037334382903296 |