Partitioning and local matching learning of large biomedical ontologies

A Laadhar, F Ghozzi, I Megdiche, F Ravat… - Proceedings of the 34th …, 2019 - dl.acm.org
Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing, 2019dl.acm.org
Conventional ontology matching systems are not well-tailored to ensure sufficient quality
alignments for large ontology matching tasks. In this paper, we propose a local matching
learning strategy to align large and complex biomedical ontologies. We define a novel
partitioning approach that breakups large ontology alignment task into a set of local sub-
matching tasks. We perform a machine learning approach for each local sub-matching task.
We build a local machine learning model for each sub-matching task without any user …
Conventional ontology matching systems are not well-tailored to ensure sufficient quality alignments for large ontology matching tasks. In this paper, we propose a local matching learning strategy to align large and complex biomedical ontologies. We define a novel partitioning approach that breakups large ontology alignment task into a set of local sub-matching tasks. We perform a machine learning approach for each local sub-matching task. We build a local machine learning model for each sub-matching task without any user involvement. Each local matching learning model automatically provides adequate matching settings for each local sub-matching task. Our results show that: (i) partitioning approach outperforms existing techniques, (ii) local matching while using a specific machine learning model for each sub-matching task yields to promising results and (iii) the combination between partitioning and machine learning increases the overall result.
ACM Digital Library
以上显示的是最相近的搜索结果。 查看全部搜索结果