Secured ontology matching using graph matching

K. Manjula Shenoy, K. C. Shet, U. Dinesh Acharya

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationAdvances in Computing and Information Technology - Proceedings of the Second International Conference on Advances in Computing and Information Technology, ACITY
PublisherSpringer Verlag
Pages11-18
Number of pages8
Volume177 AISC
EditionVOL. 2
ISBN (Print)9783642315510
DOIs
Publication statusPublished - 2013
Event2nd International Conference on Advances in Computing and Information Technology, ACITY 2012 - Chennai, India
Duration: 13-07-201215-07-2012

Publication series

NameAdvances in Intelligent Systems and Computing
NumberVOL. 2
Volume177 AISC
ISSN (Print)2194-5357

Conference

Conference2nd International Conference on Advances in Computing and Information Technology, ACITY 2012
CountryIndia
CityChennai
Period13-07-1215-07-12

Fingerprint

Ontology
Interoperability
Information systems
Industry
Experiments

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Computer Science(all)

Cite this

Shenoy, K. M., Shet, K. C., & Acharya, U. D. (2013). Secured ontology matching using graph matching. In Advances in Computing and Information Technology - Proceedings of the Second International Conference on Advances in Computing and Information Technology, ACITY (VOL. 2 ed., Vol. 177 AISC, pp. 11-18). (Advances in Intelligent Systems and Computing; Vol. 177 AISC, No. VOL. 2). Springer Verlag. https://doi.org/10.1007/978-3-642-31552-7_2
Shenoy, K. Manjula ; Shet, K. C. ; Acharya, U. Dinesh. / Secured ontology matching using graph matching. Advances in Computing and Information Technology - Proceedings of the Second International Conference on Advances in Computing and Information Technology, ACITY. Vol. 177 AISC VOL. 2. ed. Springer Verlag, 2013. pp. 11-18 (Advances in Intelligent Systems and Computing; VOL. 2).
@inproceedings{be4482cb7cd5458b9fb484ebe045f88e,
title = "Secured ontology matching using graph matching",
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.",
author = "Shenoy, {K. Manjula} and Shet, {K. C.} and Acharya, {U. Dinesh}",
year = "2013",
doi = "10.1007/978-3-642-31552-7_2",
language = "English",
isbn = "9783642315510",
volume = "177 AISC",
series = "Advances in Intelligent Systems and Computing",
publisher = "Springer Verlag",
number = "VOL. 2",
pages = "11--18",
booktitle = "Advances in Computing and Information Technology - Proceedings of the Second International Conference on Advances in Computing and Information Technology, ACITY",
address = "Germany",
edition = "VOL. 2",

}

Shenoy, KM, Shet, KC & Acharya, UD 2013, Secured ontology matching using graph matching. in Advances in Computing and Information Technology - Proceedings of the Second International Conference on Advances in Computing and Information Technology, ACITY. VOL. 2 edn, vol. 177 AISC, Advances in Intelligent Systems and Computing, no. VOL. 2, vol. 177 AISC, Springer Verlag, pp. 11-18, 2nd International Conference on Advances in Computing and Information Technology, ACITY 2012, Chennai, India, 13-07-12. https://doi.org/10.1007/978-3-642-31552-7_2

Secured ontology matching using graph matching. / Shenoy, K. Manjula; Shet, K. C.; Acharya, U. Dinesh.

Advances in Computing and Information Technology - Proceedings of the Second International Conference on Advances in Computing and Information Technology, ACITY. Vol. 177 AISC VOL. 2. ed. Springer Verlag, 2013. p. 11-18 (Advances in Intelligent Systems and Computing; Vol. 177 AISC, No. VOL. 2).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Secured ontology matching using graph matching

AU - Shenoy, K. Manjula

AU - Shet, K. C.

AU - Acharya, U. Dinesh

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84868326141&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84868326141&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-31552-7_2

DO - 10.1007/978-3-642-31552-7_2

M3 - Conference contribution

SN - 9783642315510

VL - 177 AISC

T3 - Advances in Intelligent Systems and Computing

SP - 11

EP - 18

BT - Advances in Computing and Information Technology - Proceedings of the Second International Conference on Advances in Computing and Information Technology, ACITY

PB - Springer Verlag

ER -

Shenoy KM, Shet KC, Acharya UD. Secured ontology matching using graph matching. In Advances in Computing and Information Technology - Proceedings of the Second International Conference on Advances in Computing and Information Technology, ACITY. VOL. 2 ed. Vol. 177 AISC. Springer Verlag. 2013. p. 11-18. (Advances in Intelligent Systems and Computing; VOL. 2). https://doi.org/10.1007/978-3-642-31552-7_2