Ontology-Driven Mashup Auto-Completion on a Data API Network

IF 5.2 1区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Tsinghua Science and Technology Pub Date : 2010-12-01 DOI:10.1016/S1007-0214(10)70113-9
Zhou Chunying (周春英) , Chen Huajun (陈华钧) , Peng Zhipeng (彭志鹏) , Ni Yuan (倪 渊) , Xie Guotong (谢国彤)
{"title":"Ontology-Driven Mashup Auto-Completion on a Data API Network","authors":"Zhou Chunying (周春英) ,&nbsp;Chen Huajun (陈华钧) ,&nbsp;Peng Zhipeng (彭志鹏) ,&nbsp;Ni Yuan (倪 渊) ,&nbsp;Xie Guotong (谢国彤)","doi":"10.1016/S1007-0214(10)70113-9","DOIUrl":null,"url":null,"abstract":"<div><p>The building of data mashups is complicated and error-prone, because this process requires not only finding suitable APIs but also combining them in an appropriate way to get the desired result. This paper describes an ontology-driven mashup auto-completion approach for a data API network to facilitate this task. First, a microformats-based ontology was defined to describe the attributes and activities of the data APIs. A semantic Bayesian network (sBN) and a semantic graph template were used for the link prediction on the Semantic Web and to construct a data API network denoted as <em>N</em><sub>p</sub>. The performance is improved by a semi-supervised learning method which uses both labeled and unlabeled data. Then, this network is used to build an ontology-driven mashup auto-completion system to help users build mashups by providing three kinds of recommendations. Tests demonstrate that the approach has a precision<sub>p</sub> of about 80%, recall<sub>p</sub> of about 60%, and <em>F</em><sub>0.5</sub> of about 70% for predicting links between APIs. Compared with the API network <em>N</em><sub>e</sub> composed of existing links on the current Web, <em>N</em><sub>p</sub> contains more links including those that should but do not exist. The ontology-driven mashup auto-completion system gives a much better recall<sub>r</sub> and discounted cumulative gain (DCG) on <em>N</em><sub>p</sub> than on <em>N</em><sub>e</sub>. The tests suggest that this approach gives users more creativity by constructing the API network through predicting mashup APIs rather than using only existing links on the Web.</p></div>","PeriodicalId":60306,"journal":{"name":"Tsinghua Science and Technology","volume":null,"pages":null},"PeriodicalIF":5.2000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1007-0214(10)70113-9","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Tsinghua Science and Technology","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1007021410701139","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 2

Abstract

The building of data mashups is complicated and error-prone, because this process requires not only finding suitable APIs but also combining them in an appropriate way to get the desired result. This paper describes an ontology-driven mashup auto-completion approach for a data API network to facilitate this task. First, a microformats-based ontology was defined to describe the attributes and activities of the data APIs. A semantic Bayesian network (sBN) and a semantic graph template were used for the link prediction on the Semantic Web and to construct a data API network denoted as Np. The performance is improved by a semi-supervised learning method which uses both labeled and unlabeled data. Then, this network is used to build an ontology-driven mashup auto-completion system to help users build mashups by providing three kinds of recommendations. Tests demonstrate that the approach has a precisionp of about 80%, recallp of about 60%, and F0.5 of about 70% for predicting links between APIs. Compared with the API network Ne composed of existing links on the current Web, Np contains more links including those that should but do not exist. The ontology-driven mashup auto-completion system gives a much better recallr and discounted cumulative gain (DCG) on Np than on Ne. The tests suggest that this approach gives users more creativity by constructing the API network through predicting mashup APIs rather than using only existing links on the Web.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于本体驱动的mashup在数据API网络上的自动实现
数据mashup的构建是复杂且容易出错的,因为这个过程不仅需要找到合适的AP,还需要以适当的方式将它们组合起来以获得所需的结果。本文描述了一种用于数据API网络的本体驱动mashup自动实现方法,以促进这项任务。首先,定义了一个基于微格式的本体来描述数据AP的属性和活动。利用语义贝叶斯网络(sBN)和语义图模板在语义网上进行链接预测,构建了一个数据为Np的API网络。通过使用标记和未标记数据的半监督学习方法,提高了网络的性能。然后,利用该网络构建了一个本体驱动的mashup自动完成系统,通过提供三种推荐来帮助用户构建mashup。测试表明,该方法对预测AP之间的链接具有约80%的精度、约60%的recallp和约70%的FO.5。与由当前Web上的现有链接组成的API网络Ne相比,Np包含更多的链接,包括那些应该存在但不存在的链接。本体驱动的mashup自动实现系统在Np上比在Ne上提供了更好的回忆和折扣累积收益(DCG)。测试表明,这种方法通过预测mashup AP来构建API网络,而不是仅使用Web上的现有链接,从而给用户带来了更大的创造力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
12.10
自引率
0.00%
发文量
2340
期刊最新文献
GSM Co-Channel and Adjacent Channel Interference Analysis and Optimization An MID-Based Load Balancing Approach for Topic-Based Pub-Sub Overlay Construction Optimal Power Control for OFDM Signals over Two-Way Relay with Physical Network Coding Efficient Algorithm for Prolonging Network Lifetime of Wireless Sensor Networks Guest Editorial: Special Issue on Wireless Sensor Networks, Cyber-Physical Systems, and Internet of Things
×
引用
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