Abstract
Effective communication between autonomous knowledge systems is dependent on the correct interpretation of exchanged messages, based on the entities (or vocabulary) within the messages, and their ontological definitions. However, as such systems cannot be assumed to share the same ontologies, a mechanism for autonomously determining a mutually acceptable alignment between the ontologies is required. Furthermore, the ontologies themselves may be confidential or commercially sensitive, and thus neither systems may be willing to expose their full ontologies to other parties (this may be pertinent as the transaction may only relate to part, and not all of the ontology). In this paper, we present a novel inquiry dialogue that allows such autonomous systems, or agents to assert, counter, accept and reject correspondences. It assumes that agents have acquired a variety of correspondences from past encounters, or from publicly available alignment systems, and that such knowledge is asymmetric and incomplete (i.e. not all agents may be aware of some correspondences, and their associated utility can vary greatly). By strategically selecting the order in which correspondences are disclosed, the two agents can jointly construct a bespoke alignment whilst minimising the disclosure of private knowledge. We show how partial alignments, garnered from different alignment systems, can be reused and aggregated through our dialectical approach, and illustrate how solutions to the Stable Marriage problem can be used to eliminate ambiguities (i.e. when an entity in one ontology is mapped to several other entities in another ontology). We empirically evaluate the performance of the resulting alignment compared to the use of randomly selected alignment systems, and show how by adopting a sceptical mentalistic attitude, an agent can further reduce the necessary disclosure of ontological knowledge.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Evfimievski, A., Srikant, R.: Information sharing across private databases. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, pp. 86–97. ACM (2003)
Bailin, S., Truszkowski, W.: Ontology negotiation: How agents can really get to know each other. In: Truszkowski, W., Hinchey, M., Rouff, C.A. (eds.) WRAC 2002. LNCS, vol. 2564, pp. 320–334. Springer, Heidelberg (2003)
Barnaghi, P., Sheth, A., Henson, C.: From data to actionable knowledge: Big data challenges in the web of things [guest editors’ introduction]. IEEE Intelligent Systems 28(6), 6–11 (2013)
Clifton, C.: Kantarcio lu, M., Doan, A., Schadow, G., Vaidya, J., Elmagarmid, A., Suciu, D.: Privacy-preserving data integration and sharing. In: Proceedings of the 9th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 19–26. ACM (2004)
Cruz, I.F., Tamassia, R., Yao, D.: Privacy-preserving schema matching using mutual information. In: Barker, S., Ahn, G.-J. (eds.) Data and Applications Security 2007. LNCS, vol. 4602, pp. 93–94. Springer, Heidelberg (2007)
Cuenca Grau, B., Horrocks, I., Kazakov, Y., Sattler, U.: Modular reuse of ontologies: Theory and practice. J. of Artificial Intelligence Research (JAIR) 31, 273–318 (2008)
van Diggelen, J., Beun, R.J., Dignum, F., van Eijk, R.M., Meyer, J.J.C.: Anemone: an effective minimal ontology negotiation environment. In: Proceedings of AAMAS 2006, pp. 899–906 (2006)
Doran, P., Tamma, V., Payne, T.R., Palmisano, I.: Dynamic selection of ontological alignments: a space reduction mechanism. In: Proceedings of IJCAI 2009, pp. 2028–2033 (2009)
Euzenat, J., Shvaiko, P.: Ontology Matching. Springer (2007)
Gale, D., Shapley, L.S.: College admissions and the stability of marriage. The American Mathematical Monthly 69(1), 9–15 (1962)
Grau, B.C., Dragisic, Z., Eckert, K., Euzenat, J., et al.: Results of the ontology alignment evaluation initiative 2013. In: Proc. 8th ISWC workshop on ontology matching (OM), pp. 61–100 (2013)
Inan, A., Kantarcioglu, M., Ghinita, G., Bertino, E.: Private record matching using differential privacy. In: Proceedings of the 13th International Conference on Extending Database Technology, pp. 123–134. ACM (2010)
Irving, R.W., Leather, P., Gusfield, D.: An efficient algorithm for the ‘optimal’ stable marriage. J. ACM 34(3), 532–543 (1987)
Iwama, K., Miyazaki, S.: A survey of the stable marriage problem and its variants. In: Proceedings of the International Conference on Informatics Education and Research for Knowledge-Circulating Society, ICKS 2008, pp. 131–136. IEEE Computer Society, Washington, DC (2008)
Laera, L., Blacoe, I., Tamma, V., Payne, T., Euzenat, J., Bench-Capon, T.: Argumentation over ontology correspondences in MAS. In: Proceedings of AAMAS, pp. 1285–1292 (2007)
McVitie, D., Wilson, L.: Stable marriage assignment for unequal sets. BIT Numerical Mathematics 10(3), 295–309 (1970)
Meilicke, C.: Alignment Incoherence in Ontology Matching. Ph.D. thesis, Dissertation, Universität Mannheim, Mannheim (2011)
Mitra, P., Liu, P., Pan, C.C.: Privacy-preserving ontology matching. In: AAAI Workshop on Context and Ontologies (2005)
Mitra, P., Pan, C.C., Liu, P., Atluri, V.: Privacy-preserving semantic interoperation and access control of heterogeneous databases. In: Proceedings of the 2006 ACM Symposium on Information, Computer and Communications Security, pp. 66–77. ACM (2006)
Payne, T.R., Tamma, V.: Negotiating over ontological correspondences with asymmetric and incomplete knowledge. In: Proceedings of AAMAS 2014, pp. 517–524 (2014)
Spiliopoulos, V., Vouros, G.A.: Synthesizing ontology alignment methods using the max-sum algorithm. IEEE TKDE 24(5), 940–951 (2012)
Trojahn dos Santos, C., Quaresma, P., Vieira, R.: Conjunctive queries for ontology based agent communication in MAS. In: Proceedings of AAMAS 2008, pp. 829–836 (2008)
Walton, D., Krabbe, E.: Commitment in Dialogue: Basic Concepts of Interpersonal Reasoning. SUNY series in Logic and Language, State University of New York Press (1995)
Zhang, N., Zhao, W.: Distributed privacy preserving information sharing. In: Proceedings of the 31st International Conference on VLDB, pp. 889–900. VLDB Endowment (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Payne, T.R., Tamma, V. (2014). A Dialectical Approach to Selectively Reusing Ontological Correspondences. In: Janowicz, K., Schlobach, S., Lambrix, P., Hyvönen, E. (eds) Knowledge Engineering and Knowledge Management. EKAW 2014. Lecture Notes in Computer Science(), vol 8876. Springer, Cham. https://doi.org/10.1007/978-3-319-13704-9_31
Download citation
DOI: https://doi.org/10.1007/978-3-319-13704-9_31
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13703-2
Online ISBN: 978-3-319-13704-9
eBook Packages: Computer ScienceComputer Science (R0)