Research Data - Combining Textual and Graph-based Features for Named Entity Disambiguation Using Undirected Probabilistic Graphical Models

Hakimov S, ter Horst H, Jebbara S, Hartung M, Cimiano P (2016)
Bielefeld University.

Datenpublikation
 
Download
OA 983 bytes
OA dbpediaDatasets.txt 112 bytes
OA MentionEntity.ttl.zip
Alle
Abstract / Bemerkung
Named Entity Linking (NEL) is the task of disambiguating named entities in a natural language text by linking them to their corresponding entities in a knowledge base such as DBpedia. Thus, it is an important step in transforming unstructured text into structured knowledge. Previous work on this task has proven a strong impact of graph-based methods such as PageRank on entity linking. Other approaches rely on distributional similarity between an article and the textual description of a candidate entity. However, the combined impact of these different feature groups has not been explored to a sufficient extent. In this paper, we present a novel approach that exploits a unified probabilistic model based on undirected probabilistic models to combine different types of features for named entity linking. Capitalizing on Markov Chain Monte Carlo sampling, our model is capable of exploiting complementary strengths between both graph-based and textual features. We analyze the impact of these features and their combination on named entity linking to enhance our understanding of the task. In an evaluation on several data sets from the GERBIL benchmark, our model compares favourably with the current state-of-the-art. On the AIDA/CoNLL data set, in particular, we outperform previous approaches.
Stichworte
entity disambiguation; page rank data; dbpedia surface forms; entity linking
Erscheinungsjahr
2016
Page URI
https://pub.uni-bielefeld.de/record/2902978

Zitieren

Hakimov S, ter Horst H, Jebbara S, Hartung M, Cimiano P. Research Data - Combining Textual and Graph-based Features for Named Entity Disambiguation Using Undirected Probabilistic Graphical Models. Bielefeld University; 2016.
Hakimov, S., ter Horst, H., Jebbara, S., Hartung, M., & Cimiano, P. (2016). Research Data - Combining Textual and Graph-based Features for Named Entity Disambiguation Using Undirected Probabilistic Graphical Models. Bielefeld University. doi:10.4119/unibi/2902978
Hakimov, S., ter Horst, H., Jebbara, S., Hartung, M., and Cimiano, P. (2016). Research Data - Combining Textual and Graph-based Features for Named Entity Disambiguation Using Undirected Probabilistic Graphical Models. Bielefeld University.
Hakimov, S., et al., 2016. Research Data - Combining Textual and Graph-based Features for Named Entity Disambiguation Using Undirected Probabilistic Graphical Models, Bielefeld University.
S. Hakimov, et al., Research Data - Combining Textual and Graph-based Features for Named Entity Disambiguation Using Undirected Probabilistic Graphical Models, Bielefeld University, 2016.
Hakimov, S., ter Horst, H., Jebbara, S., Hartung, M., Cimiano, P.: Research Data - Combining Textual and Graph-based Features for Named Entity Disambiguation Using Undirected Probabilistic Graphical Models. Bielefeld University (2016).
Hakimov, Sherzod, ter Horst, Hendrik, Jebbara, Soufian, Hartung, Matthias, and Cimiano, Philipp. Research Data - Combining Textual and Graph-based Features for Named Entity Disambiguation Using Undirected Probabilistic Graphical Models. Bielefeld University, 2016.
Alle Dateien verfügbar unter der/den folgenden Lizenz(en):
Volltext(e)
Access Level
OA Open Access
Zuletzt Hochgeladen
2019-09-06T09:18:37Z
MD5 Prüfsumme
0645f7361cbc82096afb51b401fe3f69
Name
Access Level
OA Open Access
Zuletzt Hochgeladen
2019-09-06T09:18:37Z
MD5 Prüfsumme
f4d5360f9e97d3594517337f6e0d501f
Access Level
OA Open Access
Zuletzt Hochgeladen
2019-09-06T09:18:37Z
MD5 Prüfsumme
010181eafdf3fea512713752fc497121
Access Level
OA Open Access
Zuletzt Hochgeladen
2019-09-06T09:18:37Z
MD5 Prüfsumme
0c5466a86efe7f6bd4b27785dfc3d8b3
Access Level
OA Open Access
Zuletzt Hochgeladen
2019-09-06T09:18:37Z
MD5 Prüfsumme
370b979b5fca031f9f7f9a0fb9e18070
Access Level
OA Open Access
Zuletzt Hochgeladen
2019-09-06T09:18:37Z
MD5 Prüfsumme
e20043b3e26cdeb14dae0a63bca2384d

Export

Markieren/ Markierung löschen
Markierte Publikationen

Open Data PUB

Suchen in

Google Scholar