English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  KORE: Keyphrase Overlap Relatedness for Entity Disambiguation

Hoffart, J., Seufert, S., Nguyen, D. B., Theobald, M., & Weikum, G. (2012). KORE: Keyphrase Overlap Relatedness for Entity Disambiguation. In X.-W. Chen, G. Lebanon, H. Wang, & M. J. Zaki (Eds.), CIKM'12 (pp. 545-554). New York, NY: ACM.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-59A6-0 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0023-C144-9
Genre: Conference Paper
Latex : {KORE}: Keyphrase Overlap Relatedness for Entity Disambiguation

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Hoffart, Johannes1, 2, Author           
Seufert, Stephan1, 2, Author           
Nguyen, Dat Ba1, 2, Author           
Theobald, Martin1, Author           
Weikum, Gerhard1, Author           
Affiliations:
1Databases and Information Systems, MPI for Informatics, Max Planck Society, ou_24018              
2International Max Planck Research School, MPI for Informatics, Max Planck Society, ou_1116551              

Content

show
hide
Free keywords: -
 Abstract: Measuring the semantic relatedness between two entities is the basis for numerous tasks in IR, NLP, and Web-based knowledge extraction. This paper focuses on disambiguating names in a Web or text document by jointly mapping all names onto semantically related entities registered in a knowledge base. To this end, we have developed a novel notion of semantic relatedness between two entities represented as sets of weighted (multi-word) keyphrases, with consideration of partially overlapping phrases. This measure improves the quality of prior link-based models, and also eliminates the need for (usually Wikipedia-centric) explicit interlinkage between entities. Thus, our method is more versatile and can cope with long-tail and newly emerging entities that have few or no links associated with them. For efficiency, we have developed approximation techniques based on min-hash sketches and locality-sensitive hashing. Our experiments on semantic relatedness and on named entity disambiguation demonstrate the superiority of our method compared to state-of-the-art baselines.

Details

show
hide
Language(s): eng - English
 Dates: 2012
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 647479
DOI: 10.1145/2396761.2396832
URI: http://doi.acm.org/10.1145/2396761.2396832
Other: Local-ID: C1256DBF005F876D-3DCFB5FA0199B58EC1257ABC0043DD61-HoffartCIKM2012
BibTex Citekey: HoffartCIKM2012
 Degree: -

Event

show
hide
Title: 21st ACM International Conference on Information and Knowledge Management
Place of Event: Maui, Hawaii, USA
Start-/End Date: 2012-10-29 - 2012-11-02

Legal Case

show

Project information

show

Source 1

show
hide
Title: CIKM'12
  Subtitle : The Proceedings of the 21st ACM International Conference on Information and Knowledge Management
  Abbreviation : CIKM 2012
Source Genre: Proceedings
 Creator(s):
Chen, Xue-Wen1, Editor
Lebanon, Guy1, Editor
Wang, Haixun1, Editor
Zaki, Mohammed J.1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: New York, NY : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 545 - 554 Identifier: ISBN: 978-1-4503-1156-4