基于加权启发式的非相干映射修复最优寻径算法

Inne Gartina Husein, B. Sitohang, Saiful Akbar, F. N. Azizah
{"title":"基于加权启发式的非相干映射修复最优寻径算法","authors":"Inne Gartina Husein, B. Sitohang, Saiful Akbar, F. N. Azizah","doi":"10.1109/ICODSE.2018.8705812","DOIUrl":null,"url":null,"abstract":"Coherent mapping becomes important resources in ontology matching process. A process called mapping repair is carried out to ensure the output alignment does not contain incoherent mapping. The goal of repair is to change the incoherent alignment into coherent alignment by removing some unwanted mapping from the alignment. The removal of mapping should be as minimal as possible in order to avoid a major change in input alignment. This article aims to build a mapping repair system that restore incoherent into coherent mapping (or alignment). This study implements mapping weighting as the heuristic function and A* Search method to produce coherent output alignment. Some experiments were conducted, the results showed that proposed system can produce output alignment with zero conflict and 100% coherence degree.","PeriodicalId":362422,"journal":{"name":"2018 5th International Conference on Data and Software Engineering (ICoDSE)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Optimal Path Finding Algorithm Using Weighted Based Heuristic for Incoherent Mapping Repair\",\"authors\":\"Inne Gartina Husein, B. Sitohang, Saiful Akbar, F. N. Azizah\",\"doi\":\"10.1109/ICODSE.2018.8705812\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Coherent mapping becomes important resources in ontology matching process. A process called mapping repair is carried out to ensure the output alignment does not contain incoherent mapping. The goal of repair is to change the incoherent alignment into coherent alignment by removing some unwanted mapping from the alignment. The removal of mapping should be as minimal as possible in order to avoid a major change in input alignment. This article aims to build a mapping repair system that restore incoherent into coherent mapping (or alignment). This study implements mapping weighting as the heuristic function and A* Search method to produce coherent output alignment. Some experiments were conducted, the results showed that proposed system can produce output alignment with zero conflict and 100% coherence degree.\",\"PeriodicalId\":362422,\"journal\":{\"name\":\"2018 5th International Conference on Data and Software Engineering (ICoDSE)\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 5th International Conference on Data and Software Engineering (ICoDSE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICODSE.2018.8705812\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 5th International Conference on Data and Software Engineering (ICoDSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICODSE.2018.8705812","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

相干映射是本体匹配过程中的重要资源。执行一个称为映射修复的过程,以确保输出对齐不包含不一致的映射。修复的目的是通过从对齐中去除一些不需要的映射,将非相干对齐变为相干对齐。为了避免输入对齐的重大变化,映射的删除应该尽可能地少。本文旨在建立一个将非相干映射恢复为相干映射(或对齐)的映射修复系统。本研究采用映射加权作为启发式函数,并采用A*搜索方法产生连贯的输出对齐。实验结果表明,该系统可以产生零冲突和100%相干度的输出对齐。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimal Path Finding Algorithm Using Weighted Based Heuristic for Incoherent Mapping Repair
Coherent mapping becomes important resources in ontology matching process. A process called mapping repair is carried out to ensure the output alignment does not contain incoherent mapping. The goal of repair is to change the incoherent alignment into coherent alignment by removing some unwanted mapping from the alignment. The removal of mapping should be as minimal as possible in order to avoid a major change in input alignment. This article aims to build a mapping repair system that restore incoherent into coherent mapping (or alignment). This study implements mapping weighting as the heuristic function and A* Search method to produce coherent output alignment. Some experiments were conducted, the results showed that proposed system can produce output alignment with zero conflict and 100% coherence degree.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信