.png){kind=icon}
返回
Matching Knowledge Graphs with Compact Niching Evolutionary Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2022.117371.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
To address the Knowledge Graph (KG) heterogeneity issue, we need to determine a set of entity correspondences, which requires aggregating several complementary similarity measures to improve the confidence of the results. How to determine the suitable aggregating weights for the similarity measures to improve the KG alignment's quality is called the KG meta-matching problem, whose challenge of scalability remains significant in the Semantic Web (SW) domain. To face this challenge, this work proposes a Compact Niching Evolutionary Algorithm (CNEA) based matching technique. We first propose an approximate evaluation metric on the alignment's quality, and on this basis, a multi-modal optimization model is constructed to formally define the KG meta-matching problem. Then, a niching strategy is combined with EA's evolutionary paradigm to address it, which is able to effectively locate and maintain multiple global optimal solutions. Moreover, a serial matching framework and the compact evolutionary mechanism are presented to improve CNEA's efficiency. In particular, the former reduces the algorithm's search space of the instance matching phase with schema level alignments, and the latter uses the probability representation on the population to reduce the algorithm's memory consumption and run time. The experiment utilizes Ontology Alignment Evaluation Initiative (OAEI)'s KG track to test our proposal's performance, and experimental results show that CNEA-based KG matching technique is both effective and efficient.
Keyword:
Knowledge Graph matching
Compact Niching Evolutionary Algorithm
Compact evolutionary mechanism
Niching strategy
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
分享收藏Matching large-scale biomedical ontologies with central concept based partitioning algorithm and Adaptive Compact Evolutionary Algorithm基于中心概念划分算法和自适应紧凑进化算法的大规模生物医学本体匹配
PREAI
分享收藏
分享收藏The Use of Ranks to Avoid the Assumption of Normality Implicit in the Analysis of Variance使用秩来避免方差分析中隐含的正态性假设
PREAI
分享收藏Solving Ontology Meta-Matching Problem Through an Evolutionary Algorithm With Approximate Evaluation Indicators and Adaptive Selection Pressure.png)
IEEE ACCESS
OAAI
IEEE ACCESSIF3.6
OAAI分享收藏
查看更多内容