Matching Biomedical Ontologies with Compact Evolutionary Algorithm

Literature Based Discovery (LBD) aims at building bridges between existing literatures and discovering new knowledge from them. Biomedical ontology is such a literature that provides an explicit specification on biomedical knowledge, i.e., the formal specification of the biomedical concepts and data, and the relationships between them. However, since biomedical ontologies are developed and maintained by different communities, the same biomedical information or knowledge could be defined with different terminologies or in different context, which makes the integration of them becomes a challenging problem. Biomedical ontology matching can determine the semantically identical biomedical concepts in different biomedical ontologies, which is regarded as an effective methodology to bridge the semantic gap between two biomedical ontologies. Currently, Evolutionary Algorithm (EA) is emerging as a good methodology for optimizing the ontology alignment. However, EA requires huge memory consumption and long runtime, which make EAbased matcher unable to efficiently match biomedical ontologies. To overcome these problems, in this paper, we define a discrete optimal model for biomedical ontology matching problem, and utilize a compact version of Evolutionary Algorithm (CEA) to solve it. In particular, CEA makes use of a Probability Vector (PV) to represent the population to save the memory consumption, and introduces a local search strategy to improve the algorithm's search performance. The experiment exploits Anatomy track, Large Biomed track and Disease and Phenotype track provided by the Ontology Alignment Evaluation Initiative (OAEI) to test our proposal's performance. The experimental results show that CEA-based approach can effectively reduce the runtime and memory consumption of EA-based matcher, and determine high-quality biomedical ontology alignments.