Abstract
An increasing number of RDF datasets is published on the Web. A user willing to use these datasets will first have to explore them in order to determine which information is relevant for his own needs. To facilitate this exploration, we present a system which provides a thematic view of a given RDF dataset, making it easier to target the relevant resources and properties. Our system combines a density-based graph clustering algorithm with semantic clustering criteria in order to identify clusters, each one corresponding to a theme. In this paper, we will give an overview of our approach for theme identification and we will present our system along with a scenario illustrating its main features.
This work was supported by Electricity of France (EDF R&D).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bader, G., Hogue, C.: An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformatics 27, 1–27 (2003)
Bollobás, B.: Graph theory and combinatorics. In: Proceeding of the Cambridge Combinatorial Conference in Honor of Paul Erdos, vol. 43 (1989)
Castano, S., Ferrara, A., Montanelli, S.: Thematic clustering and exploration of linked data. In: Ceri, S., Brambilla, M. (eds.) Search Computing III. LNCS, vol. 7538, pp. 157–175. Springer, Heidelberg (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Ouksili, H., Kedad, Z., Lopes, S. (2014). A Tool for Theme Identification in RDF Graphs. In: Métais, E., Roche, M., Teisseire, M. (eds) Natural Language Processing and Information Systems. NLDB 2014. Lecture Notes in Computer Science, vol 8455. Springer, Cham. https://doi.org/10.1007/978-3-319-07983-7_39
Download citation
DOI: https://doi.org/10.1007/978-3-319-07983-7_39
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07982-0
Online ISBN: 978-3-319-07983-7
eBook Packages: Computer ScienceComputer Science (R0)