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

  • Tran Hong-Minh
  • Dan Smith
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3915)


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).


Learning Category Schema Match Machine Learning Model Composite Approach Approximate String Match 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bartell, B.T., Cottrell, G.W., Belew, R.K.: Automatic combination of multiple ranked retrieval systems. In: 17th annual international ACM SIGIR conference on Research and development in information retrieval, pp. 173–181 (1994)Google Scholar
  2. 2.
    Bernstein, P.A., Madhavan, J., Rahm, E.: Generic schema matching with cupid. In: 27th VLDB, vol. 10, pp. 49–58 (2001)Google Scholar
  3. 3.
    Do, H.-H., Rahm, E.: Coma - a system for flexible combination of schema matching approaches. In: VLDB, pp. 610–621 (2002)Google Scholar
  4. 4.
    Doan, A., Domingos, P., Levy, A.Y.: Learning source description for data integration. In: WebDB, pp. 81–86 (2000)Google Scholar
  5. 5.
    Fellbaum, C. (ed.): WordNet: An Electronic Lexical Database. MIT, Cambridge (1998)MATHGoogle Scholar
  6. 6.
    Hall, P.A.V., Dowling, G.R.: Approximate string matching. ACM Comput. Surv. 12(4), 381–402 (1980)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Lee, J.H.: Analyses of multiple evidence combination. In: 20th annual international ACM SIGIR conference on Research and development in information retrieval, pp. 267–276 (1997)Google Scholar
  8. 8.
    Lee, M.L., Yang, L.H., Hsu, W.: Xml schemas: integration and translation: Xclust: clustering xml schemas for effective integration. In: CIKM, pp. 292–299 (2002)Google Scholar
  9. 9.
    McCabe, M.C., Chowdhury, A., Grossman, D., Frieder, O.: System fusion for improving performance in information retrieval systems. In: International Conference on Information Technology: Coding and Computing (ITCC 2001), pp. 639–644 (2001)Google Scholar
  10. 10.
    Rahm, E., Bernstein, P.A.: A survey of approaches to automatic schema matching. The VLDB Journal 10(4), 334–350 (2001)CrossRefMATHGoogle Scholar
  11. 11.
    Seco, N., Veale, T., Hayes, J.: An intrinsic information content metric for semantic similarity in wordnet. In: ECAI, pp. 1089–1090 (2004)Google Scholar
  12. 12.
    Vogt, C.C., Cottrell, G.W.: Predicting the performance of linearly combined ir systems. In: 21st annual international ACM SIGIR conference on Research and development in information retrieval, pp. 190–196 (1998)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Tran Hong-Minh
    • 1
  • Dan Smith
    • 1
  1. 1.School of Computing SciencesUniversity of Of East AngliaNorwichUK

Personalised recommendations