基于映射的树的相似度算法及其在本体匹配中的应用

摘要

The subjectivity and autonomy in ontology building and using cause many heterogeneous ontologies .Ontolo‐gy matching is the most effective solution to it .The traditional ontology matching methods that use the ontology's structure to find the matches do not really make good use of the ontology's structural feature ,which leads to considerable computation redundancies during the entire matching process .A mapping‐based algorithm is proposed ,which the similarity between the individual nodes is firstly given ,then the mapping theorem based on edit operations to transform both trees into isomorphic ones is analyzed .The outputs of the algorithm is maximum mapping of the two ontologies and its maximum similarity .The experiment proves the effectiveness and feasibility of the algorithm in ontology mapping .%本体创建和使用的自治性和主观性导致了本体异构现象的大量产生。本体匹配正是解决本体异构问题的最有效途径。传统的利用本体结构信息进行匹配的方法并未充分利用本体的树形结构特点，这导致本体匹配过程具有大量的冗余计算。论文提出了一种基于映射的匹配算法，将两棵本体树的节点之间的相似度预先得出，然后使用基于编辑操作的映射理论将两棵树转换成同构树，最终得到两个本体之间的最大相似度和最佳匹配对。实验表明，算法在本体匹配中具有较高的可行性和有效性。