Sciweavers

24 search results - page 1 / 5
» Relaxed Precision and Recall for Ontology Matching
Sort
View
KCAP
2005
ACM
13 years 10 months ago
Relaxed Precision and Recall for Ontology Matching
In order to evaluate the performance of ontology matching algorithms it is necessary to confront them with test ontologies and to compare the results. The most prominent criteria ...
Marc Ehrig, Jérôme Euzenat
IJCAI
2007
13 years 6 months ago
Semantic Precision and Recall for Ontology Alignment Evaluation
In order to evaluate ontology matching algorithms it is necessary to confront them with test ontologies and to compare the results with some reference. The most prominent comparis...
Jérôme Euzenat
TKDE
2010
153views more  TKDE 2010»
13 years 3 months ago
Automatic Ontology Matching via Upper Ontologies: A Systematic Evaluation
—“Ontology matching” is the process of finding correspondences between entities belonging to different ontologies. This paper describes a set of algorithms that exploit uppe...
Viviana Mascardi, Angela Locoro, Paolo Rosso
SEMWEB
2009
Springer
13 years 11 months ago
Recommendations for Qualitative Ontology Matching Evaluations
This paper suggests appropriate rules to set up ontology matching evaluations and for golden standard construction and use which can significantly improve the quality of the preci...
Aliaksandr Autayeu, Vincenzo Maltese, Pierre Andre...
SIGMOD
2009
ACM
192views Database» more  SIGMOD 2009»
14 years 5 months ago
A gauss function based approach for unbalanced ontology matching
Ontology matching, aiming to obtain semantic correspondences between two ontologies, has played a key role in data exchange, data integration and metadata management. Among numero...
Qian Zhong, Hanyu Li, Juanzi Li, Guo Tong Xie, Jie...