2007 OntologyMatching

From GM-RKB
Jump to navigation Jump to search

Subject Headings: Ontology Matching Task, Ontology Matching Algorithm.

Notes

Cited By

Quotes

About this book

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 Shvaiko’s 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, artificial intelligence.

With Ontology Matching, researchers and practitioners will find a reference book which presents currently available work in a uniform framework. In particular, the work and the techniques presented in this book can equally be 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 detailed account of matching techniques and matching systems in a systematic way from theoretical, practical and application perspectives.

1.0 Introduction

2.1 Vocabularies, schemas and ontologies

An ontology can be viewed as a set of assertions that are meant to model some particular domain. Usually, the ontology defines a vocabulary used by a particular applications. In various areas of computer science there are different data and conceptual models that can be thought of as ontologies. These are, for instance, folksonomies, database schemas, UML models, directories, thesauri, XML schemas and formal ontologies (axiomatised theories).

2.1.2 Directories

A taxonomy is a partially ordered set of taxons (classes) in which one taxon is greater than another one only if what it denotes includes what is denoted by the other.

References


,

 AuthorvolumeDate ValuetitletypejournaltitleUrldoinoteyear
2007 OntologyMatchingJérôme Euzenat
Pavel Shvaiko
Ontology MatchingSpringerhttp://www.springer.com/computer/database+management+&+information+retrieval/book/978-3-540-49611-32007
19 June 55557 12:00:00