Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:




Library Locked Library locked




Author, Editor

Author(s):

Hoffart, Johannes
Seufert, Stephan
Ba Nguyen, Dat
Theobald, Martin
Weikum, Gerhard

dblp
dblp
dblp
dblp
dblp



Editor(s):

Chen, Xue-Wen
Lebanon, Guy
Wang, Haixun
Zaki, Mohammed J.

dblp
dblp
dblp
dblp

Not MPII Editor(s):

Chen, Xue-Wen
Lebanon, Guy
Wang, Haixun
Zaki, Mohammed J.

BibTeX cite key*:

HoffartCIKM2012

Title, Booktitle

Title*:

KORE: keyphrase overlap relatedness for entity disambiguation

Booktitle*:

CIKM'12 : The Proceedings of the 21st ACM International Conference on
Information and Knowledge Management

Event, URLs

URL of the conference:

http://www.cikm2012.org/

URL for downloading the paper:

http://doi.acm.org/10.1145/2396761.2396832

Event Address*:

Maui, Hawaii, USA

Language:

English

Event Date*
(no longer used):


Organization:


Event Start Date:

29 October 2012

Event End Date:

2 November 2012

Publisher

Name*:

ACM

URL:


Address*:

New York, NY

Type:


Vol, No, Year, pp.

Series:


Volume:


Number:


Month:


Pages:

545-554

Year*:

2012

VG Wort Pages:

12

ISBN/ISSN:

978-1-4503-1156-4

Sequence Number:


DOI:

10.1145/2396761.2396832



Note, Abstract, ©


(LaTeX) 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.

Keywords:

Semantic Relatedness, Entity Relatedness, Entity Disambiguation, Locality-Sensitive Hashing



Download
Access Level:

Internal

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Databases and Information Systems Group

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{HoffartCIKM2012,
AUTHOR = {Hoffart, Johannes and Seufert, Stephan and Ba Nguyen, Dat and Theobald, Martin and Weikum, Gerhard},
EDITOR = {Chen, Xue-Wen and Lebanon, Guy and Wang, Haixun and Zaki, Mohammed J.},
TITLE = {KORE: keyphrase overlap relatedness for entity disambiguation},
BOOKTITLE = {CIKM'12 : The Proceedings of the 21st ACM International Conference on
Information and Knowledge Management},
PUBLISHER = {ACM},
YEAR = {2012},
PAGES = {545--554},
ADDRESS = {Maui, Hawaii, USA},
ISBN = {978-1-4503-1156-4},
DOI = {10.1145/2396761.2396832},
}


Entry last modified by Anja Becker, 03/12/2013
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
[Library]
Created
11/20/2012 01:21:15 PM
Revisions
11.
10.
9.
8.
7.
Editor(s)
Anja Becker
Klaus Berberich
Anja Becker
Anja Becker
Anja Becker
Edit Dates
12.03.2013 11:44:14
02/28/2013 11:37:19 AM
25.02.2013 10:42:57
22.02.2013 10:56:02
02/22/2013 08:25:28 AM