Abstract
One of the main challenges in integrating two hierarchies (e.g., of books or web pages) is determining the correspondence between the edges of each hierarchy. Traditionally, this process, which we call hierarchy matching, is done by comparing the text associated with each edge. In this paper we instead use the placement of objects present in both hierarchies to infer how the hierarchies relate. We present two algorithms that, given a hierarchy with known facets (attribute-value pairs that define what objects are placed under an edge), determine feasible facets for a second hierarchy, based on shared objects. One algorithm is rule-based and the other is statistics-based. In the experimental section, we compare the results of the two algorithms, and see how their performances vary based on the amount of noise in the hierarchies.
A 2-page poster was presented at ICDE08. The poster introduced the problem we address here but did not present the algorithms nor any results.
This is a preview of subscription content, log in via an institution to check access.
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., Srikant, R.: On integrating catalogs. In: Proc. of the Tenth Int’l World Wide Web Conference, pp. 603–612 (2001)
Amazon.com, http://www.amazon.com
Doan, A., Madhavan, J., Domingos, P., Halevy, A.: Learning to map between ontologies on the semantic web. In: The Eleventh International WWW Conference, pp. 662–673 (2002)
Flamenco system, http://flamenco.berkeley.edu/index.html
Giunchiglia, F., Shvaiko, P., Yatskevich, M.: Semantic Schema Matching. In: Proceedings of CoopIS (2005)
Haas, L.M., Hernandez, M.A., Ho, H., Popa, L., Roth, M.: Clio grows up: From research prototype to industrial tool. In: Proceedings of the 24th ACM SIGMOD, pp. 805–810 (2005)
Ichise, R., Takeda, H., Honiden, S.: Rule induction for concept hierarchy alignment. In: Proceedings of the IJCAI 2001 Workshop on Ontology Learning (2001)
Kalfoglou, Y., Schorlemmer, M.: Ontology mapping: the state of the art. Knowledge Engineering Review 18(1), 1–31 (2003)
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 ICDE (2002)
Sarawagi, S., Chakrabarti, S., Godbole, S.: Cross-training: Learning probabilistic mappings between topics. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) (2003)
Ikeda, R., Zhao, K., Garcia-Molina, H.: Matching hierarchies using shared objects. Technical report, Stanford University (2008), http://dbpubs.stanford.edu/pub/2008-4
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ikeda, R., Zhao, K., Garcia-Molina, H. (2008). Matching Hierarchies Using Shared Objects. In: Christensen-Dalsgaard, B., Castelli, D., Ammitzbøll Jurik, B., Lippincott, J. (eds) Research and Advanced Technology for Digital Libraries. ECDL 2008. Lecture Notes in Computer Science, vol 5173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87599-4_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-87599-4_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87598-7
Online ISBN: 978-3-540-87599-4
eBook Packages: Computer ScienceComputer Science (R0)