2013
DOI: 10.2139/ssrn.3199068
|View full text |Cite
|
Sign up to set email alerts
|

Evaluation of Instance Matching Tools: The Experience of OAEI

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2014
2014
2017
2017

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 24 publications
0
3
0
Order By: Relevance
“…There is not much support for n:m alignments; otherwise, systems mostly focus on 1:1 ones. Evaluations in [29,30] show that regarding matching geospatial datasets, such as DBpediaand Geonames, the existing tools are efficient for simple geospatial representations, such as (latitude, longitude), while failing with more complex ones.…”
Section: Automatic Schema Matchingmentioning
confidence: 99%
“…There is not much support for n:m alignments; otherwise, systems mostly focus on 1:1 ones. Evaluations in [29,30] show that regarding matching geospatial datasets, such as DBpediaand Geonames, the existing tools are efficient for simple geospatial representations, such as (latitude, longitude), while failing with more complex ones.…”
Section: Automatic Schema Matchingmentioning
confidence: 99%
“…After discussing a number of linking systems in the mentioned study, the authors focused on one of the tools to employ it in the proposed framework. In the context of the Ontology Alignment Evaluation Initiative, Ferrara et al [18] evaluated several instance matching systems and reported their experimental results on a real-world benchmark task over several LOD datasets. In particular, the presented approach combined real-data and automatically generated data to provide a framework that would produce different causes of data heterogeneity.…”
Section: Background and Related Workmentioning
confidence: 99%
“…Many instance matching approaches have been proposed. However, most of them cannot deal with large-scale knowledge bases nicely because they require traversing all instance pairs between two knowledge bases [1][2][3] . Some other approaches, such as CODI [4] , Silk [5] , PARIS [6] , and SIGMa [7] , are proposed for large-scale instance matching.…”
Section: Introductionmentioning
confidence: 99%