A framework of checking subsumption relations between composite concepts in different ontologies

Authors:
Dazhou Kang;Jianjiang Lu;Baowen Xu;Peng Wang;Yanhui Li
Affiliations:
Department of Computer Science and Engineering, Southeast University, Nanjing, China;Department of Computer Science and Engineering, Southeast University, Nanjing, China;Department of Computer Science and Engineering, Southeast University, Nanjing, China;Department of Computer Science and Engineering, Southeast University, Nanjing, China;Department of Computer Science and Engineering, Southeast University, Nanjing, China
Venue:
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part I
Year:
2005

Citing 7
Cited 0

Learning to map between ontologies on the semantic web

Proceedings of the 11th international conference on World Wide Web
Determining Semantic Similarity among Entity Classes from Different Ontologies

IEEE Transactions on Knowledge and Data Engineering
A Query Subsumption Technique

DEXA '99 Proceedings of the 10th International Conference on Database and Expert Systems Applications
The description logic handbook: theory, implementation, and applications

The description logic handbook: theory, implementation, and applications
Ontology mapping: the state of the art

The Knowledge Engineering Review
Cluster Analysis

Cluster Analysis
From manual to semi-automatic semantic annotation: about ontology-based text annotation tools

Proceedings of the COLING-2000 Workshop on Semantic Annotation and Intelligent Content

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ontology-based applications always need checking subsumption relations between concepts. Current subsumption checking approaches are not appropriate to check subsumption relations between composite concepts in different ontologies. This paper proposes a framework, which is practical and effective to check subsumption relations between composite concepts in different ontologies. The framework is based on learning the mutual instances of different ontologies. It analyses the problems when generating and checking of mutual instances, and provides effective processes to solve them. The framework is fault tolerance and can deal with large-scale mutual instances; it can greatly reduce the manual annotation work, which is the main limitation in mutual instances approaches; intensions are also considered to avoid unnecessary instance checking and hit-and-miss results.