4.5 Article

A compact firefly algorithm for matching biomedical ontologies

期刊

KNOWLEDGE AND INFORMATION SYSTEMS
卷 62, 期 7, 页码 2855-2871

出版社

SPRINGER LONDON LTD
DOI: 10.1007/s10115-020-01443-6

关键词

Biomedical ontology matching; Compact firefly algorithm; Compact movement operator

资金

  1. National Natural Science Foundation of China [61503082]
  2. Natural Science Foundation of Fujian Province [2016J05145]
  3. Program for New Century Excellent Talents in Fujian Province University [GY-Z18155]
  4. Program for Outstanding Young Scientific Researcher in Fujian Province University [GY-Z160149]
  5. Scientific Research Foundation of Fujian University of Technology [GY-Z17162, GY-Z15007]

向作者/读者索取更多资源

Biomedical ontologies have gained particular relevance in the life science domain due to its prominent role in representing knowledge in this domain. However, the existing biomedical ontologies could define the same biomedical concept in different ways, which yields the biomedical ontology heterogeneous problem. To implement the inter-operability among the biomedical ontologies, it is critical to establish the semantic links between heterogenous biomedical concepts, so-called biomedical ontology matching. Since modeling the ontology matching problem is a complex and time-consuming task, swarm intelligent algorithm (SIA) becomes a state-of-the-art methodology for solving this problem. However, when addressing the biomedical ontology matching problem, the existing SIA-based matchers tend to be inefficient due to biomedical ontology's large-scale concepts and complex semantic relationships. In this work, we propose a compact firefly algorithm (CFA), where the explicit representation of the population is replaced by a probability distribution and two compact movement operators are presented to save the memory consumption and runtime of the population-based SIAs. We exploit the anatomy track, disease and phenotype track and biodiversity and ecology track from the ontology alignment evaluation initiative (OAEI) to test CFA-based matcher's performance. The experimental results show that CFA can improve the FA-based matcher's memory consumption and runtime by, respectively, 68.92% and 38.97% on average, and its results significantly outperform other SIA-based matchers and OAEI's participants.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据