Abstract
Resources located in digital libraries are labeled (or classified) based on taxonomies. On multiple digital libraries, however, heterogeneity between taxonomies is a serious problem for efficient interoperation processes (e.g., information sharing and query transformation). In order to overcome this problem, we propose a novel framework based on aligning taxonomies of digital libraries. Thereby, the best mapping between concepts has to be discovered to maximize the summation of a set of partial similarities. For experimentation, three digital libraries were built based on different taxonomies. Taxonomy alignment-based resource retrieval was evaluated by human experts, and we measured recall and precision measures retrieved by concept replacement strategy.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Qiu, Y., Frei, H.P.: Concept based query expansion. In: Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval (SIGIR 1993), pp. 160–169. ACM Press, New York (1993)
Menczer, F.: Lexical and semantic clustering by web links. Journal of the American Society for Information Science and Technology 55(14), 1261–1269 (2004)
Jung, J.J.: Collaborative web browsing based on semantic extraction of user interests with bookmarks. Journal of Universal Computer Science 11(2), 213–228 (2005)
Euzenat, J., Valtchev, P.: Similarity-based ontology alignment in OWL-Lite. In: de Mántaras, R.L., Saitta, L. (eds.) Proc. of the 16th European Conference on Artificial Intelligence (ECAI 2004), Valencia, Spain, August 22-27, 2004, pp. 333–337. IOS Press, Amsterdam (2004)
Levenshtein, I.: Binary codes capable of correcting deletions, insertions, and reversals. Cybernetics and Control Theory 10(8), 707–710 (1996)
Euzenat, J.: An API for ontology alignment. In: McIlraith, S.A., Plexousakis, D., van Harmelen, F. (eds.) ISWC 2004. LNCS, vol. 3298, pp. 698–712. Springer, Heidelberg (2004)
Welty, C.A., Guarino, N.: Supporting ontological analysis of taxonomic relationships. Data & Knowledge Engineering 39(1), 51–74 (2001)
Melnik, S., Garcia-Molina, H., Rahm, E.: Similarity flooding: A versatile graph matching algorithm and its application to schema matching. In: Proceedings of the 18th International Conference on Data Engineering (ICDE), pp. 117–128. IEEE Computer Society Press, Los Alamitos (2002)
Cui, H., Wen, J.R., Nie, J.Y., Ma, W.Y.: Probabilistic query expansion using query logs. In: Proceedings of the 11th international conference on World Wide Web, pp. 325–332. ACM Press, New York (2002)
Nie, J.Y.: Query expansion and query translation as logical inference. Journal of the American Society for Information Science and Technology 54(4), 335–346 (2003)
Liu, Z., Chu, W.W.: Knowledge-based query expansion to support scenario-specific retrieval of medical free text. In: Proceedings of the 2005 ACM symposium on Applied computing (SAC 2005), pp. 1076–1083. ACM Press, New York (2005)
Zazo, Á.F., Figuerola, C.G., Berrocal, J.L.A., Rodríguez, E.: Reformulation of queries using similarity thesauri. Information Processing and Management: an International Journal 41(5), 1163–1173 (2005)
Avesani, P., Giunchiglia, F., Yatskevich, M.: A large scale taxonomy mapping evaluation. In: Gil, Y., Motta, E., Benjamins, V.R., Musen, M.A. (eds.) ISWC 2005. LNCS, vol. 3729, pp. 67–81. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jung, J.J. (2006). Taxonomy Alignment for Interoperability Between Heterogeneous Digital Libraries. In: Sugimoto, S., Hunter, J., Rauber, A., Morishima, A. (eds) Digital Libraries: Achievements, Challenges and Opportunities. ICADL 2006. Lecture Notes in Computer Science, vol 4312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11931584_30
Download citation
DOI: https://doi.org/10.1007/11931584_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49375-4
Online ISBN: 978-3-540-49377-8
eBook Packages: Computer ScienceComputer Science (R0)