Home |  ENGLISH |  Kontakt |  Impressum |  Anmelden |  KIT

Inproceedings3503

Aus Aifbportal

Wechseln zu: Navigation, Suche

(This page contains COinS metadata)

Efficient Graph-based Document Similarity


Christian Paul, Achim RettingerAditya Mogadala, Craig A. Knoblock, Pedro Szekely



Published: 2016 Juni
Herausgeber: Harald Sack, Eva Blomqvist, Mathieu d'Aquin, Chiara Ghidini, Simone Paolo Ponzetto, Christoph Lange
Buchtitel: The Semantic Web. Latest Advances and New Domains. 13th Extended Semantic Web Conference (ESWC), Crete, Greece.
Seiten: http://people.aifb.kit.edu/amo/eswc2016/
Verlag: Springer International Publishing.
Referierte Veröffentlichung
Note: Best Research Paper Nominee.
BibTeX

Kurzfassung
Assessing the relatedness of documents is at the core of many applications such as document retrieval and recommendation. Most similarity approaches operate on word-distribution based document representations - fast to compute, but problematic when documents differ in language, vocabulary or type and neglecting the rich relational knowledge available in Knowledge Graphs. In contrast, graph-based document models can leverage valuable knowledge about relations between entities - however, due to expensive graph operations, similarity assessments tend to become in-feasible in many applications. This paper presents an efficient semantic similarity approach exploiting explicit hierarchical and traversal relations. We show in our experiments that (i) our similarity measure provides a significantly higher correlation with human notions of document similarity than comparable measures, (ii) this also holds for short documents with few annotations, (iii) document similarity can be calculated efficiently compared to other graph-traversal based approaches.

Download: Media:ESWC16-Camera-Ready.pdf,Media:Paul-Rettinger-DocSim slides.pdf

Projekt

XLiMe



Forschungsgruppe

Web Science und Wissensmanagement


-->