2B or not 2B and everything in between - Novel evaluation methods for matching problems

Tomer Sagi*

*Corresponding author for this work

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

Abstract

Solving matching problems in computer science entails generating alignments between structured data. Well known examples are schema matching, process model matching, ontology alignment, and Web service composition. Design of software systems aimed at solving these problems, and refinement of interim results, are aided by solution quality evaluation measures. Historically, measures have been based upon binary set-theory, required an expert generated exact-match and assumed a single expert review following the algorithmic effort. Motivated by new applications for data integration, the dissertation both extends commonly used measures and proposes new measures to support evaluation in a variety of scenarios. We review the measures proposed to date and present an outlook towards future work.

Original languageEnglish
Title of host publication2014 IEEE 30th International Conference on Data Engineering Workshops, ICDEW 2014
Number of pages5
PublisherIEEE Computer Society Press
Publication date2014
Pages325-329
Article number6818349
ISBN (Print)9781479934805
DOIs
Publication statusPublished - 2014
Externally publishedYes
Event2014 IEEE 30th International Conference on Data Engineering Workshops, ICDEW 2014 - Chicago, IL, United States
Duration: 31 Mar 20144 Apr 2014

Conference

Conference2014 IEEE 30th International Conference on Data Engineering Workshops, ICDEW 2014
Country/TerritoryUnited States
CityChicago, IL
Period31/03/201404/04/2014
SeriesProceedings - International Conference on Data Engineering
ISSN1084-4627

Fingerprint

Dive into the research topics of '2B or not 2B and everything in between - Novel evaluation methods for matching problems'. Together they form a unique fingerprint.

Cite this