Artificial Intelligence
Pattern matching algorithms
Semantic integration of semistructured and structured data sources
ACM SIGMOD Record
The Tree-to-Tree Correction Problem
Journal of the ACM (JACM)
New algorithm for ordered tree-to-tree correction problem
Journal of Algorithms
Algorithms on Trees and Graphs
Algorithms on Trees and Graphs
Semantic Matching of Web Services Capabilities
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
A software framework for matchmaking based on semantic web technology
WWW '03 Proceedings of the 12th international conference on World Wide Web
The PROMPT suite: interactive tools for ontology merging and mapping
International Journal of Human-Computer Studies
The Knowledge Engineering Review
Constraint Driven Web Service Composition in METEOR-S
SCC '04 Proceedings of the 2004 IEEE International Conference on Services Computing
AI Magazine - Special issue on semantic integration
Accurate and Efficient HTML Differencing
STEP '05 Proceedings of the 13th IEEE International Workshop on Software Technology and Engineering Practice
Automated semantic web service discovery with OWLS-MX
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
eTuner: tuning schema matching software using synthetic scenarios
The VLDB Journal — The International Journal on Very Large Data Bases
Ontology Matching
Using Bayesian decision for ontology mapping
Web Semantics: Science, Services and Agents on the World Wide Web
Using Google distance to weight approximate ontology matches
Proceedings of the 16th international conference on World Wide Web
Matching independent global constraints for composite web services
Proceedings of the 17th international conference on World Wide Web
A large dataset for the evaluation of ontology matching
The Knowledge Engineering Review
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
Encoding classifications into lightweight ontologies
Journal on data semantics VIII
Semantic matching: algorithms and implementation
Journal on data semantics IX
Bootstrapping ontology alignment methods with APFEL
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
oMAP: combining classifiers for aligning automatically OWL ontologies
WISE'05 Proceedings of the 6th international conference on Web Information Systems Engineering
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
A survey of schema-based matching approaches
Journal on Data Semantics IV
Ten Challenges for Ontology Matching
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part II on On the Move to Meaningful Internet Systems
Faceted Lightweight Ontologies
Conceptual Modeling: Foundations and Applications
eGIF4M: eGovernment Interoperability Framework for Mozambique
EGOV '09 Proceedings of the 8th International Conference on Electronic Government
A faceted ontology for a semantic geo-catalogue
ESWC'11 Proceedings of the 8th extended semantic web conference on The semanic web: research and applications - Volume Part II
Lightweight coordination calculus for agent systems: retrospective and prospective
DALT'11 Proceedings of the 9th international conference on Declarative Agent Languages and Technologies
A survey of fuzzy service matching approaches in the context of on-the-fly computing
Proceedings of the 16th International ACM Sigsoft symposium on Component-based software engineering
Trust and matching algorithms for selecting suitable agents
ACM Transactions on Intelligent Systems and Technology (TIST) - Special Section on Intelligent Mobile Knowledge Discovery and Management Systems and Special Issue on Social Web Mining
Hi-index | 0.00 |
Typical ontology matching applications, such as ontology integration, focus on the computation of correspondences holding between the nodes of two graph-like structures, e.g., between concepts in two ontologies. However, for applications such as web service integration, we need to establish whether full graph structures correspond to one another globally, preserving certain structural properties of the graphs being considered. The goal of this paper is to provide a new matching operation, called structure-preserving semantic matching . This operation takes two graph-like structures and produces a set of correspondences, (i ) still preserving a set of structural properties of the graphs being matched, (ii ) only in the case if the graphs are globally similar to one another. Our approach is based on a formal theory of abstraction and on a tree edit distance measure. We have evaluated our solution in various settings. Empirical results show the efficiency and effectiveness of our approach.