Relation based Ontology Matching using Alignment Strategies
Journal Title: International Journal on Computer Science and Engineering - Year 2011, Vol 3, Issue 4
Abstract
The set of relation within a knowledge domain will be expressed with a help of Ontology, but data within the knowledge domain get scattered all over its space. To get a most precise result there must be necessary to relate the concepts or keywords within a domain. One of the efficient ways of matching or relating data must be done by implementing ontology within a domain. It aims to make data sharable. Unfortunately, the ontology is widely distributed as well as heterogeneous. The main aim of Ontology matching is to determine the relationship between the concepts and to find the Semantical mappings between two given ontologies. This problem lies at the heart of numerous information processing applications. In order to dilute the problem evolution of Upper ontology have taken place. The upper ontology will act as a base for representing concepts in all the domains, the primary objective is to extract or representing the general concepts throughout the domains based on the ontological structure.
Authors and Affiliations
Mr. S. Vivekanandan , Mr. P. Marikkannu,
Keywords
Related Articles
- EP ID EP108130
- DOI -
- Views 126
- Downloads 0
Architecture for efficiently streaming stored video using TCP
Abstract : TCP (Transmission Control Protocol) with its wellestablished congestion control mechanism is the prevailing transport layer protocol for non-real time data in current IP (Internet Protocol) networks. It would...
Adaptive Local Image Registration: Analysis on Filter Size
Adaptive Local Image Registration is a Local Image Registration based on an Adaptive Filtering frame work. A filter of appropriate size convolves with reference image and gives the pixel values corresponding to the disto...
A Study on Similarity Computations in Template Matching Technique for Identity Verification
This paper describes a study on the development of a human face verification system by merely using template matching (TM) as the main verification engine. In contrast to common face recognition techniques, our approach...
Harnessing Genetic Algorithm for Vertex Cover Problem
The problem of finding a minimum vertex cover is an NP hard optimization problem. Some approximation algorithms for the problem have been proposed but most of them are neither optimal nor complete. The work proposes the...
Cryptography for Resource Constrained Devices: A Survey
Specifically designed and developed cryptographic algorithms, which are suitable for implementation in resource constrained devices such as RFID systems, smart cards and wireless sensor networks are called light weight c...