Ontology Matching Performance Improvement using DTW

Title
Ontology Matching Performance Improvement using DTW
Authors
차재혁
Issue Date
2015-02
Publisher
International Information Institute
Citation
Information, v. 18, no.2, Page. 753-762
Abstract
Ontology is one important method by which data is expressed in Semantic Web. For Semantic Web based on ontology, it is important to produce ontology of various domains, but for sharing and expanding ontology, ontology matching work is very important. Using only possessed information of concept in ontology matching has limitation. Therefore, in recent studies, using relationship between concepts, that is, structural information, precision can be being raised. For this, if we use structurebased ontology matching method, its precision can be increased much, but because its complexity metric is quite high, it is difficult to implement this method in large sized ontology. In this study, to decrease complexity metric, a technique with which structural information is changed into sequential information and a DTW algorithm application on ontology matching have been suggested. Also, it has been proved through testing that by implementing the method which has been suggested in this study, the performance of existing multi strategic systems can be improved.
URI
http://hdl.handle.net/20.500.11754/22299http://search.proquest.com/openview/3bfd52aa35137b9e58fae300abe089f5/1?pq-origsite=gscholar&cbl=936334
ISSN
1343-4500
Appears in Collections:
COLLEGE OF ENGINEERING[S](공과대학) > COMPUTER SCIENCE AND ENGINEERING(컴퓨터공학부) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE