Proceedings of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval 2011
DOI: 10.1145/2009916.2010019
|View full text |Cite
|
Sign up to set email alerts
|

Collective entity linking in web text

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

2
193
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 302 publications
(198 citation statements)
references
References 11 publications
2
193
0
Order By: Relevance
“…We adapted the work presented in [3] to use Jamendo 12 and Linked Movie Database 13 , two publicly available Linked Data datasets. As those datasets do not have full text descriptions for all entities, the mapping between text around mentions and textual descriptions could not be used, as well as the computation of TF-IDF.…”
Section: Preliminary Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…We adapted the work presented in [3] to use Jamendo 12 and Linked Movie Database 13 , two publicly available Linked Data datasets. As those datasets do not have full text descriptions for all entities, the mapping between text around mentions and textual descriptions could not be used, as well as the computation of TF-IDF.…”
Section: Preliminary Resultsmentioning
confidence: 99%
“…the ambiguity of a mention) as the main drawback for Entity Linking [4,3,6]. In other words, as bigger the Knowledge Base and the number of candidates per mention as much time it may take to find a solution.…”
Section: Related Workmentioning
confidence: 99%
“…Examples include information retrieval [4,14,18], named entity disambiguation [1,2,7,8,11,12], text classification [25] and entity ranking [10]. To extract the content of an entity context, many researches directly used the Wikipedia article describing the entity [1,2,8,9,14,[25][26][27]; some works extended the article with all the other Wikipedia articles linked to the Wikipedia article describing the entity [6,7,12]; while some only considered the first paragraph of the Wikipedia article describing the entity [2]. Different from these approaches, our Graph-based approach not only employs in-links and languagelinks to broaden the article set that is likely to mention the entity, but also performs a finer-grained process: extracting the sentences that mention the entity, such that all the sentences in our context are closely related to the target entity.…”
Section: Related Workmentioning
confidence: 99%
“…As to the context-based representation vector of the entity, [1,11] defined it as the tf-idf/word count/binary occurrence values of all the vocabulary words in the context content; [2,19] defined it as the word count/binary occurrence values of other entities in the context content; [5,6,9,14,25] defined it as the tf-idf similarity values between the target entity's context content and other entities' context contents from Wikipedia; [27] defined it as the visiting probability from the target entity to other entities from Wikipedia; [7,26] used a measurement based on the common entities linked to the target entity and other entities from Wikipedia. Different from all former researches, we employ aspect weights that have a different interpretation of the frequency and selectivity than the typical tf-idf values and take co-occurrence and language specificity of the aspects into account.…”
Section: Related Workmentioning
confidence: 99%
“…The PageRank algorithm is a well-researched link-based ranking algorithm that simulates a random walk on the underlying graph and reflects the importance of each node. It has been shown to provide good performance for many applications [25], also in entity disambiguation tasks [6].…”
Section: Problem Statement and Approachmentioning
confidence: 99%