2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW) (2006)
Apr. 3, 2006 to Apr. 7, 2006
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDEW.2006.51
Marko Smiljanic , University of Twente, The Netherlands
Maurice van Keulen , University of Twente, The Netherlands
Willem Jonker , Philips Research, The Netherlands
Semantic validation of the effectiveness of a schema matching system is traditionally performed by comparing system-generated mappings with those of human evaluators. The human effort required for validation quickly becomes huge in large scale environments. The performance of a matching system, however, is not solely determined by the quality of the mappings, but also by the efficiency with which it can produce them. Improving efficiency quickly leads to a trade-off between efficiency and effectiveness. Establishing or obtaining a large test collection for measuring this trade-off is often a severe obstacle. In this paper, we present a technique for determining lower and upper bounds for effectiveness measures for a certain class of schema matching system improvements in order to lower the required validation effort. Effectiveness bounds for a matching system improvement are solely derived from a comparison of answer sets of the improved and original matching system. The technique was developed in the context of improving efficiency in XML schema matching, but we believe it to be more generically applicable in other retrieval systems facing scalability problems.
Marko Smiljanic, Maurice van Keulen, Willem Jonker, "Effectiveness Bounds for Non-Exhaustive Schema Matching Systems", 2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW), vol. 00, no. , pp. 83, 2006, doi:10.1109/ICDEW.2006.51