INCREMENTAL MAINTENANCE OF ONTOLOGIES BASED ON BIPARTITE GRAPH MATCHING

Preetpal Singh, Kalpdrum Passi

Abstract

Today’s Information Society demands complete access to available information, which is often heterogeneous and distributed. A key challenge in building the Semantic Web is integrating heterogeneous data sources. This paper presents an incremental algorithm for maintaining integration in evolving ontologies. For example, an increased number of smaller, task oriented ontologies, are emerging across the Bioinformatics domain to represent domain knowledge; integrating these heterogeneous ontologies is crucial for applications utilizing multiple ontologies. Most ontologies share a core of common knowledge allowing them to communicate, but no single ontology contains complete domain knowledge. Recent papers examined integrating ontologies using bipartite graph matching techniques. However, they do not address the issue of incrementally maintaining the matching in evolving ontologies. In this paper we present an incremental algorithm, OntoMaintain, which incrementally calculates the perfect matching among evolving ontologies and simultaneously updates the labels of the concepts of ontologies. We show that our algorithm has a complexity of O(n2) compared to complexity O(n3) of traditional matching algorithms. Experimental results prove that our algorithm maintains the correctness of a ‘brute force method’ while significantly reducing the time needed to find a perfect matching in evolving ontologies.

References

  1. Bellur, U., Kulkarni, R., 2007. Improved Matchmaking Algorithm for Semantic Web Services Based on Bipartite Graph Matching In IEEE International Conference on Web Services (ICWS 2007), July 9-13, 2007, Salt Lake City, Utah, USA, pp. 86-93.
  2. Doan, A., Madhavan, J., Domingos, P., Halevy, A., 2002. Learning to Map between Ontologies on the Semantic Web In Proceedings of the Eleventh International World Wide Web Conference, WWW2002, Honolulu, Hawaii, USA, 7-11 May 2002. ACM, 2002, pp.662- 673.
  3. Gene Ontology (GO). http://www.geneontology.org/ Gruber, T.R., 1993. A Translation Approach to Portable Ontology Specification. Knowledge Acquisition, 5(2), 1993, 199-220.
  4. Kuhn, H., 1955. The Hungarian method for the assignment problem. Naval Research Logistic Quarterly.
  5. Melnik, S., Garcia-Molina, H., Rahm, E., 2002. Similarity Flooding: A Versatile Graph Matching Algorithm and its Application to Schema Matching, Proceedings of the 18th International Conference on Data Engineering, 26 February-1 March 2002, San Jose, CA. IEEE Computer Society 2002, 117-128.
  6. Mowbray, T.J., Zahavi, R., 1995. The Essential CORBA: Sytems Integration Using Distributed Objects. New York: Wiley.
  7. Paolucci, M., Kawamura, T., Payne, T.R., Sycara, K., 2002. Semantic Matching of Web Services Capabilities, ISWC 2002, LNCS 2342, pp. 333-347, Springer Verlag Berlin Heidelberg.
  8. Pinto, H.S., Martins, J.P., 2000. Reusing Ontologies. In Proc. of AAAI2000 Spring Symposium Series, Workshop on Bringing Knowledge to Business Processes, AAAI Press, pp. 77-84.
  9. Reichhardt, T., 1999. It's sink or swim as a tidal wave of data approaches. Nature 399 (6736): 517-20.
  10. Song, G., Qian, Y., Liu, Y., Zhang, K., 2006. OASIS: a Mapping and Integration Framework for Biomedical Ontologies, Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (CBMS 2006), 22-23 June 2006, Salt Lake City, Utah, USA, pp. 611- 616.
Download


Paper Citation


in Harvard Style

Singh P. and Passi K. (2009). INCREMENTAL MAINTENANCE OF ONTOLOGIES BASED ON BIPARTITE GRAPH MATCHING . In Proceedings of the Fifth International Conference on Web Information Systems and Technologies - Volume 1: WEBIST, ISBN 978-989-8111-81-4, pages 444-449. DOI: 10.5220/0001843904440449


in Bibtex Style

@conference{webist09,
author={Preetpal Singh and Kalpdrum Passi},
title={INCREMENTAL MAINTENANCE OF ONTOLOGIES BASED ON BIPARTITE GRAPH MATCHING},
booktitle={Proceedings of the Fifth International Conference on Web Information Systems and Technologies - Volume 1: WEBIST,},
year={2009},
pages={444-449},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001843904440449},
isbn={978-989-8111-81-4},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Fifth International Conference on Web Information Systems and Technologies - Volume 1: WEBIST,
TI - INCREMENTAL MAINTENANCE OF ONTOLOGIES BASED ON BIPARTITE GRAPH MATCHING
SN - 978-989-8111-81-4
AU - Singh P.
AU - Passi K.
PY - 2009
SP - 444
EP - 449
DO - 10.5220/0001843904440449