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
The availability of encyclopedic Linked Open Data (LOD) paves the way to a new generation of knowled...
Novel research in the field of Linked Data focuses on the problem of entity summarization. This fiel...
To utilize the similarity information hidden in the Web graph, we investigate the problem of adaptiv...
Several approaches have been used in the last years to compute similarity between entities. In this ...
This article presents a novel approach to estimate semantic entity sim- ilarity using entity feature...
The World Wide Web provides a wealth of data that can be harnessed to help improve information retri...
Abstract. Linked Data allows structured data to be published in a standard way that datasets from va...
This paper describes the effect of introducing embeddingbased features in a learning to rank approac...
The World Wide Web provides a wealth of data that can be harnessed to help improve information retri...
Data objects in a relational database are cross-linked with each other via multi-typed links. Links ...
Link analysis ranking methods are widely used for summarizing the connectivity structure of large ne...
Dataset interlinking is a great important problem in Linked Data. We consider this problem from the ...
Many text mining tasks, such as clustering, classification, retrieval, and named entity linking, ben...
This work presents a new perspective on characterizing the similarity between elements of a database...
The discovery of useful data for a given problem is of primary importance since data scientists usua...
The availability of encyclopedic Linked Open Data (LOD) paves the way to a new generation of knowled...
Novel research in the field of Linked Data focuses on the problem of entity summarization. This fiel...
To utilize the similarity information hidden in the Web graph, we investigate the problem of adaptiv...
Several approaches have been used in the last years to compute similarity between entities. In this ...
This article presents a novel approach to estimate semantic entity sim- ilarity using entity feature...
The World Wide Web provides a wealth of data that can be harnessed to help improve information retri...
Abstract. Linked Data allows structured data to be published in a standard way that datasets from va...
This paper describes the effect of introducing embeddingbased features in a learning to rank approac...
The World Wide Web provides a wealth of data that can be harnessed to help improve information retri...
Data objects in a relational database are cross-linked with each other via multi-typed links. Links ...
Link analysis ranking methods are widely used for summarizing the connectivity structure of large ne...
Dataset interlinking is a great important problem in Linked Data. We consider this problem from the ...
Many text mining tasks, such as clustering, classification, retrieval, and named entity linking, ben...
This work presents a new perspective on characterizing the similarity between elements of a database...
The discovery of useful data for a given problem is of primary importance since data scientists usua...
The availability of encyclopedic Linked Open Data (LOD) paves the way to a new generation of knowled...
Novel research in the field of Linked Data focuses on the problem of entity summarization. This fiel...
To utilize the similarity information hidden in the Web graph, we investigate the problem of adaptiv...