Unsupervised Learning of Link Discovery Configuration

• Published in: The Semantic Web: Research and Applications pp. 119 - 133
• Main Authors: Nikolov, Andriy, d’Aquin, Mathieu, Motta, Enrico
• Format: Book Chapter
• Language: English
• Published: Berlin, Heidelberg Springer Berlin Heidelberg
• Series: Lecture Notes in Computer Science
• Subjects: Candidate Solution; Decision Rule; Genetic Algorithm; Ontology Match; Unsupervised Learn
• ISBN: 9783642302831; 3642302831
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-642-30284-8_15

Discovering links between overlapping datasets on the Web is generally realised through the use of fuzzy similarity measures. Configuring such measures is often a non-trivial task that depends on the domain, ontological schemas, and formatting conventions in data. Existing solutions either rely on the user’s knowledge of the data and the domain or on the use of machine learning to discover these parameters based on training data. In this paper, we present a novel approach to tackle the issue of data linking which relies on the unsupervised discovery of the required similarity parameters. Instead of using labeled data, the method takes into account several desired properties which the distribution of output similarity values should satisfy. The method includes these features into a fitness criterion used in a genetic algorithm to establish similarity parameters that maximise the quality of the resulting linkset according to the considered properties. We show in experiments using benchmarks as well as real-world datasets that such an unsupervised method can reach the same levels of performance as manually engineered methods, and how the different parameters of the genetic algorithm and the fitness criterion affect the results for different datasets.