Improving RDF Data Through Association Rule Mining

• Published in: Datenbank-Spektrum : Zeitschrift für Datenbanktechnologie : Organ der Fachgruppe Datenbanken der Gesellschaft für Informatik e.V Vol. 13; no. 2; pp. 111 - 120
• Main Authors: Abedjan, Ziawasch, Naumann, Felix
• Format: Journal Article
• Language: English
• Published: Berlin/Heidelberg Springer-Verlag 01.07.2013
• Subjects: Computer Science; Computer Systems Organization and Communication Networks; Data Mining and Knowledge Discovery; Data Structures and Information Theory; Database Management; Information Storage and Retrieval; IT in Business; Schwerpunktbeitrag; Schema analysis; Association rule mining; Linked open data; RDF
• ISSN: 1618-2162; 1610-1995
• DOI: 10.1007/s13222-013-0126-x

Linked Open Data comprises very many and often large public data sets, which are mostly presented in the Rdf triple structure of subject, predicate, and object. However, the heterogeneity of available open data requires significant integration steps before it can be used in applications. A promising and novel technique to explore such data is the use of association rule mining. We introduce “mining configurations”, which allow us to mine Rdf data sets in various ways. Different configurations enable us to identify schema and value dependencies that in combination result in interesting use cases. We present rule-based approaches for predicate suggestion, data enrichment, ontology improvement, and query relaxation. On the one hand we prevent inconsistencies in the data through predicate suggestion, enrichment with missing facts, and alignment of the corresponding ontology. On the other hand we support users to handle inconsistencies during query formulation through predicate expansion techniques. Based on these approaches, we show that association rule mining benefits the integration and usability of Rdf data.