[PDF][PDF] Some entities are more equal than others: statistical methods to consolidate linked data
We propose a method for consolidating entities in RDF data on the Web. Our approach is
based on a statistical analysis of the use of predicates and their associated values to identify …
based on a statistical analysis of the use of predicates and their associated values to identify …
[PDF][PDF] Bootstrapping the linked data web
Most knowledge sources on the Data Web were extracted from structured or semi-structured
data. Thus, they encompass solely a small fraction of the information available on the …
data. Thus, they encompass solely a small fraction of the information available on the …
Active knowledge: dynamically enriching RDF knowledge bases by web services
The proliferation of knowledge-sharing communities and the advances in information
extraction have enabled the construction of large knowledge bases using the RDF data …
extraction have enabled the construction of large knowledge bases using the RDF data …
RelFinder: Revealing relationships in RDF knowledge bases
Abstract The Semantic Web has recently seen a rise of large knowledge bases (such as
DBpedia) that are freely accessible via SPARQL endpoints. The structured representation of …
DBpedia) that are freely accessible via SPARQL endpoints. The structured representation of …
Reword: Semantic relatedness in the web of data
G Pirró - Proceedings of the AAAI Conference on Artificial …, 2012 - ojs.aaai.org
This paper presents REWOrD, an approach to compute semantic relatedness between
entities in the Web of Data representing real word concepts. REWOrD exploits the graph …
entities in the Web of Data representing real word concepts. REWOrD exploits the graph …
Waterfowl: A compact, self-indexed and inference-enabled immutable RDF store
In this paper we present WaterFowl, a novel approach for the storage of RDF triples that
addresses scalability issues through compression. The architecture of our prototype, largely …
addresses scalability issues through compression. The architecture of our prototype, largely …
Defining key semantics for the RDF datasets: experiments and evaluations
Many techniques were recently proposed to automate the linkage of RDF datasets.
Predicate selection is the step of the linkage process that consists in selecting the smallest …
Predicate selection is the step of the linkage process that consists in selecting the smallest …
Linksb2n: Automatic data integration for the semantic web
The ongoing trend towards open data embraced by the Semantic Web has started to
produce a large number of data sources. These data sources are published using RDF …
produce a large number of data sources. These data sources are published using RDF …
Extracting multilingual natural-language patterns for RDF predicates
Most knowledge sources on the Data Web were extracted from structured or semi-structured
data. Thus, they encompass solely a small fraction of the information available on the …
data. Thus, they encompass solely a small fraction of the information available on the …
Automatically generating data linkages using a domain-independent candidate selection approach
Abstract One challenge for Linked Data is scalably establishing high-quality owl: sameAs
links between instances (eg, people, geographical locations, publications, etc.) in different …
links between instances (eg, people, geographical locations, publications, etc.) in different …