Abstract
Semantic coordination, namely the problem of finding an agreement on the meaning of heterogeneous semantic models, is one of the key issues in the development of the Semantic Web. In this paper, we propose a new algorithm for discovering semantic mappings across hierarchical classifications based on a new approach to semantic coordination. This approach shifts the problem of semantic coordination from the problem of computing linguistic or structural similarities (what most other proposed approaches do) to the problem of deducing relations between sets of logical formulae that represent the meaning of concepts belonging to different models. We show how to apply the approach and the algorithm to an interesting family of semantic models, namely hierarchical classifications, and present the results of preliminary tests on two types of hierarchical classifications, web directories and catalogs. Finally, we argue why this is a significant improvement on previous approaches.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Avesani, P.: Evaluation framework for local ontologies interoperability. In: MeaN 2002 – AAAI workshop on Meaning Negotiation, Edmonton, Alberta, Canada (2002)
Bergamaschi, S., Castano, S., Vincini, M.: Semantic integration of semistructured and structured data sources. SIGMOD Record 28(1), 54–59 (1999)
Bonifacio, M., Bouquet, P., Mameli, G., Nori, M.: Kex: a peer-to-peer solution for distributed knowledge management. In: Karagiannis, D., Reimer, U. (eds.) PAKM 2002. LNCS (LNAI), vol. 2569, pp. 490–500. Springer, Heidelberg (2002)
Bonifacio, M., Bouquet, P., Traverso, P.: Enabling distributed knowledge management. managerial and technological implications. Novatica and Informatik/Informatique III(1) (2002)
Borgida, A., Serafini, L.: Distributed description logics: Directed domain correspondences in federated information sources. In: Meersman, R., Tari, Z. (eds.) CoopIS 2002, DOA 2002, and ODBASE 2002. LNCS, vol. 2519, pp. 36–53. Springer, Heidelberg (2002)
Bouquet, P. (ed.): AAAI 2002 Workshop on Meaning Negotiation, Edmonton, Canada, July 2002. American Association for Artificial Intelligence (AAAI). AAAI Press, Menlo Park (2002)
Bowker, G.C., Star, S.L.: Sorting things out: classification and its consequences. MIT Press, Cambridge (1999)
Büchner, A., Ranta, M., Hughes, J., Mäntylä, M.: Semantic information mediation among multiple product ontologies. In: Proc. 4th World Conference on Integrated Design & Process Technology (1999)
Busetta, P., Bouquet, P., Adami, G., Bonifacio, M., Palmieri, F.: K-Trek: An approach to context awareness in large environments. Technical report, Istituto per la Ricerca Scientifica e Tecnologica (ITC-IRST), Trento (Italy) (April 2003)(submitted to UbiComp 2003)
Day, D.S., Vilain, M.B.: Phrase parsing with rule sequence processors: an application to the shared CoNLL task. In: Proc. of CoNLL 2000 and LLL 2000, Lisbon, Portugal (September 2000)
Doan, A., Madhavan, J., Domingos, P., Halevy, A.: Learning to map between ontologies on the semantic web. In: Proceedings of WWW 2002, 11th International WWW Conference, Hawaii (2002)
Fellbaum, C. (ed.): WordNet: An Electronic Lexical Database. The MIT Press, Cambridge (1998)
Ghidini, C., Giunchiglia, F.: Local Models Semantics, or Contextual Reasoning = Locality + Compatibility. Artificial Intelligence 127(2), 221–259 (2001)
Hewlett-Packard, J.C.: Matching rdf graphs. In: Horrocks, I., Hendler, J. (eds.) ISWC 2002. LNCS, vol. 2342, pp. 5–15. Springer, Heidelberg (2002)
Lakoff, G.: Women, Fire, and Dangerous Things. Chicago Unversity Press, Chicago (1987)
Madhavan, J., Bernstein, P.A., Rahm, E.: Generic schema matching with cupid. The VLDB Journal, 49–58 (2001)
Magnini, B.M., Serafini, L., Doná, A., Gatti, L., Girardi, C., Speranza, M.: Large–scale evaluation of context matching. Technical Report 0301–07, ITC–IRST, Trento, Italy (2003)
Milo, T., Zohar, S.: Using schema matching to simplify heterogeneous data translation. In: Proc. 24th Int. Conf. Very Large Data Bases, VLDB, pp. 122–133, 24–27 (1998)
Pelillo, M., Siddiqi, K., Zucker, S.W.: Matching hierarchical structures using association graphs. In: Burkhardt, H., Neumann, B. (eds.) ECCV 1998. LNCS, vol. 1407, pp. 3–16. Springer, Heidelberg (1998)
Wang, J.T.-L., Zhang, K., Jeong, K., Shasha, D.: A system for approximate tree matching. Knowledge and Data Engineering 6(4), 559–571 (1994)
Zhang, K., Wang, J.T.L., Shasha, D.: On the editing distance between undirected acyclic graphs and related problems. In: Galil, Z., Ukkonen, E. (eds.) CPM 1995. LNCS, vol. 937, pp. 395–407. Springer, Heidelberg (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bouquet, P., Serafini, L., Zanobini, S. (2003). Semantic Coordination: A New Approach and an Application. In: Fensel, D., Sycara, K., Mylopoulos, J. (eds) The Semantic Web - ISWC 2003. ISWC 2003. Lecture Notes in Computer Science, vol 2870. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39718-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-39718-2_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20362-9
Online ISBN: 978-3-540-39718-2
eBook Packages: Springer Book Archive