Comparing similarity combination methods for schema matching
| dc.contributor.author | Peukert, Eric | |
| dc.contributor.author | Maßmann, Sabine | |
| dc.contributor.author | König, Kathleen | |
| dc.contributor.editor | Fähnrich, Klaus-Peter | |
| dc.contributor.editor | Franczyk, Bogdan | |
| dc.date.accessioned | 2019-01-11T10:12:09Z | |
| dc.date.available | 2019-01-11T10:12:09Z | |
| dc.date.issued | 2010 | |
| dc.description.abstract | A recurring manual task in data integration or ontology alignment is finding mappings between complex schemas. In order to reduce the manual effort, many matching algorithms for semi-automatically computing mappings were introduced. In the last decade it turned out that a combination of matching algorithms often improves mapping quality. Many possible combination methods can be found in literature, each promising good result quality for a specific domain of schemas. We introduce the rationale of each strategy shortly. Then we evaluate the most commonly used methods on a number of mapping tasks and try to find the most robust strategy that behaves well across all given tasks. | en |
| dc.identifier.isbn | 978-3-88579-269-7 | |
| dc.identifier.pissn | 1617-5468 | |
| dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/19127 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e.V. | |
| dc.relation.ispartof | INFORMATIK 2010. Service Science – Neue Perspektiven für die Informatik. Band 1 | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-175 | |
| dc.title | Comparing similarity combination methods for schema matching | en |
| dc.type | Text/Conference Paper | |
| gi.citation.endPage | 701 | |
| gi.citation.publisherPlace | Bonn | |
| gi.citation.startPage | 692 | |
| gi.conference.date | 27.09.-1.10.2010 | |
| gi.conference.location | Leipzig | |
| gi.conference.sessiontitle | Regular Research Papers |
Dateien
Originalbündel
1 - 1 von 1