A Novel Algorithm for Matching Conceptual and Related Graphs
ICCS '95 Proceedings of the Third International Conference on Conceptual Structures: Applications, Implementation and Theory
Generic Schema Matching with Cupid
Proceedings of the 27th International Conference on Very Large Data Bases
The Chimaera Ontology Environment
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Representing and reasoning about mappings between domain models
Eighteenth national conference on Artificial intelligence
Similarity Flooding: A Versatile Graph Matching Algorithm and Its Application to Schema Matching
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Overview and analysis of methodologies for building ontologies
The Knowledge Engineering Review
ITCC '04 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'04) Volume 2 - Volume 2
The Knowledge Engineering Review
Ontology Matching
COMA: a system for flexible combination of schema matching approaches
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
FCA-MERGE: bottom-up merging of ontologies
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
DEMO: design environment for metadata ontologies
ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications
Improving Ontology Matching Using Meta-level Learning
ESWC 2009 Heraklion Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications
Automatic configuration selection using ontology matching task profiling
ESWC'12 Proceedings of the 9th international conference on The Semantic Web: research and applications
Hi-index | 0.00 |
The central problems w.r.t. interoperability and data integration issues in the Semantic Web are schema and ontology matching approaches. Today it takes an expert to determine the best algorithm and a decision can usually be made only after experimentation, so as both the necessary scaling and off-the-shelf use of matching algorithms are not possible. To tackle these issues, we present a rule-based evaluation method in which the best algorithms are determined semi-automatically and the selection performs prior to the execution of an algorithm.