Abstract
Since their definition in 1992, Least Common Subsumers (LCSs) have been identified as services supporting learning by examples. Nowadays, the Web of Data offers a hypothetically unlimited dataset of interlinked and machine-understandable examples modeled as RDF resources. Such an open and continuously evolving information source is then really worth investigation to learn significant facts. In order to support such a process, in this paper we give up to the subsumption minimality requirement of LCSs to meet the peculiarities of the dataset at hand and define Common Subsumers (CSs). We also propose an anytime algorithm to find CSs of pairs of RDF resources, according to a selection of such resources, which ensures computability. © Springer International Publishing Switzerland 2013.
Cite
CITATION STYLE
Colucci, S., Donini, F. M., & Di Sciascio, E. (2013). Common subsumbers in RDF. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8249 LNAI, pp. 348–359). https://doi.org/10.1007/978-3-319-03524-6_30
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
