{"title":"基于本体驱动的mashup在数据API网络上的自动实现","authors":"Zhou Chunying (周春英) , Chen Huajun (陈华钧) , Peng Zhipeng (彭志鹏) , Ni Yuan (倪 渊) , 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":"{\"title\":\"Ontology-Driven Mashup Auto-Completion on a Data API Network\",\"authors\":\"Zhou Chunying (周春英) , Chen Huajun (陈华钧) , Peng Zhipeng (彭志鹏) , Ni Yuan (倪 渊) , 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}","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}
Ontology-Driven Mashup Auto-Completion on a Data API Network
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.