生物医学本体匹配的进化禁忌搜索算法

Xingsi Xue, Aihong Ren, Dongxu Chen
{"title":"生物医学本体匹配的进化禁忌搜索算法","authors":"Xingsi Xue, Aihong Ren, Dongxu Chen","doi":"10.1109/CIS2018.2018.00049","DOIUrl":null,"url":null,"abstract":"Since these biomedical ontologies are mostly developed independently and many of them cover overlapping domains, establishing meaningful links between them, so-called biomedical ontology matching, is critical to ensure inter-operability and has the potential to unlock biomedical knowledge by bridging related data. Due to the complexity of the biomedical ontology matching problem (large-scale optimal problem with lots of local optimal solutions), Evolutionary Algorithm (EA) can present a good methodology for determining biomedical ontology alignments. However, the slow convergence and premature convergence are two main shortcomings of EA-based ontology matching techniques, which make them incapable of effectively searching the optimal solution for biomedical ontology matching problems. To overcome this drawback, in this paper, an Evolutionary Tabu Search Algorithm (ETSA) is proposed, which introduces the Tabu Search algorithm (TS) as a local search strategy into EA's evolving process. Moreover, to efficiently solve the biomedical ontology matching problem, an biomedical concept similarity measure is presented to calculate the similarity value of two biomedical concepts and an optimal model for biomedical ontology matching is constructed. The experiment is conducted on the Large Biomed track provided by the Ontology Alignment Evaluation Initiative (OAEI), and the comparisons with state-of-the-art ontology matchers show the effectiveness of ETSA.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Evolutionary Tabu Search Algorithm for Matching Biomedical Ontologies\",\"authors\":\"Xingsi Xue, Aihong Ren, Dongxu Chen\",\"doi\":\"10.1109/CIS2018.2018.00049\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Since these biomedical ontologies are mostly developed independently and many of them cover overlapping domains, establishing meaningful links between them, so-called biomedical ontology matching, is critical to ensure inter-operability and has the potential to unlock biomedical knowledge by bridging related data. Due to the complexity of the biomedical ontology matching problem (large-scale optimal problem with lots of local optimal solutions), Evolutionary Algorithm (EA) can present a good methodology for determining biomedical ontology alignments. However, the slow convergence and premature convergence are two main shortcomings of EA-based ontology matching techniques, which make them incapable of effectively searching the optimal solution for biomedical ontology matching problems. To overcome this drawback, in this paper, an Evolutionary Tabu Search Algorithm (ETSA) is proposed, which introduces the Tabu Search algorithm (TS) as a local search strategy into EA's evolving process. Moreover, to efficiently solve the biomedical ontology matching problem, an biomedical concept similarity measure is presented to calculate the similarity value of two biomedical concepts and an optimal model for biomedical ontology matching is constructed. The experiment is conducted on the Large Biomed track provided by the Ontology Alignment Evaluation Initiative (OAEI), and the comparisons with state-of-the-art ontology matchers show the effectiveness of ETSA.\",\"PeriodicalId\":185099,\"journal\":{\"name\":\"2018 14th International Conference on Computational Intelligence and Security (CIS)\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 14th International Conference on Computational Intelligence and Security (CIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIS2018.2018.00049\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 14th International Conference on Computational Intelligence and Security (CIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS2018.2018.00049","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

由于这些生物医学本体大多是独立开发的,其中许多涵盖了重叠的领域,因此在它们之间建立有意义的联系,即所谓的生物医学本体匹配,对于确保互操作性至关重要,并且有可能通过桥接相关数据来解锁生物医学知识。由于生物医学本体匹配问题(具有大量局部最优解的大规模最优问题)的复杂性,进化算法为确定生物医学本体对齐提供了一种很好的方法。然而,基于ea的本体匹配技术的两个主要缺点是收敛速度慢和过早收敛,无法有效地搜索生物医学本体匹配问题的最优解。为了克服这一缺点,本文提出了一种进化禁忌搜索算法(ETSA),该算法将禁忌搜索算法(TS)作为一种局部搜索策略引入EA的进化过程。此外,为了有效地解决生物医学本体匹配问题,提出了生物医学概念相似度度量来计算两个生物医学概念的相似度值,并构建了生物医学本体匹配的最优模型。在本体对齐评估计划(OAEI)提供的大型生物医学轨道上进行了实验,并与最先进的本体匹配器进行了比较,表明了ETSA的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Evolutionary Tabu Search Algorithm for Matching Biomedical Ontologies
Since these biomedical ontologies are mostly developed independently and many of them cover overlapping domains, establishing meaningful links between them, so-called biomedical ontology matching, is critical to ensure inter-operability and has the potential to unlock biomedical knowledge by bridging related data. Due to the complexity of the biomedical ontology matching problem (large-scale optimal problem with lots of local optimal solutions), Evolutionary Algorithm (EA) can present a good methodology for determining biomedical ontology alignments. However, the slow convergence and premature convergence are two main shortcomings of EA-based ontology matching techniques, which make them incapable of effectively searching the optimal solution for biomedical ontology matching problems. To overcome this drawback, in this paper, an Evolutionary Tabu Search Algorithm (ETSA) is proposed, which introduces the Tabu Search algorithm (TS) as a local search strategy into EA's evolving process. Moreover, to efficiently solve the biomedical ontology matching problem, an biomedical concept similarity measure is presented to calculate the similarity value of two biomedical concepts and an optimal model for biomedical ontology matching is constructed. The experiment is conducted on the Large Biomed track provided by the Ontology Alignment Evaluation Initiative (OAEI), and the comparisons with state-of-the-art ontology matchers show the effectiveness of ETSA.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Real-Time Location Privacy Protection Method Based on Space Transformation Cryptanalysis of Kumar's Remote User Authentication Scheme with Smart Card Off-Topic Text Detection Based on Neural Networks Combined with Text Features Research of X Ray Image Recognition Based on Neural Network CFO Algorithm Using Niche and Opposition-Based Learning
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1