Abstract
Today’s market evolution and high volatility of business requirements put an increasing emphasis on the ability for systems to accommodate the changes required by new organizational needs while maintaining security objectives satisfiability. This is all the more true in case of collaboration and interoperability between different organizations and thus between their information systems. Ontology mapping has been used for interoperability and several mapping systems have evolved to support the same. Usual solutions do not take care of security. That is almost all systems do a mapping of ontologies which are unsecured. We have developed a system for mapping secured ontologies using graph similarity concept. Here we give no importance to the strings that describe ontology concepts, properties etc. Because these strings may be encrypted in the secured ontology. Instead we use the pure graphical structure to determine mapping between various concepts of given two secured ontologies. The paper also gives the measure of accuracy of experiment in a tabular form in terms of precision, recall and F-measure.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Clifton, C., Doan, A., Kantarcioglu, M., Schadow, G., Vaidya, J., Elma Garmid, A., Suciu, D.: Privacy preserving data integration and sharing. In: Proc. DMKD 2004 (2004)
Agrawal, R., Srikant, R.: Privacy preserving data mining. In: Proc. SIGMOD 2000 (2000)
Mitra, P., Liu, P., Pan, C.C.: Privacy preserving ontology matching. In: Proc. AAAI Workshop (2005)
Li, J.: LOM:Lexicon based ontology mapping tool. In: Proc. PerMIS 2004 (2004)
Noy, N.F., Musen, M.A.: Anchor-Prompt: Using non local context for semantic matching. In: Proc. IJCAI 2001 (2001)
Noy, N.F., Musen, M.A.: The Prompt Suite: Interactive tools for ontology mapping and merging. International Journal of Human Computer Studies 59(6) (2003)
Melnik, S., Molina, H.G., Rahm, E.: Similarity flooding a versatile graph matching algorithm and its application to schema matching. In: Proc. ICDE 2002 (2002)
Doan, A., Madhavan, J., Domingos, P., Halevy, A.: Learning to map be tween ontologies on the semantic web. In: Proc. WWW 2002 (2002)
Melnik, S., Molina, H.G., Rahm, E.: Similarity flooding a versatile graph matching algorithm. In: Proc. ICDE 2007 (2007)
Choi, N., Song, I.Y., Han, H.: A survey on ontology mapping. In: SIGMOD RECORD 2006 (2006)
Shvaiko, P., Euzenat, J.: Ten Challenges for ontology matching. In: Proc. ICODAS 2008 (2008)
Kalfoglou, Y., Schorelmmer, M.: Ontology mapping:The State of the Art. The Knowledge Engineering Review 18(1) (2003)
Ehrig, M., Staab, S.: QOM: Quick Ontology mapping. GI Jahrestagung (1) (2004)
Rahm, E., Bernstein, P.: A survey of approaches to automatic schema matching. The VLDB Journal 10(4) (2001)
Shvaiko, P., Euzenat, J.: A Survey of Schema-Based Matching Approaches. In: Spaccapietra, S. (ed.) Journal on Data Semantics IV. LNCS, vol. 3730, pp. 146–171. Springer, Heidelberg (2005)
Kleinberg, J.M.: Authoritive sources in a hyper linked environment. Journal of ACM (1999)
Van Dooren, B., et al.: A measure of similarity between graph vertices: Application to synonym extraction and we searching. SIAM Review (2004)
Ninove, L., et al.: Graph similarity algorithms. Seminar Presented at Department of Mathematical Engineering. University of Catholique de Louvain (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shenoy, K.M., Shet, K.C., Acharya, U.D. (2013). Secured Ontology Matching Using Graph Matching. In: Meghanathan, N., Nagamalai, D., Chaki, N. (eds) Advances in Computing and Information Technology. Advances in Intelligent Systems and Computing, vol 177. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31552-7_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-31552-7_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31551-0
Online ISBN: 978-3-642-31552-7
eBook Packages: EngineeringEngineering (R0)