Research On Tree Segmentation-based Ontology Mapping

Ontology mapping plays a crucial role in the process of ontology reuse and integration. The development of it makes great sense to the applications of ontology query and reasoning in the semantic web. This thesis focuses on this issue.Firstly, the research background of the thesis is briefly introduced, after which the state of the art of the ontology mapping technology is elaborated, as well as the development trend of the mapping technology.Secondly, aiming at the problem of relatively low efficiency for the current ontology mapping algorithms in the aspect of time expense, an ontology mapping method based on sub-tree mapping is proposed. It first divides the ontology into a set of sub-trees with different granularities according to the structure of the ontology, and then uses sub-tree mapping algorithm to map them. Afterwards, the time complexity of the Tree Segmentation Algorithm and Sub-tree Mapping Algorithm are analyzed respectively, after which the effectiveness of these algorithms are tested by using the test set provided by OAEI. Time complexity on algorithm and the experimental results show that the proposed method has made great improvement on the mapping efficiency compared with the current mapping algorithms while preserving the mapping precision and recall.Finally, aiming at the problem of discovering only the simplest complex mappings for the current complex mapping algorithms, a complex mapping method based on the containing relation and equivalent relation is proposed. It first discovers complex mappings by using information provided by the existed mappings, instance and property and so on which are based on the containing relation, and then finds mappings from the aspect of equivalent nodes and equivalent templates which are based on the equivalent relation. Experimental results show that the proposed method is comparatively good.