Shenoy, Manjula K and Shet, K C and Acharya, Dinesh U (2012) Secured Ontology Mapping Using Graph Matching. Advances in Intelligent Systems and Computing (177). pp. 11-18.

PDF article_4.pdf - Published Version Restricted to Registered users only Download (399kB) | Request a copy

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 satis-fiability. This is all the more true in case of collaboration and interoperability be-tween different organizations and thus between their information systems. Ontolo-gy 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 de-veloped 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 vari-ous 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.

Item Type:	Article
Uncontrolled Keywords:	Ontology mapping,ontologymatching,secured ontology etc.
Subjects:	Engineering > MIT Manipal > Computer Science and Engineering
Depositing User:	MIT Library
Date Deposited:	16 Mar 2013 08:03
Last Modified:	16 Mar 2013 08:03
URI:	http://eprints.manipal.edu/id/eprint/79117

Actions (login required)

View Item