2015
DOI: 10.48550/arxiv.1503.01655
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Studying the Wikipedia Hyperlink Graph for Relatedness and Disambiguation

Abstract: Hyperlinks and other relations in Wikipedia are a extraordinary resource which is still not fully understood. In this paper we study the different types of links in Wikipedia, and contrast the use of the full graph with respect to just direct links. We apply a well-known random walk algorithm on two tasks, word relatedness and named-entity disambiguation. We show that using the full graph is more effective than just direct links by a large margin, that non-reciprocal links harm performance, and that there is n… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2016
2016
2016
2016

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 19 publications
0
1
0
Order By: Relevance
“…Regarding random walk based embeddings, we decided to apply them to the Wikipedia graph described in (Agirre, Barrena, and Soroa 2015) which is publicly available. V consists of all Wikipedia pages except redirect, disambiguation and category pages.…”
Section: Additional Word Representationsmentioning
confidence: 99%
“…Regarding random walk based embeddings, we decided to apply them to the Wikipedia graph described in (Agirre, Barrena, and Soroa 2015) which is publicly available. V consists of all Wikipedia pages except redirect, disambiguation and category pages.…”
Section: Additional Word Representationsmentioning
confidence: 99%