本体结构特征分析与匹配应用研究

计算机工程与应用 ›› 2012, Vol. 48 ›› Issue (2): 43-47.

本体结构特征分析与匹配应用研究

梁帅1，2，罗强一2，黄镇鸿1

1.解放军理工大学指挥自动化学院，南京 210007
2.中国电子设备系统工程公司研究所，北京 100141

收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2012-01-11 发布日期:2012-01-11

Ontology structure characteristics analysis and matching application research

LIANG Shuai1，2, LUO Qiangyi2, HUANG Zhenhong1

1.Institute of Command Automation, PLA University of Science and Technology, Nanjing 210007, China
2.Institute of Electronic Equipment System Engineering Corporation, Beijing 100141, China

Received:1900-01-01 Revised:1900-01-01 Online:2012-01-11 Published:2012-01-11

摘要/Abstract

摘要： 针对本体匹配中结构蕴含的隐式语义信息难以正确表示和充分使用问题，提出将本体结构特征量化引入本体匹配。根据本体与复杂网络的相似性，分析本体具有的网络特征，提出了一系列基于结构和语义特征的理论和节点、边的量化标准，并将其用于核心节点的选取和边权重的度量。将本体匹配转换为基于元素个体特征和整体组织结构的有权标签图匹配问题，通过二次规划方法求取近似最优匹配。实验证明本体拓扑结构特征对本体匹配具有较大影响，其与核心节点匹配的紧密藕合能够显著提高匹配的准确性。

关键词: 复杂网络, 结构特征量化, 核心节点, 语义距离, 本体近似匹配, 组合优化

Abstract: In ontology matching it’s difficult for the implicit information contained in structure to be correctly represented and fully used. As for this problem, this article introduces the quantization of ontology structural characteristics into ontology matching. According to the similarity between ontology and complex network, the article analyzes the network characteristics of ontology and brings forward a series of theories based on structural and semantic characteristics as well as quantization criteria for nodes and edges. These theories and quantization criteria are applied to the selection of core nodes and measurement of edge weight. In this article, the problem of ontology matching is transformed into the matching of weighed label graphics, which are based on individual characteristics and organizational structure. The matching of approximately optimization is acquired through quadratic programming. Results of experiments have showed that the structural characteristics of ontology have great influence on ontology matching and the close coupled with the matching of core nodes will significantly improve the accuracy of matching.

Key words: complex networks, structure characteristics quantization, core node, semantic distance, approximate ontology matching, combinatorial optimization

梁帅1，2，罗强一2，黄镇鸿1. 本体结构特征分析与匹配应用研究[J]. 计算机工程与应用, 2012, 48(2): 43-47.

LIANG Shuai1，2, LUO Qiangyi2, HUANG Zhenhong1. Ontology structure characteristics analysis and matching application research[J]. Computer Engineering and Applications, 2012, 48(2): 43-47.

[1]	马满福，郭晨彪，李勇，张钟颖，张强，王常青. 基于结构熵的注意力流网络异构性研究[J]. 计算机工程与应用, 2021, 57(23): 98-105.
[2]	石宇强，田永政，张雨琦，石小秋. 运用含复杂网络结构的多种群遗传算法求解FJSP[J]. 计算机工程与应用, 2021, 57(2): 257-266.
[3]	李金海，何有世，张鹏. 融合情境语义推理及社会网络的团购推荐研究[J]. 计算机工程与应用, 2021, 57(18): 163-171.
[4]	陈展，公建宁，刘媛媛，徐京邦. 基于禁忌搜索的多AGV系统路径优化算法[J]. 计算机工程与应用, 2021, 57(10): 273-278.
[5]	王安，顾益军. 基于社区划分的节点重要性评估方法[J]. 计算机工程与应用, 2020, 56(8): 42-48.
[6]	陈杰，程胜，徐梦，史豪斌. 面向医疗辅助诊断的可视化多属性决策方法[J]. 计算机工程与应用, 2020, 56(8): 249-255.
[7]	赵亮，朱征宇. 融入K-核迭代因子的重叠社区发现算法[J]. 计算机工程与应用, 2020, 56(3): 61-67.
[8]	杜轻，辛守庭，雷新宇，于海涛. 基于脑网络和TSK模糊系统的癫痫脑电识别[J]. 计算机工程与应用, 2020, 56(2): 133-140.
[9]	蔡菲，张鑫，牟晓慧，陈杰，蔡珣. 深度非负矩阵分解的链路预测方法研究[J]. 计算机工程与应用, 2020, 56(15): 153-161.
[10]	易成岐，郭鑫，童楠楠，窦悦，陈东，王建冬. 基于启发式社团发现模型的创新态势研判算法[J]. 计算机工程与应用, 2020, 56(15): 74-79.
[11]	张昕，郭阳. 复杂网络中的一种介度熵抗毁性度量方法[J]. 计算机工程与应用, 2020, 56(12): 105-111.
[12]	盛津芳，刘家广，王斌. 基于Katz自动编码器的城市路网链路预测模型[J]. 计算机工程与应用, 2019, 55(8): 116-123.
[13]	姚蓉1，杨雄1，杨鹏飞1，阴桂梅1，2，李海芳1. 精分EEG脑网络同步稳定性研究[J]. 计算机工程与应用, 2019, 55(5): 60-64.
[14]	陈紫扬，张月霞. 结合二层节点度和聚类系数的链路预测算法[J]. 计算机工程与应用, 2019, 55(23): 40-44.
[15]	张昕，严沛，郭阳，王慧慧. 基于k-shell的复杂网络最短路径近似算法[J]. 计算机工程与应用, 2019, 55(14): 54-60.