Matches in ScholarlyData for { ?s ?p ?o. }
- authorList hasLastItem item-2.
- item-1 type ListItem.
- item-1 hasContent kjetil-kjernsmo.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent john-s-tyssedal.
- item-2 previous item-1.
- paper-24 type InProceedings.
- paper-24 label "Towards a systematic benchmarking of ontology-based query rewriting systems".
- paper-24 sameAs paper-24.
- paper-24 abstract "Query rewriting is one of the fundamental steps in ontologybased data access (OBDA) approaches. It takes as inputs an ontology and a query written according to that ontology, and produces as an output a set of queries that should be evaluated to account for the inferences that should be considered for that query and ontology. Different query rewriting systems give support to different ontology languages with varying expressiveness, and the rewritten queries obtained as an output do also vary in expressiveness. This heterogeneity has traditionally made it difficult to compare different approaches, and the area lacks in general commonly agreed benchmarks that could be used not only for such comparisons but also for improving OBDA support. In this paper we compile data, dimensions and measurements that have been used to evaluate some of the most recent systems, we analyse and characterise these assets, and provide a unified set of them that could be used as a starting point towards a more systematic benchmarking process for such systems. Finally, we apply this initial benchmark with some of the most relevant OBDA approaches in the state of the art.".
- paper-24 hasAuthorList authorList.
- paper-24 isPartOf proceedings-2.
- paper-24 title "Towards a systematic benchmarking of ontology-based query rewriting systems".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasLastItem item-2.
- item-1 type ListItem.
- item-1 hasContent jose-mora.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent oscar-corcho.
- item-2 previous item-1.
- paper-25 type InProceedings.
- paper-25 label "Evaluation measures for ontology matchers in supervised matching scenarios".
- paper-25 sameAs paper-25.
- paper-25 abstract "Precision and Recall, as well as their combination in terms of F-Measure, are widely used measures in computer science and generally applied to evaluate the overall performance of ontology matchers in fully automatic, unsupervised scenarios. In this paper, we investigate the case of supervised matching, where automatically created ontology alignments are verified by an expert. We motivate and describe this use case and its characteristics and discuss why traditional, F-measure based evaluation measures are not suitable for this use case. Therefore, we investigate several alternative evaluation measures and propose the use of Precision@N curves as a mean to assess different matching systems for supervised matching. We compare the ranking of several state of the art matchers using Precision@N curves to the traditional F-measure based ranking, and discuss means to combine matchers in a way that optimizes the user support in supervised ontology matching.".
- paper-25 hasAuthorList authorList.
- paper-25 isPartOf proceedings-2.
- paper-25 title "Evaluation measures for ontology matchers in supervised matching scenarios".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent dominique-ritze.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent heiko-paulheim.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent kai-eckert.
- item-3 previous item-2.
- paper-26 type InProceedings.
- paper-26 label "Evaluating and benchmarking SPARQL query containment solvers".
- paper-26 sameAs paper-26.
- paper-26 abstract "Query containment is the problem of deciding if the answers to a query are included in those of another query for any queried database. This problem is very important for query optimization purposes. In the SPARQL context, it can be equally useful. This problem has recently been investigated theoretically and some query containment solvers are available. Yet, there were no benchmarks to compare theses systems and foster their improvement. In order to experimentally assess implementation strengths and limitations, we provide a rst SPARQL containment test benchmark. It has been designed with respect to both the capabilities of existing solvers and the study of typical queries. Some solvers support optional constructs and cycles, while other solvers support pro jection, union of conjunctive queries and RDF Schemas. No solver currently supports all these features or OWL entailment regimes. The study of query demographics on DBPedia logs shows that the vast ma jority of queries are acyclic and a signicant part of them uses UNION or pro jection. We thus test available solvers on their domain of applicability on three dierent benchmark suites. These experiments show that (i) tested solutions are overall functionally correct, (ii) in spite of its complexity, SPARQL query containment is practicable for acyclic queries, (iii) state-of-the-art solvers are at an early stage both in terms of capability and implementation.".
- paper-26 hasAuthorList authorList.
- paper-26 isPartOf proceedings-2.
- paper-26 title "Evaluating and benchmarking SPARQL query containment solvers".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasLastItem item-4.
- item-1 type ListItem.
- item-1 hasContent melisachew-wudage-chekol.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent jerome-euzenat.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent pierre-geneves.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent nabil-layaieda.
- item-4 previous item-3.
- paper-27 type InProceedings.
- paper-27 label "Assessing Content Value for Digital Publishing through Relevance and Provenance-based Trust".
- paper-27 sameAs paper-27.
- paper-27 abstract "Due to the abundance of content on the Web, content authors and publishers have a pressing need for systems that select content that is valuable for them, is trustworthy and is related to their own work. Additionally, the value of their own work needs to be assessed before it is published, to guarantee high value for the consumer. In this doctoral research, we investigate how to use Semantic Web technologies to automatically assess the value of content that is – or is about to be – digitally published. To achieve this, we propose methods to assess the relevance of content to existing publications, retrieve or reconstruct its provenance, and derive a trust assessment from this provenance. We discuss our evaluation methods, and present some preliminary results.".
- paper-27 hasAuthorList authorList.
- paper-27 isPartOf proceedings-2.
- paper-27 title "Assessing Content Value for Digital Publishing through Relevance and Provenance-based Trust".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasLastItem item-1.
- item-1 type ListItem.
- item-1 hasContent tom-de-nies.
- paper-28 type InProceedings.
- paper-28 label "The effects of Licensing on Open Data: Computing a measure of health for our Scholarly Record".
- paper-28 sameAs paper-28.
- paper-28 abstract "As data collections become established in key disciplines, some of the longstanding barriers to data sharing become to dissolve; yet others remain. While metadata and ontologies help overcome the problems of finding and interpreting data, the lack of clarity over licensing remains a real impediment to data reuse. Freedom from legal restriction and uncertainty is essential for the effective sharing, combining and deriving of data from these distributed collections. Reuse and recombination of data will be greatly facilitated by expanding the definition of the semantic web to include the semantics of data licensing. We aim to express licensing terms in a computable manner, within the context of research practice, enabling us to infer the resulting state of rights, obligations and conditions that are inherited by derived and recombined datasets, using a mixed bag of licenses. Building off this we aim to simulate the effects of varying licensing practices within communities, proposing a measure of health of our scholarly record based on compatibility and restrictiveness of the licenses contained therein.".
- paper-28 hasAuthorList authorList.
- paper-28 isPartOf proceedings-2.
- paper-28 title "The effects of Licensing on Open Data: Computing a measure of health for our Scholarly Record".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.