• Aucun résultat trouvé

On Ontology Matching Problems

N/A
N/A
Protected

Academic year: 2021

Partager "On Ontology Matching Problems"

Copied!
9
0
0

Texte intégral

Loading

Figure

Figure 1: An example of an ontology represented as a hierarchy of classes (a) and a hierarchy of relations (b)(b) Author SomeRelation CreatedByHasNumberPhoneNumberCreateinverseOf (a)  is_a (specialization) domain range FileTextualDocument
Figure 2. ASCO results on two ontologies O’COMMA and O’Aprobatiom

Références

Documents relatifs

We can increase the flux by adding a series of fins, but there is an optimum length L m for fins depending on their thickness e and the heat transfer coefficient h. L m ~ (e

functions reuches the extreme bound of 9 possible simplification.. function belongs to

We prove that the strong detonation travelling waves for a viscous combustion model are nonlinearly stable, that is, for a given perturbation of a travelling wave, the

Databases like Wikipedia (especially the categorization schema used within) or RDF or ontology based information systems like DBpedia or freebase 3 (both initialized by

The experiments revealed that using background ontologies published on the semantic web provide low but stable increase of recall as compared to a simple direct matching..

This work presents: (1) the logical characterization of the capability of bridge rules and individual correspondences to propagate concept membership assertions across mapped

We applied semantic category matching (SCM) technology to the ontology alignment problem. Our method found pairs of semantically corresponding categories between two

By viewing the nodes in ontology as a probability distribution of interests of the user, an ontology of a user can be used to predict his or her similarity of interest to the