Please use this identifier to cite or link to this item: https://idr.l2.nitk.ac.in/jspui/handle/123456789/6887
Full metadata record
DC FieldValueLanguage
dc.contributor.authorShenoy, K.M.
dc.contributor.authorShet, K.C.
dc.contributor.authorAcharya, U.D.
dc.date.accessioned2020-03-30T09:46:19Z-
dc.date.available2020-03-30T09:46:19Z-
dc.date.issued2013
dc.identifier.citationAdvances in Intelligent Systems and Computing, 2013, Vol.177 AISC, VOL. 2, pp.11-18en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/6887-
dc.description.abstractToday'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. � 2013 Springer-Verlag.en_US
dc.titleSecured ontology matching using graph matchingen_US
dc.typeBook chapteren_US
Appears in Collections:2. Conference Papers

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.