Difference between revisions of "Ranking Very Many Typed Entities on Wikipedia"
(Links) |
(+ infobox) |
||
Line 1: | Line 1: | ||
+ | {{Infobox work | ||
+ | | title = Ranking Very Many Typed Entities on Wikipedia | ||
+ | | date = 2007 | ||
+ | | authors = [[Hugo Zaragoza]]<br />[[Henning Rode]]<br />[[Peter Mika]]<br />[[Jordi Atserias]]<br />[[Massimiliano Ciaramita]]<br />[[Giuseppe Attardi]] | ||
+ | | doi = 10.1145/1321440.1321599 | ||
+ | | link = https://dl.acm.org/citation.cfm?id=1321599 | ||
+ | }} | ||
'''Ranking Very Many Typed Entities on Wikipedia''' - scientific work related to [[Wikipedia quality]] published in 2007, written by [[Hugo Zaragoza]], [[Henning Rode]], [[Peter Mika]], [[Jordi Atserias]], [[Massimiliano Ciaramita]] and [[Giuseppe Attardi]]. | '''Ranking Very Many Typed Entities on Wikipedia''' - scientific work related to [[Wikipedia quality]] published in 2007, written by [[Hugo Zaragoza]], [[Henning Rode]], [[Peter Mika]], [[Jordi Atserias]], [[Massimiliano Ciaramita]] and [[Giuseppe Attardi]]. | ||
== Overview == | == Overview == | ||
Authors discuss the problem of ranking very many entities of different types. In particular authors deal with a heterogeneous set of types, some being very generic and some very specific. Authors discuss two approaches for this problem: i) exploiting the entity containment graph and ii) using a Web search engine to compute entity relevance. Authors evaluate these approaches on the real task of ranking [[Wikipedia]] entities typed with a state-of-the-art named-entity tagger. Results show that both approaches can greatly increase the performance of methods based only on passage retrieval. | Authors discuss the problem of ranking very many entities of different types. In particular authors deal with a heterogeneous set of types, some being very generic and some very specific. Authors discuss two approaches for this problem: i) exploiting the entity containment graph and ii) using a Web search engine to compute entity relevance. Authors evaluate these approaches on the real task of ranking [[Wikipedia]] entities typed with a state-of-the-art named-entity tagger. Results show that both approaches can greatly increase the performance of methods based only on passage retrieval. |
Revision as of 23:59, 19 February 2021
Authors | Hugo Zaragoza Henning Rode Peter Mika Jordi Atserias Massimiliano Ciaramita Giuseppe Attardi |
---|---|
Publication date | 2007 |
DOI | 10.1145/1321440.1321599 |
Links | Original |
Ranking Very Many Typed Entities on Wikipedia - scientific work related to Wikipedia quality published in 2007, written by Hugo Zaragoza, Henning Rode, Peter Mika, Jordi Atserias, Massimiliano Ciaramita and Giuseppe Attardi.
Overview
Authors discuss the problem of ranking very many entities of different types. In particular authors deal with a heterogeneous set of types, some being very generic and some very specific. Authors discuss two approaches for this problem: i) exploiting the entity containment graph and ii) using a Web search engine to compute entity relevance. Authors evaluate these approaches on the real task of ranking Wikipedia entities typed with a state-of-the-art named-entity tagger. Results show that both approaches can greatly increase the performance of methods based only on passage retrieval.