Machine Learning Models: Combining Evidence of Similarity for XML Schema Matching
| Autor: | Dan Smith, Tran Hong-Minh |
|---|---|
| Rok vydání: | 2006 |
| Předmět: |
Matching (statistics)
computer.internet_protocol business.industry Computer science Similarity measure Machine learning computer.software_genre Similitude Knowledge extraction Similarity (network science) Schema (psychology) XML schema Data mining Artificial intelligence business Precision and recall computer XML computer.programming_language |
| Zdroj: | Lecture Notes in Computer Science ISBN: 9783540331803 KDXD |
| DOI: | 10.1007/11730262_7 |
| Popis: | 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). |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|