Machine Learning Models: Combining Evidence of Similarity for XML Schema Matching

Hong-Minh, Tran and Smith, Dan J. (2006) Machine Learning Models: Combining Evidence of Similarity for XML Schema Matching. In: Knowledge Discovery from XML Documents. Lecture Notes in Computer Science, 3915 . Springer Berlin / Heidelberg, pp. 43-53.

Full text not available from this repository. (Request a copy)

Abstract

Matching schemas at an element level or structural level is generally categorized as either hybrid, which uses one algorithm, or composite, which combines evidence from several different matching algorithms for the final similarity measure. We present an approach for combining element-level evidence of similarity for matching XML schemas with a composite approach. By combining high recall algorithms in a composite system we reduce the number of real matches missed. By performing experiments on a number of machine learning models for combination of evidence in a composite approach and choosing the SMO for the high precision and recall, we increase the reliability of the final matching results. The precision is therefore enhanced (e.g., with data sets used by Cupid and suggested by the author of LSD, our precision is respectively 13.05% and 31.55% higher than COMA and Cupid on average).

Item Type: Book Section
Faculty \ School: Faculty of Science > School of Computing Sciences
Related URLs:
Depositing User: Vishal Gautam
Date Deposited: 14 Jun 2011 11:09
Last Modified: 25 Jul 2019 03:13
URI: https://ueaeprints.uea.ac.uk/id/eprint/23108
DOI: 10.1007/11730262_7

Actions (login required)

View Item View Item