The term “Linked Data” refers to a set of best practices for publishing and connecting structured data on the Web. These best practices have been adopted by an increasing number of data providers over the last three years, leading to the creation of a global data space containing billions of assertions— the Web of Data. In this article, the authors present the concept and technical principles of Linked Data, and situate these within the broader context of related technological developments. They describe progress to date in publishing Linked Data on the Web, review applications that have been developed to exploit the Web of Data, and map out a research agenda for the Linked Data community as it moves forward.

/pdf/linked-data-the-story-so-far-2a9zvmaysa.pdf

Linked Data - the story so far

With digital equipment becoming increasingly networked, either on wired or wireless networks, for personal and professional use alike, distributed software systems have become a crucial element in information and communications technologies. The study of these systems forms the core of the ARLES' work, which is specifically concerned with defining new system software architectures, based on the use of emerging networking technologies. In this context, we concentrate on the study of distributed systems which bring to life the vision of ubiquitous computing systems, also known as ambient intelligence.

반도체 공정 overview

Ontologies tend to be found everywhere. They are viewed as the silver bullet for many applications, such as database integration, peer-to-peer systems, e-commerce, semantic web services, or social networks. However, in open or evolving systems, such as the semantic web, different parties would, in general, adopt different ontologies. Thus, merely using ontologies, like using XML, does not reduce heterogeneity: it just raises heterogeneity problems to a higher level. Euzenat and Shvaikos book is devoted to ontology matching as a solution to the semantic heterogeneity problem faced by computer systems. Ontology matching aims at finding correspondences between semantically related entities of different ontologies. These correspondences may stand for equivalence as well as other relations, such as consequence, subsumption, or disjointness, between ontology entities. Many different matching solutions have been proposed so far from various viewpoints, e.g., databases, information systems, and artificial intelligence. The second edition of Ontology Matching has been thoroughly revised and updated to reflect the most recent advances in this quickly developing area, which resulted in more than 150 pages of new content. In particular, the book includes a new chapter dedicated to the methodology for performing ontology matching. It also covers emerging topics, such as data interlinking, ontology partitioning and pruning, context-based matching, matcher tuning, alignment debugging, and user involvement in matching, to mention a few. More than 100 state-of-the-art matching systems and frameworks were reviewed. With Ontology Matching, researchers and practitioners will find a reference book that presents currently available work in a uniform framework. In particular, the work and the techniques presented in this book can be equally applied to database schema matching, catalog integration, XML schema matching and other related problems. The objectives of the book include presenting (i) the state of the art and (ii) the latest research results in ontology matching by providing a systematic and detailed account of matching techniques and matching systems from theoretical, practical and application perspectives.

Ontology Matching

The World Wide Web has enabled the creation of a global information space comprising linked documents. As the Web becomes ever more enmeshed with our daily lives, there is a growing desire for direct access to raw data not currently available on the Web or bound up in hypertext documents. Linked Data provides a publishing paradigm in which not only documents, but also data, can be a first class citizen of the Web, thereby enabling the extension of the Web with a global data space based on open standards - the Web of Data. In this Synthesis lecture we provide readers with a detailed technical introduction to Linked Data. We begin by outlining the basic principles of Linked Data, including coverage of relevant aspects of Web architecture. The remainder of the text is based around two main themes - the publication and consumption of Linked Data. Drawing on a practical Linked Data scenario, we provide guidance and best practices on: architectural approaches to publishing Linked Data; choosing URIs and vocabularies to identify and describe resources; deciding what data to return in a description of a resource on the Web; methods and frameworks for automated linking of data sets; and testing and debugging approaches for Linked Data deployments. We give an overview of existing Linked Data applications and then examine the architectures that are used to consume Linked Data from the Web, alongside existing tools and frameworks that enable these. Readers can expect to gain a rich technical understanding of Linked Data fundamentals, as the basis for application development, research or further study.

Linked Data: Evolving the Web into a Global Data Space

Schema and ontology matching is a critical problem in many application domains, such as semantic web, schema/ontology integration, data warehouses, e-commerce, etc. Many different matching solutions have been proposed so far. In this paper we present a new classification of schema-based matching techniques that builds on the top of state of the art in both schema and ontology matching. Some innovations are in introducing new criteria which are based on (i) general properties of matching techniques, (ii) interpretation of input information, and (iii) the kind of input information. In particular, we distinguish between approximate and exact techniques at schema-level; and syntactic, semantic, and external techniques at element- and structure-level. Based on the classification proposed we overview some of the recent schema/ontology matching systems pointing which part of the solution space they cover. The proposed classification provides a common conceptual basis, and, hence, can be used for comparing different existing schema/ontology matching techniques and systems as well as for designing new ones, taking advantages of state of the art solutions.

/pdf/a-survey-of-schema-based-matching-approaches-1iseu9xjqp.pdf

A survey of schema-based matching approaches

The LNCS Journal on Data Semantics is devoted to the presentation of notable work that, in one way or another, addresses research and development on issues related to data semantics. The scope of the journal ranges from theories supporting the formal definition of semantic content to innovative domain-specific applications of semantic knowledge. The journal addresses researchers and advanced practitioners working on the semantic web, interoperability, mobile information services, data warehousing, knowledge representation and reasoning, conceptual database modeling, ontologies, and artificial intelligence. Volume XI contains extended versions of eight revised and selected papers from several international workshops in the field, which took place in 2006.

Journal on Data Semantics XI

13th International Conference on Cooperative Information Systems (CoopIS 2005).- Semantic Matching: Algorithms and Implementation.- Semantics-Guided Clustering of Heterogeneous XML Schemas.- A Formal Framework for Adaptive Access Control Models.- C&O-2005: The AAAI'05 Workshop on Contexts and Ontologies.- Putting Things in Context: A Topological Approach to Mapping Contexts to Ontologies.- 4th International Conference on Ontologies, DataBases, and Applications of Semantics (ODBASE 2005).- Creating Ontologies for Content Representation-The OntoSeed Suite.- Security Ontology to Facilitate Web Service Description and Discovery.

Journal on data semantics IX

Matching between concepts describing the meaning of services representing heterogeneous information sources is a key operation in many application domains, including web service coordination, data integration, peer-to-peer information sharing, query answering, and so on. In this paper we present an evaluation of an ontology matching approach, specifically of structure-preserving semantic matching (SPSM) solution. In particular, we discuss the SPSM approach used to reduce the semantic heterogeneity problem among geo web services and we evaluate the SPSM solution on real world GIS ESRI ArcWeb services. The first experiment included matching of original web service method signatures to synthetically alterated ones. In the second experiment we compared a manual classification of our dataset to the automatic (unsupervised) classification produced by SPSM. The evaluation results demonstrate robustness and good performance of the SPSM approach on a large (ca. 700 000) number of matching tasks.

/pdf/an-evaluation-of-ontology-matching-in-geo-service-22owmk3vu7.pdf

An evaluation of ontology matching in geo-service applications

In this paper we report our work on the implementation of a semantic geocatalogue for the spatial data infrastructure (SDI) of the Trentino region, Italy.

/pdf/a-semantic-geo-catalogue-implementation-for-a-regional-sdi-1abkvbc89n.pdf

Pavel Shvaiko

Papers

Journal on Data Semantics XI

Journal on data semantics IX

An evaluation of ontology matching in geo-service applications

A semantic geo-catalogue implementation for a regional SDI

Context-driven Disambiguation in Ontology Elicitation