Several approaches have been used in the last years to compute similarity between entities. In this paper, we present a novel approach to compute similarity between entities using their features available as Linked Data. The key idea of the proposed framework, called SELEcTor, is to exploit ranked lists of features extracted from Linked Data sources as a representation of the entities we want to compare. The similarity between two entities is thus mapped to the problem of comparing two ranked lists. Our experiments, conducted with museum data from DBpedia, demonstrate that SELEcTor achieves better accuracy than stateof-the-art methods.
|Data di pubblicazione:||2017|
|Titolo:||SELEcTor: Discovering Similar Entities on LinkEd DaTa by Ranking Their Features|
|Titolo del libro:||Proceedings - IEEE 11th International Conference on Semantic Computing, ICSC 2017|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1109/ICSC.2017.46|
|Appare nelle tipologie:||4.1 Articolo in Atti di convegno|