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 a...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 com-posed 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 cumula-tive 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.展开更多
随着互联网和面向服务技术的发展,一种新型的Web应用——Mashup服务,开始在互联网上流行并快速增长.如何在众多Mashup服务中找到高质量的服务,已经成为一个大家关注的热点问题.寻找功能相似的服务并进行聚类,能有效提升服务发现的精度...随着互联网和面向服务技术的发展,一种新型的Web应用——Mashup服务,开始在互联网上流行并快速增长.如何在众多Mashup服务中找到高质量的服务,已经成为一个大家关注的热点问题.寻找功能相似的服务并进行聚类,能有效提升服务发现的精度与效率.目前国内外主流方法为挖掘Mashup服务中隐含的功能信息,进一步采用特定聚类算法如K-means等进行聚类.然而Mashup服务文档通常为短文本,基于传统的挖掘算法如LDA无法有效处理短文本,导致聚类效果并不理想.针对这一问题,提出一种基于非负矩阵分解的TWE-NMF(nonnegative matrix factorization combining tags and word embedding)模型对Mashup服务进行主题建模.所提方法首先对Mashup服务规范化处理,其次采用一种基于改进的Gibbs采样的狄利克雷过程混合模型,自动估算主题的数量,随后将词嵌入和服务标签等信息与非负矩阵分解相结合,求解Mashup服务主题特征,并通过谱聚类算法将服务聚类.最后,对所提方法的性能进行了综合评价,实验结果表明,与现有的服务聚类方法相比,所提方法在准确率、召回率、F-measure、纯度和熵等评价指标方面都有显著提高.展开更多
Recent years have witnessed the rapid development of service‐oriented computing technologies.The boom of Web services increases software developers'selection burden in developing new service‐based systems such a...Recent years have witnessed the rapid development of service‐oriented computing technologies.The boom of Web services increases software developers'selection burden in developing new service‐based systems such as mashups.Timely recommending appropriate component services for developers to build new mashups has become a fundamental problem in service‐oriented software engineering.Existing service recom-mendation approaches are mainly designed for mashup development in the single‐round scenario.It is hard for them to effectively update recommendation results according to developers'requirements and behaviours(e.g.instant service selection).To address this issue,the authors propose a service bundle recommendation framework based on deep learning,DLISR,which aims to capture the interactions among the target mashup to build,selected(component)services,and the following service to recommend.Moreover,an attention mechanism is employed in DLISR to weigh selected services when rec-ommending a candidate service.The authors also design two separate models for learning interactions from the perspectives of content and invocation history,respectively,and a hybrid model called HISR.Experiments on a real‐world dataset indicate that HISR can outperform several state‐of‐the‐art service recommendation methods to develop new mashups iteratively.展开更多
A large number of Web APIs have been released as services in mobile communications,but the service provided by a single Web API is usually limited.To enrich the services in mobile communications,developers have combin...A large number of Web APIs have been released as services in mobile communications,but the service provided by a single Web API is usually limited.To enrich the services in mobile communications,developers have combined Web APIs and developed a new service,which is known as a mashup.The emergence of mashups greatly increases the number of services in mobile communications,especially in mobile networks and the Internet-of-Things(IoT),and has encouraged companies and individuals to develop even more mashups,which has led to the dramatic increase in the number of mashups.Such a trend brings with it big data,such as the massive text data from the mashups themselves and continually-generated usage data.Thus,the question of how to determine the most suitable mashups from big data has become a challenging problem.In this paper,we propose a mashup recommendation framework from big data in mobile networks and the IoT.The proposed framework is driven by machine learning techniques,including neural embedding,clustering,and matrix factorization.We employ neural embedding to learn the distributed representation of mashups and propose to use cluster analysis to learn the relationship among the mashups.We also develop a novel Joint Matrix Factorization(JMF)model to complete the mashup recommendation task,where we design a new objective function and an optimization algorithm.We then crawl through a real-world large mashup dataset and perform experiments.The experimental results demonstrate that our framework achieves high accuracy in mashup recommendation and performs better than all compared baselines.展开更多
随着互联网上Mashup服务数量及种类的急剧增长,如何从这些海量的服务集合中快速、精准地发现满足用户需求的Mashup服务,成为一个具有挑战性的问题.针对这一问题,本文提出一种融合功能语义关联计算与密度峰值检测的Mashup服务聚类方法,...随着互联网上Mashup服务数量及种类的急剧增长,如何从这些海量的服务集合中快速、精准地发现满足用户需求的Mashup服务,成为一个具有挑战性的问题.针对这一问题,本文提出一种融合功能语义关联计算与密度峰值检测的Mashup服务聚类方法,用于缩小服务的搜索空间,提升服务发现的精度与效率.首先,该方法对Mashup服务进行元信息提取和描述文本内容整理,并根据Web API组合的标签对相应Mashup服务标签进行扩充.然后,用基于功能语义关联计算方法(Functional Semantic Association Calculation Method,FSAC)提取出各服务描述的功能名词集合,并通过功能名词的语义权重来构造Mashup语义特征向量.最后,通过基于密度信息的聚类中心检测方法(Clustering Center Detection Method based on Density Information,CCD-DI)检测出最为合适的K个Mashup语义特征向量作为K-means算法的初始中心,进行聚类划分.基于ProgrammableWeb的真实数据实验表明,本文所提聚类方法在纯度、精准率、召回率、熵等指标上均有良好表现.展开更多
随着高速发展的互联网和移动通信在业务层面的逐渐融合,国内运营商所采用的"封闭花园"模式的业务架构已经面临各种挑战,因此需要更多地考虑如何有效引入互联网业务和服务模式,不断提升用户体验。在电信运营商逐步开放其电信能...随着高速发展的互联网和移动通信在业务层面的逐渐融合,国内运营商所采用的"封闭花园"模式的业务架构已经面临各种挑战,因此需要更多地考虑如何有效引入互联网业务和服务模式,不断提升用户体验。在电信运营商逐步开放其电信能力API的背景下,基于Mashup的业务构建模式,提出了一种云计算环境下的电信网络能力服务提供模式。该模式将Mashup的理念移植到电信能力上,并将电信能力封装成Web Element的形式呈现给用户,进一步提升了电信网络能力服务的抽象层次。这种电信能力应用模式打破了电信能力拘泥于手持终端的传统形式,提出了一种新的适合于Web2.0环境的电信网络能力服务提供模式。在"OMP(Open Mobile Internet Platform)应用运行和开发引擎算法及功能研发"项目中的试用证明了其可行性。展开更多
基金Supported by the National Natural Science Foundation of China(No. 61070156)Special Youth Research and Innovation Programs (Nos.2009QNA5025 and 2010QNA5044)IBM-ZJU Joint Research Projects
文摘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 com-posed 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 cumula-tive 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.
文摘随着互联网和面向服务技术的发展,一种新型的Web应用——Mashup服务,开始在互联网上流行并快速增长.如何在众多Mashup服务中找到高质量的服务,已经成为一个大家关注的热点问题.寻找功能相似的服务并进行聚类,能有效提升服务发现的精度与效率.目前国内外主流方法为挖掘Mashup服务中隐含的功能信息,进一步采用特定聚类算法如K-means等进行聚类.然而Mashup服务文档通常为短文本,基于传统的挖掘算法如LDA无法有效处理短文本,导致聚类效果并不理想.针对这一问题,提出一种基于非负矩阵分解的TWE-NMF(nonnegative matrix factorization combining tags and word embedding)模型对Mashup服务进行主题建模.所提方法首先对Mashup服务规范化处理,其次采用一种基于改进的Gibbs采样的狄利克雷过程混合模型,自动估算主题的数量,随后将词嵌入和服务标签等信息与非负矩阵分解相结合,求解Mashup服务主题特征,并通过谱聚类算法将服务聚类.最后,对所提方法的性能进行了综合评价,实验结果表明,与现有的服务聚类方法相比,所提方法在准确率、召回率、F-measure、纯度和熵等评价指标方面都有显著提高.
基金supported by the National Key Research and Development Program of China(No.2020AAA0107705)the National Science Foundation of China(Nos.61972292 and 62032016).
文摘Recent years have witnessed the rapid development of service‐oriented computing technologies.The boom of Web services increases software developers'selection burden in developing new service‐based systems such as mashups.Timely recommending appropriate component services for developers to build new mashups has become a fundamental problem in service‐oriented software engineering.Existing service recom-mendation approaches are mainly designed for mashup development in the single‐round scenario.It is hard for them to effectively update recommendation results according to developers'requirements and behaviours(e.g.instant service selection).To address this issue,the authors propose a service bundle recommendation framework based on deep learning,DLISR,which aims to capture the interactions among the target mashup to build,selected(component)services,and the following service to recommend.Moreover,an attention mechanism is employed in DLISR to weigh selected services when rec-ommending a candidate service.The authors also design two separate models for learning interactions from the perspectives of content and invocation history,respectively,and a hybrid model called HISR.Experiments on a real‐world dataset indicate that HISR can outperform several state‐of‐the‐art service recommendation methods to develop new mashups iteratively.
基金supported by the National Key R&D Program of China (No.2021YFF0901002)the National Natural Science Foundation of China (No.61802291)+1 种基金Fundamental Research Funds for the Provincial Universities of Zhejiang (GK199900299012-025)Fundamental Research Funds for the Central Universities (No.JB210311).
文摘A large number of Web APIs have been released as services in mobile communications,but the service provided by a single Web API is usually limited.To enrich the services in mobile communications,developers have combined Web APIs and developed a new service,which is known as a mashup.The emergence of mashups greatly increases the number of services in mobile communications,especially in mobile networks and the Internet-of-Things(IoT),and has encouraged companies and individuals to develop even more mashups,which has led to the dramatic increase in the number of mashups.Such a trend brings with it big data,such as the massive text data from the mashups themselves and continually-generated usage data.Thus,the question of how to determine the most suitable mashups from big data has become a challenging problem.In this paper,we propose a mashup recommendation framework from big data in mobile networks and the IoT.The proposed framework is driven by machine learning techniques,including neural embedding,clustering,and matrix factorization.We employ neural embedding to learn the distributed representation of mashups and propose to use cluster analysis to learn the relationship among the mashups.We also develop a novel Joint Matrix Factorization(JMF)model to complete the mashup recommendation task,where we design a new objective function and an optimization algorithm.We then crawl through a real-world large mashup dataset and perform experiments.The experimental results demonstrate that our framework achieves high accuracy in mashup recommendation and performs better than all compared baselines.
文摘随着互联网上Mashup服务数量及种类的急剧增长,如何从这些海量的服务集合中快速、精准地发现满足用户需求的Mashup服务,成为一个具有挑战性的问题.针对这一问题,本文提出一种融合功能语义关联计算与密度峰值检测的Mashup服务聚类方法,用于缩小服务的搜索空间,提升服务发现的精度与效率.首先,该方法对Mashup服务进行元信息提取和描述文本内容整理,并根据Web API组合的标签对相应Mashup服务标签进行扩充.然后,用基于功能语义关联计算方法(Functional Semantic Association Calculation Method,FSAC)提取出各服务描述的功能名词集合,并通过功能名词的语义权重来构造Mashup语义特征向量.最后,通过基于密度信息的聚类中心检测方法(Clustering Center Detection Method based on Density Information,CCD-DI)检测出最为合适的K个Mashup语义特征向量作为K-means算法的初始中心,进行聚类划分.基于ProgrammableWeb的真实数据实验表明,本文所提聚类方法在纯度、精准率、召回率、熵等指标上均有良好表现.
文摘随着高速发展的互联网和移动通信在业务层面的逐渐融合,国内运营商所采用的"封闭花园"模式的业务架构已经面临各种挑战,因此需要更多地考虑如何有效引入互联网业务和服务模式,不断提升用户体验。在电信运营商逐步开放其电信能力API的背景下,基于Mashup的业务构建模式,提出了一种云计算环境下的电信网络能力服务提供模式。该模式将Mashup的理念移植到电信能力上,并将电信能力封装成Web Element的形式呈现给用户,进一步提升了电信网络能力服务的抽象层次。这种电信能力应用模式打破了电信能力拘泥于手持终端的传统形式,提出了一种新的适合于Web2.0环境的电信网络能力服务提供模式。在"OMP(Open Mobile Internet Platform)应用运行和开发引擎算法及功能研发"项目中的试用证明了其可行性。
