Parallelization and distribution techniques for ontology matching in urban computing environments

In recent years, ontology matching systems have had a growing interest in terms of reasoning capabilities, and we propose that a combination of these strategies with pattern-

To answer the question how the additional Wikipedia editions inuence the per- formance of the mapping between Wikipedia and Cyc (cf. [2]) we have dened the following tasks: 1)

It is worth noting that some match- ing approaches first partition the ontology graphs and then determine simi- lar partitions such as COMA++ [1,2] and Falcon-AO [4], while others

We developed two dierent approa- ches and a combined approach that are based on a large biomedical ontology, its alignment to the competence eld ontology designed by us, and

The final component is Best Match Pairs Selection and Interpretation where bi-objective optimization problem is solved using Pareto optimization technique wherein both

The ideal way of crowdsourcing ontology matching is to design microtasks (t) around alignment correspondences and to ask workers (w) if they are valid or not.. c w (t) =v ≡ House

[r]

Evaluating different matchers on these generated tests, we have observed that (a) the difficulties en- countered by a matcher at a test are preserved across the seed ontology,