Matches in ScholarlyData for { ?s ?p ?o. }
- item-5 type ListItem.
- item-5 hasContent isabel-cruz.
- item-5 next item-6.
- item-5 previous item-4.
- item-6 type ListItem.
- item-6 hasContent francisco-m-couto.
- item-6 previous item-5.
- paper-34 type InProceedings.
- paper-34 label "Knowledge Graph Identification".
- paper-34 sameAs paper-34.
- paper-34 abstract "Large-scale information processing systems are able to extract massive collections of interrelated facts, but unfortunately transforming these candidate facts into useful knowledge is a formidable challenge. In this paper, we show how uncertain extractions about entities and their relations can be transformed into a know ledge graph. The extractions form an extraction graph and we refer to the task of removing noise, inferring missing information, and determining which candidate facts should be included into a knowledge graph as know ledge graph identification. In order to perform this task, we must reason jointly about candidate facts and their associated extraction confidences, identify coreferent entities, and incorporate ontological constraints. Our proposed approach uses probabilistic soft logic (PSL), a recently introduced probabilistic modeling framework which easily scales to millions of facts. We demonstrate the power of our method on a synthetic Linked Data corpus derived from the MusicBrainz music community and a real-world set of extractions from the NELL pro ject containing over 1M extractions and 70K ontological relations. We show that compared to existing methods, our approach is able to achieve improved AUC and F1 with significantly lower running time.".
- paper-34 hasAuthorList authorList.
- paper-34 isPartOf proceedings-1.
- paper-34 title "Knowledge Graph Identification".
- 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 jay-pujara.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent hui-miao.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent lise-getoor.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent william-cohen.
- item-4 previous item-3.
- paper-35 type InProceedings.
- paper-35 label "Ontology-Based Data Access: Ontop of Databases".
- paper-35 sameAs paper-35.
- paper-35 abstract "We present the architecture and technologies underpinning the OBDA system Ontop and taking full advantage of storing data in relational databases. We discuss the theoretical foundations of Ontop : the tree-witness query rewriting, T -mappings and optimisations based on database integrity constraints and SQL features. We analyse the performance of Ontop in a series of experiments and demonstrate that, for standard ontologies, queries and data stored in relational databases, Ontop is fast, efficient and produces SQL rewritings of high quality.".
- paper-35 hasAuthorList authorList.
- paper-35 isPartOf proceedings-1.
- paper-35 title "Ontology-Based Data Access: Ontop of Databases".
- 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 mariano-rodriguez-muro.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent roman-kontchakov.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent michael-zakharyaschev.
- item-3 previous item-2.
- paper-36 type InProceedings.
- paper-36 label "DAW: Duplicate-AWare Federated Query Processing over the Web of Data".
- paper-36 sameAs paper-36.
- paper-36 abstract "Over the last years the Web of Data has developed into a large compendium of interlinked data sets from multiple domains. Due to the decentralised architecture of this compendium, several of these datasets contain duplicated data. Yet, so far, only little attention has been paid to the effect of duplicated data on federated querying. This work presents DAW, a novel duplicate-aware approach to federated querying over the Web of Data. DAW is based on a combination of min-wise independent permutations and compact data summaries. It can be directly combined with existing federated query engines in order to achieve the same query recall values while querying fewer data sources. We extend three well-known federated query processing engines – DARQ, SPLENDID, and FedX – with DAW and compare our extensions with the original approaches. The comparison shows that DAW can greatly reduce the number of queries sent to the endpoints, while keeping high query recall values. Therefore, it can significantly improve the performance of federated query processing engines. Moreover, DAW provides a source selection mechanism that maximises the query recall, when the query processing is limited to a subset of the sources.".
- paper-36 hasAuthorList authorList.
- paper-36 isPartOf proceedings-1.
- paper-36 title "DAW: Duplicate-AWare Federated Query Processing over the Web of Data".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasItem item-5.
- authorList hasLastItem item-5.
- item-1 type ListItem.
- item-1 hasContent muhammad-saleem.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent axel-cyrille-ngonga-ngomo.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent josiane-xavier-parreira.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent helena-deus.
- item-4 next item-5.
- item-4 previous item-3.
- item-5 type ListItem.
- item-5 hasContent manfred-hauswirth.
- item-5 previous item-4.
- paper-37 type InProceedings.
- paper-37 label "On the Status of Experimental Research on the Semantic Web".
- paper-37 sameAs paper-37.
- paper-37 abstract "Experimentation is an important way to validate results of Semantic Web and Computer Science research in general. In this paper, we investigate the development and the current status of experimental work on the Semantic Web. Based on a corpus of 500 papers collected from the International Semantic Web Conferences (ISWC) over the past decade, we analyse the importance and the quality of experimental research conducted and compare it to general Computer Science. We observe that the amount and quality of experiments are steadily increasing over time. Unlike hypothesised, we cannot confirm a statistically significant correlation between a paper’s citations and the amount of experimental work reported. Our analysis, however, shows that papers comparing themselves to other systems are more often cited than other papers.".
- paper-37 hasAuthorList authorList.
- paper-37 isPartOf proceedings-1.
- paper-37 title "On the Status of Experimental Research on the Semantic Web".
- authorList type List.
- authorList hasFirstItem item-1.