Ontology Matching with Heterogeneous Graph Neural Network
Daoqu Geng, Shuai Zhang
Chongqing University of Posts and Telecommunications
阅读操作
确认中在文库中上传 PDF 后可生成中文音频讲解。
摘要与影响
Ontology matching supports data integration and interoperability by aligning semantically corresponding concepts, properties, and relations across ontologies. Many existing approaches rely primarily on node-level semantic information and underutilize contextual structural cues in the ontology graph, which can limit matching accuracy. To address this issue, we propose a relation-aware heterogeneous graph neural network framework. Our method first fine-tune BERT to obtain node representations, then extract relation representations, and construct a heterogeneous graph. Next,iteratively updating and fusing node and relation embeddings to strengthen their mutual interactions. Finally, computing a cross-ontology similarity matrix using cosine similarity between node embeddings and apply the Hungarian algorithm to derive an optimal one-to-one alignment. Evaluating the proposed method on three tasks from the OAEI Bio-ML dataset, and the results show that it achieves substantially higher F1 scores than existing methods on two of the tasks.
逐年被引趋势
暂无年度引用数据
关键指标
同类平均 = 1
同领域 · 同年份 · 同类型
Google Scholar 与 OpenAlex 的被引统计范围不同,数值存在差异属正常。
AI 辅助阅读
依据:摘要
可就本文提问;依据不足时会说明。
学术脉络
学科主题
计算机 / AIAdvanced Graph Neural Networks
Semantic Web and Ontologies · Graph Theory and Algorithms
参考文献 12
此处列出前 3 条