Learning to match heterogeneous structures using partially labeled data

Saravadee Sae Tan, Tek Yong Lim, Lay Ki Soon, Enya Kong Tang

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review


This paper addresses the problem of matching between highly heterogeneous structures. The problem is modeled as a clas-sification task where training examples are used to learn the matching between structures. In our approach, train-ing is performed using partially labeled data. We propose a Greedy Mapping approach to generate training examples from partially labeled data. Diferent types of structures may have diferent types of attributes that can be exploited to enhance the matching problem. We utilize three types of attributes, namely, text content, structure name and path correspondence, in the matching problem. Experiments are performed on two types of structures: semantic domain and semantic role. We evaluate the effectiveness of the Greedy Mapping as well as the performance on diferent types of attributes. Finally, the results are presented and discussed.

Original languageEnglish
Title of host publicationWeb-KR '14: Proceedings of the 5th International Workshop on Web-scale Knowledge Representation Retrieval & Reasoning
Number of pages4
Publication statusPublished - 3 Nov 2014
Externally publishedYes
EventInternational Workshop on Web-scale Knowledge Representation Retrieval and Reasoning 2014 - Shanghai, China
Duration: 3 Nov 20143 Nov 2014
Conference number: 5th
https://dl.acm.org/doi/proceedings/10.1145/2663792 (Proceedings)


ConferenceInternational Workshop on Web-scale Knowledge Representation Retrieval and Reasoning 2014
Abbreviated titleWeb-KR 2014
Internet address


  • Heterogeneous structure
  • Structure matching

Cite this