Abstract
An efficient computation of ontology mappings requires optimized algorithms and significant computing resources especially for large life science ontologies. We describe how we optimized n-gram matching for computing the similarity of concept names and synonyms in our match system GOMMA. Furthermore, we outline how to enable a highly parallel string matching on Graphical Processing Units (GPU). The evaluation on the OAEI LargeBio match task demonstrates the high effectiveness of the proposed optimizations and that the use of GPUs in addition to standard processors enables significant performance improvements. © 2013 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Hartung, M., Kolb, L., Groß, A., & Rahm, E. (2013). Optimizing similarity computations for ontology matching - Experiences from GOMMA. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7970 LNBI, pp. 81–89). https://doi.org/10.1007/978-3-642-39437-9_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
