abstract = "Both established and emergent business rely heavily on
data, chiefly those that wish to become game changers.
The current biggest source of data is the Web, where
there is a large amount of sparse data. The Web, where
there is a large amount of sparse data. To realise this
vision, it is required that the resources in different
data sources that refer to the same real-world entities
must be linked which is the key factor for such a
unified view. Link discovery is a trending task that
aims at finding link rules that specify whether these
links must be established or not. Currently there are
many proposals in the literature to produce these
links, especially based on meta-heuristics.
Unfortunately creating proposals based on
meta-heuristics is not a trivial task, which has led to
a lack of comparison between some well-established
proposals. On the other hand, it has been proved that
these link rules fall short in cases in which resources
that refer to different real-world entities are very
similar or vice versa. In this dissertation, we
introduce several proposals to address the previous
lacks in the literature. On the one hand we, introduce
Eva4LD, , which is a generic framework to build generic
programming proposals for link discovery; which are a
kind of meta-heuristics proposals. Furthermore, our
framework allows to implement many proposals in the
literature and compare their results fairly. On the
other hand, we introduce Teide, which applies
effectively the link rules increasing significantly
their precision without dropping their recall
significantly. Unfortunately, Teide does not learn link
rules, and applying all the provided link rules is
computationally expensive. Due to this reason we
introduce Sorbas, which learns what we call contextual
link rules.",