RKBExplorer.com:A Knowledge Driven Infrastructure for Linked Data Providers

RKB Explorer is a Semantic Web application that is able to present unified views of a significant number of heterogeneous data sources. We have developed an underlying information infrastructure which is mediated by ontologies and consists of many independent triplestores. Our current dataset totals many tens of millions of triples each publicly available through both SPARQL endpoints and resolvable URIs. To realise this synergy of disparate information sources, we have deployed tools to identify co-referent URIs, and devised an architecture to allow the information to be represented and used. This paper provides a brief overview of the system including the underlying infrastructure, and a number of associated tools for both knowledge acquisition and publishing

URI Disambiguation in the Context of Linked Data

The Linked Data initiative has given rise to an increasing number of RDF datasets, many of which are freely accessible online. These resources often arise as a result of database exports; however sufficient consideration may not be given to the unseen implications caused when they are used in the wider context of the Semantic Web. This paper investigates two popular resources, DBLP and DBpedia, and discusses whether the issues regarding identity management and co-reference resolution have been suitably addressed. We find that a large percentage of authors in DBLP have been conflated, and that disambiguation pages have been incorrectly linked using owl:sameAs within DBpedia. Systems for dealing with these issues are presented, and directions are given for future research

Knowledge Enhanced Searching on the Web

The move towards a Semantic Web has been in progress for many years and more recently there have been applications that make use of semantic web technology. One of the features that made the Web so easy to use is the ability to search web pages in a matter of seconds through the use of search engines. Now that the use of OWL and RDF as a knowledge representation format is increasing, the possibility appears to improve the quality of searching by using the semantic web to enhance the ‘ordinary’ Web. This paper outlines an architecture for using distributed knowledge bases to assist and improve searching on the web

Searching on the Open Semantic Web Using a URI Identity Management Approach.Mini Thesis:PhD upgrade report

The Semantic Web has a vision that involves the production and use of large amounts of RDF data. There have been recent initiatives amongst the Semantic Web community, in particular the Linking Open Data activity and the ReSIST project, to publish large amounts of RDF that are both interlinked and dereferenceable. The proliferation of such data gives rise to millions of URIs for non-information resources such as people, places and abstract things. Frequently, different data providers will mint different URIs for the same resource, leading to the problem of coreference. This thesis describes the phenomenon of coreference, where it occurs in other disciplines and how it is relevant to the Semantic Web. A ‘Consistent Reference Service’ is proposed for URI identity management and a description of how this is being used in the infrastructure of a scalable Semantic Web system is demonstrated. One of the features that made the Web so easy to use is the ability to search web pages in a matter of seconds through the use of search engines. The URI management system described in this thesis is being integrated into the open Semantic Web. The CRS and RDF data available on the Web means that the possibility appears to improve the quality of searching by linking the Semantic Web with the ‘ordinary’ Web. This thesis outlines an architecture for using the Semantic Web to assist and improve searching on the document Web

URI Identity Management for Semantic Web Data Integration and Linkage

The Semantic Web vision involves the production and use of large amounts of RDF data. There have been recent initiatives amongst the Semantic Web community, in particular the Linking Open Data activity and our own ReSIST project, to publish large amounts of RDF that are both interlinked and dereferenceable. The proliferation of such data gives rise to millions of URIs for non-information resources such as people, places and abstract things. Frequently, different data providers will mint different URIs for the same resource, giving rise to the problem of coreference. This paper describes the phenomenon of coreference, where it occurs in other disciplines and how it is relevant to the Semantic Web. We propose a ‘Consistent Reference Service’ for URI identity management and describe how this is being used in the infrastructure of a scalable Semantic Web system

Managing URI Synonymity to Enable Consistent Reference on the Semantic Web

The Web of Data is growing at an ever increasing rate, with RDF datasets being produced in the order of billions of triples. The effect of this increase has meant that many entities for which knowledge is being published have developed a number of URI synonyms. Managing URI synonymity plays an important part in establishing a solid foundation for data inter-linkage. This paper sets out an architecture for managing URI equivalences on the Web of Data by using Consistent Reference Services. A Use Case is presented to highlight the importance of managing identity and several advantages and disadvantages of using the CRS over other coreference resolution methods are discussed

An Infrastructure for Managing URI Synonymity on the Semantic Web (Poster)

The Semantic Web vision involves the production and use of large amounts of RDF data. There have been recent initiatives amongst the Semantic Web community, in particular the Linking Open Data activity and our own ReSIST project, to publish large amounts of RDF that are both interlinked and dereferenceable. The proliferation of such data gives rise to millions of URIs for non-information resources such as people, places and abstract things. Our Consistent Reference Services provide a standard way of managing multiple URIs and finding URI equivalences. The CRS has been designed for use with all linked data Providers and is currently running on a live linked data site

Managing Co-reference on the Semantic Web

Co-reference resolution, or the determination of ‘equivalent’ URIs referring to the same concept or entity, is a significant hurdle to overcome in the realisation of large scale Semantic Web applications. However, it has only recently gained the attention of research communities in the Semantic Web context, and while activities are now underway in identifying co-referent or conflated URIs, little consideration has been given to tools and techniques for storing, manipulating, and reusing co-reference information. This paper provides an overview of the specification, implementation, interactions and experiences in using the Co-reference Resolution Service (CRS)to facilitate rigorous management of URI co-reference data, and enable interoperation between multiple Linked Open Data sources. Comparisons are made throughout the paper contrasting the differences in the way the CRS manages multiple URIs for the same resource with the emerging practice of using owl:sameAs to identify duplicate URIs. The advantages and benefits that have been gained from deploying the CRS on a site with multiple Linked Data repositories are also highlighted