Ikeda, Robert and Zhao, Kai and Garcia-Molina, Hector (2008) Matching Hierarchies Using Shared Objects. Technical Report. Stanford InfoLab.
One of the main challenges in integrating two hierarchies 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 (label-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.
|Item Type:||Techreport (Technical Report)|
|Related URLs:||Project Homepage||http://infolab.stanford.edu/serf/|
|Deposited By:||Import Account|
|Deposited On:||06 Mar 2008 16:00|
|Last Modified:||10 Dec 2008 15:54|
Repository Staff Only: item control page