IDEAS home Printed from https://ideas.repec.org/a/hin/jnddns/4716286.html
   My bibliography  Save this article

Optimizing Biomedical Ontology Alignment through a Compact Multiobjective Particle Swarm Optimization Algorithm Driven by Knee Solution

Author

Listed:
  • Xingsi Xue
  • Xiaojing Wu
  • Junfeng Chen

Abstract

Nowadays, most real-world decision problems consist of two or more incommensurable or conflicting objectives to be optimized simultaneously, so-called multiobjective optimization problems (MOPs). Usually, a decision maker (DM) prefers only a single optimum solution in the Pareto front (PF), and the PF’s knee solution is logically the one if there are no user-specific or problem-specific preferences. In this context, the biomedical ontology matching problem in the Semantic Web (SW) domain is investigated, which can be of help to integrate the biomedical knowledge and facilitate the translational discoveries. Since biomedical ontologies often own large-scale concepts with rich semantic meanings, it is difficult to find a perfect alignment that could meet all DM’s requirements, and usually, the matching process needs to trade-off two conflict objectives, i.e., the alignment’s recall and precision. To this end, in this work, the biomedical ontology matching problem is first defined as a MOP, and then a compact multiobjective particle swarm optimization algorithm driven by knee solution (CMPSO-K) is proposed to address it. In particular, a compact evolutionary mechanism is proposed to efficiently optimize the alignment’s quality, and a max-min approach is used to determine the PF’s knee solution. In the experiment, three biomedical tracks provided by Ontology Alignment Evaluation Initiative (OAEI) are used to test CMPSO-K’s performance. The comparisons with OAEI’s participants and PSO-based matching technique show that CMPSO-K is both effective and efficient.

Suggested Citation

  • Xingsi Xue & Xiaojing Wu & Junfeng Chen, 2020. "Optimizing Biomedical Ontology Alignment through a Compact Multiobjective Particle Swarm Optimization Algorithm Driven by Knee Solution," Discrete Dynamics in Nature and Society, Hindawi, vol. 2020, pages 1-10, May.
  • Handle: RePEc:hin:jnddns:4716286
    DOI: 10.1155/2020/4716286
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/DDNS/2020/4716286.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/DDNS/2020/4716286.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2020/4716286?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnddns:4716286. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.