Resolving scalability issue to ontology instance matching in Semantic Web

Rudra Pratap Deb Nath, Hanif Seddiqui, Masaki Aono
{"title":"Resolving scalability issue to ontology instance matching in Semantic Web","authors":"Rudra Pratap Deb Nath, Hanif Seddiqui, Masaki Aono","doi":"10.1109/ICCITECHN.2012.6509778","DOIUrl":null,"url":null,"abstract":"Ontology instance matching is a key interoperability enabler across heterogeneous data sources in the Semantic Web and a useful maneuver in some classical data integration tasks dealing with the semantic heterogeneous assignments. Though most of the research has been conducted on ontology schema level matching so far, with the introduction of Linked Open Data (LOD) and social networks, research on ontology matching is shifting from ontology schema or concept level to instance level. Since heterogeneous sources of massive ontology instances grow sharply day-by-day, scalability has become a major research issue in ontology instance matching of semantic knowledge bases. In this paper, we propose an efficient method by grouping instances of knowledge base into several sub-groups to address the scalability issue. Then, our instance matcher, which considers the semantic specification of properties associated to instances in the matching strategy, works by comparing an instance within a classification group of one knowledge base against the instances of same sub-group of other knowledge base to achieve interoperability. A novel approach for measuring the influence of properties in the matching process is also presented. The experiment and evaluation depicts satisfactory results in terms of effectiveness and scalability over baseline methods.","PeriodicalId":127060,"journal":{"name":"2012 15th International Conference on Computer and Information Technology (ICCIT)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 15th International Conference on Computer and Information Technology (ICCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCITECHN.2012.6509778","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Ontology instance matching is a key interoperability enabler across heterogeneous data sources in the Semantic Web and a useful maneuver in some classical data integration tasks dealing with the semantic heterogeneous assignments. Though most of the research has been conducted on ontology schema level matching so far, with the introduction of Linked Open Data (LOD) and social networks, research on ontology matching is shifting from ontology schema or concept level to instance level. Since heterogeneous sources of massive ontology instances grow sharply day-by-day, scalability has become a major research issue in ontology instance matching of semantic knowledge bases. In this paper, we propose an efficient method by grouping instances of knowledge base into several sub-groups to address the scalability issue. Then, our instance matcher, which considers the semantic specification of properties associated to instances in the matching strategy, works by comparing an instance within a classification group of one knowledge base against the instances of same sub-group of other knowledge base to achieve interoperability. A novel approach for measuring the influence of properties in the matching process is also presented. The experiment and evaluation depicts satisfactory results in terms of effectiveness and scalability over baseline methods.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
解决语义Web中本体实例匹配的可扩展性问题
本体实例匹配是语义Web中跨异构数据源的关键互操作性实现手段,也是处理语义异构分配的经典数据集成任务的一种有效策略。虽然目前大部分的研究都是在本体模式级的匹配上进行的,但是随着链接开放数据(Linked Open Data, LOD)和社交网络的引入,对本体匹配的研究正从本体模式或概念级转向实例级。随着海量本体实例异构来源的急剧增长,可扩展性成为语义知识库本体实例匹配的主要研究问题。在本文中,我们提出了一种有效的方法,通过将知识库实例分组到几个子组来解决可扩展性问题。然后,我们的实例匹配器考虑匹配策略中与实例相关的属性的语义规范,通过将一个知识库的分类组中的实例与其他知识库的同一子组的实例进行比较来实现互操作性。提出了一种测量匹配过程中属性影响的新方法。实验和评估描述了在有效性和可扩展性方面优于基线方法的令人满意的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Noise reduction algorithm for LS channel estimation in OFDM system Composite pattern matching in time series Android mobile application: Remote monitoring of blood pressure Affective mapping of EEG during executive function tasks Distributed k-dominant skyline queries
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1