Putting Feedback into Incremental Schema Matching

Cao, Zhao; Li, Kan; Liu, Yushu

doi:10.1109/wcse.2009.373

Cited by 1 publication

(2 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As with the original name matcher first the names are tokenized (1). Then the occurrences of tokens are counted (2). The token similarities are computed for each element comparison and put into the token similarity matrices (3).…”

Section: Weighted Token Name Matchermentioning

confidence: 99%

See 1 more Smart Citation

Restricting the overlap of Top-N sets in schema matching

Peukert

Rahm

2011

Proceedings of the 1st Workshop on New Trends in Similarity Search

View full text Add to dashboard Cite

Computing similarities between metadata elements is an essential process in schema and ontology matching systems. Such systems aim at reducing the manual effort of finding mappings for data integration or ontology alignment. Similarity measures compute syntactic, semantic or structural similarities of metadata elements. Typically, different similarities are combined and the most similar element pairs are selected to produce a best-1 mapping suggestion. Unfortunately automatic schema matching systems are only rarely commercially adopted since correcting the best-1mapping suggestion is often harder than finding the mapping manually. To alleviate this, schema matching must be used incrementally by computing Top-N mapping suggestions that the user can select from. However, current similarity measures and selection operators suggest the same target elements for many different source elements. This effect, that we call overlap, reduces the quality of schema matching significantly. To address this problem, we introduce a new weighted token similarity measure that implicitly decreases the overlap between Top-N sets. Secondly, a new Top-N selection operator is introduced that is able to increase the recall by restricting overlap directly. We evaluate our approaches on large-sized, real world matching problems and show the positive effect on match quality.

show abstract

Section: Weighted Token Name Matchermentioning

confidence: 99%

“…Some work was proposed on incremental matching [1][2] that includes user feedback into the computation of further Top-N sets [2]. It is related since an already chosen target match should not occur again in a subsequent top-N set.…”

Section: Related Workmentioning

confidence: 99%

Restricting the overlap of Top-N sets in schema matching

Peukert

Rahm

2011

Proceedings of the 1st Workshop on New Trends in Similarity Search

View full text Add to dashboard Cite

show abstract

Putting Feedback into Incremental Schema Matching

Cited by 1 publication

References 12 publications

Restricting the overlap of Top-N sets in schema matching

Restricting the overlap of Top-N sets in schema matching

Contact Info

Product

Resources

About