An evolutionary approach for learning the weight of relations in linked data

Abstract

In this paper we present an approach for improving a specific class of semantic annotation, that relates a term of the document with a (sub)tree of the ontology, instead of linking a term with a single concept of the ontology. An important part of this class of annotation is filtering the relevant (sub)nodes and relations, because the returned graph should only contain relevant information, that is, nodes that are truly related with the topics of the document. In addition, we consider that the relevance of nodes vary depending on if the node is a branch or a leaf, that is, if the node has links to other nodes or it is a text-based description. This paper focuses on the relevance of branch nodes, which is calculated from the relevance of its links, since leaf nodes relevance is usually estimated by similarity metrics. Specifically, our approach incises in learning (through a genetic algorithm) and assigning the most appropriate weights to these links in order to reduce the precision/recall curve of the annotation process. The results show that our solution is viable and outperforms the state of the art approaches.