Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
Zur Ablage hinzufügen
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  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

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-59A6-0 Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-0023-C144-9
Genre: Konferenzbeitrag
Latex : {KORE}: Keyphrase Overlap Relatedness for Entity Disambiguation

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Hoffart, Johannes1, 2, Autor           
Seufert, Stephan1, 2, Autor           
Nguyen, Dat Ba1, 2, Autor           
Theobald, Martin1, Autor           
Weikum, Gerhard1, Autor           
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              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: 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

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2012
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: eDoc: 647479
DOI: 10.1145/2396761.2396832
URI: http://doi.acm.org/10.1145/2396761.2396832
Anderer: Local-ID: C1256DBF005F876D-3DCFB5FA0199B58EC1257ABC0043DD61-HoffartCIKM2012
BibTex Citekey: HoffartCIKM2012
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: 21st ACM International Conference on Information and Knowledge Management
Veranstaltungsort: Maui, Hawaii, USA
Start-/Enddatum: 2012-10-29 - 2012-11-02

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: CIKM'12
  Untertitel : The Proceedings of the 21st ACM International Conference on Information and Knowledge Management
  Kurztitel : CIKM 2012
Genre der Quelle: Konferenzband
 Urheber:
Chen, Xue-Wen1, Herausgeber
Lebanon, Guy1, Herausgeber
Wang, Haixun1, Herausgeber
Zaki, Mohammed J.1, Herausgeber
Affiliations:
1 External Organizations, ou_persistent22            
Ort, Verlag, Ausgabe: New York, NY : ACM
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 545 - 554 Identifikator: ISBN: 978-1-4503-1156-4