Main Article Content


In domains such as biomedicine, ontologies are prominently utilized for annotating data. Consequently, aligning ontologies facilitates integrating data. Several algorithms exist for automatically aligning ontologies with diverse levels of performance. As alignment applications evolve and exhibit online run time constraints, performing the alignment in a reasonable amount of time without compromising the quality of the alignment is a crucial challenge. A large class of alignment algorithms is iterative and often consumes more time than others in delivering solutions of high quality. We present a novel and general approach for speeding up the multivariable optimization process utilized by these algorithms. Specifically, we use the technique of block-coordinate descent (BCD), which exploits the subdimensions of the alignment problem identified using a partitioning scheme. We integrate this approach into multiple well-known alignment algorithms and show that the enhanced algorithms generate similar or improved alignments in significantly less time on a comprehensive testbed of ontology pairs. Because BCD does not overly constrain how we partition or order the parts, we vary the partitioning and ordering schemes in order to empirically determine the best schemes for each of the selected algorithms. As biomedicine represents a key application domain for ontologies, we introduce a comprehensive biomedical ontology testbed for the community in order to evaluate alignment algorithms. Because biomedical ontologies tend to be large, default iterative techniques find it difficult to produce a good quality alignment within a reasonable amount of time. We align a significant number of ontology pairs from this testbed using BCD-enhanced algorithms. Our contributions represent an important step toward making a significant class of alignment techniques computationally feasible.


Speeding Iterative Ontology Block-Coordinate Descent

Article Details

How to Cite
Thayasivam, U. (2022). Speeding Up Iterative Ontology Alignment using Block-Coordinate Descent. Journal of Engineering Applied Science and Humanities, 7(1), 37–49.


  1. Ashburner, M., Ball, C. A., Blake, J. A., Botstein, D., Butler, H., Cherry, J. M., Davis, A. P., Dolin-ski, K., Dwight, S. S., Eppig, J. T., Harris, M. A., Hill, D. P., Issel-Tarver,L., Kasarskis,A., Lewis, S., Matese, J. C., Richardson, J. E., Ringwald, M., Rubin, G. M.,& Sherlock, G.(2000). Gene ontology: tool for the unification of biology. the gene ontology consortium..Nature genetics,25(1), 25–29
  2. Baader, F., Horrocks, I., & Sattler, U. (2003). Description logics as ontology languages for thesemantic web. InLecture Notes in Artificial Intelligence, pp. 228–248. Springer-Verlag
  3. Belleau, F., Nolin, M.-A., Tourigny, N., Rigault, P., & Morissette, J. (2008).(bio2rdf): Towardsa mashup to build bioinformatics knowledge systems.Journal of Biomedical Informatics,41(5), 706–716.
  4. Cruz, I. F., Stroe, C., & Palmonari, M. (2012). Interactive user feedback in ontology matchingusing signature vectors. InIEEE 28th International Conference on Data Engineering, pp.1321–1324. IEEE Computer Society
  5. Doshi, P., Kolli, R., & Thomas, C. (2009). Inexact matching of ontology graphs using expectation-maximization.Web Semantics: Science, Services and Agents on the World Wide Web,7(2),90–106.
  6. Hayes, J., & Gutierrez, C. (2004). Bipartite graphs as intermediate model for RDF. InProceed-ings of the 3rd International Semantic Web Conference (ISWC), Lecture Notes in ComputerScience, pp. 47–61. Springer Berlin / Heidelberg.