Learning to rank entities for set expansion from unstructured data

P Yu, R Rahimi, Z Huang, J Allan - Proceedings of the 2020 ACM SIGIR …, 2020 - dl.acm.org
Proceedings of the 2020 ACM SIGIR on International Conference on Theory of …, 2020dl.acm.org
We propose using learning-to-rank for entity set expansion (ESE) from unstructured data, the
task of finding" sibling" entities within a corpus that are from the set characterized by a small
set of seed entities. We present a two-channel neural re-ranking model, NESE, that jointly
learns exact and semantic matching of entity contexts through entity interaction features.
Although entity set expansion has drawn increasing attention in the IR and NLP
communities for its various applications, the lack of massive annotated entity sets has …
We propose using learning-to-rank for entity set expansion (ESE) from unstructured data, the task of finding "sibling" entities within a corpus that are from the set characterized by a small set of seed entities. We present a two-channel neural re-ranking model, NESE, that jointly learns exact and semantic matching of entity contexts through entity interaction features. Although entity set expansion has drawn increasing attention in the IR and NLP communities for its various applications, the lack of massive annotated entity sets has hindered the development of neural approaches. We describe DBpedia-Sets, a toolkit that automatically extracts entity sets from a plain text collection, thus providing a large amount of distant supervision data for neural model training. Experiments on real datasets of different scales from different domains show that NESE outperforms state-of-the-art approaches in terms of precision and MAP. Furthermore, evaluation through human annotations shows that the knowledge learned from the training data is generalizable.
ACM Digital Library
以上显示的是最相近的搜索结果。 查看全部搜索结果