S-ABCPK参数调优:一种考虑先验知识的改进服务组合算法

IF 0.8 4区 计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS International Journal of Web Services Research Pub Date : 2019-04-01 DOI:10.4018/IJWSR.2019040105
Ruilin Liu, Zhongjie Wang, Xiaofei Xu
{"title":"S-ABCPK参数调优:一种考虑先验知识的改进服务组合算法","authors":"Ruilin Liu, Zhongjie Wang, Xiaofei Xu","doi":"10.4018/IJWSR.2019040105","DOIUrl":null,"url":null,"abstract":"QoS-aware service composition problem has been drawn great attention in recent years. As an NP-hard problem, high time complexity is inevitable if global optimization algorithms (such as integer programming) are adopted. Researchers applied various evolutionary algorithms to decrease the time complexity by looking for a near-optimum solution. However, each evolutionary algorithm has two or more parameters, the values of which are to be assigned by algorithm designers and likely have impacts on the optimization results (primarily time complexity and optimality). The authors' experiments show that there are some dependencies between the features of a service composition problem, the values of an evolutionary algorithm's parameters, and the optimization results. In this article, the authors propose an improved algorithm called Service-Oriented Artificial Bee Colony algorithm considering Priori Knowledge (S-ABCPK) to solve service composition problem and focus on the S-ABCPK's parameter turning issue. The objective is to identify the potential dependency for designers of a service composition algorithm easily setting up the values of S-ABCPK parameters to obtain a preferable composition solution without many times of tedious attempts. Eight features of the service composition problem and the priori knowledge, five S-ABCPK parameters and two metrics of the final solution are identified. Based on a large volume of experiment data, S-ABCPK parameter tuning for a given service composition problem is conducted using C4.5 algorithm and the dependency between problem features and S-ABCPK parameters are established using the neural network method. An experiment on a validation dataset shows the feasibility of the approach.","PeriodicalId":54936,"journal":{"name":"International Journal of Web Services Research","volume":"65 4","pages":"88-109"},"PeriodicalIF":0.8000,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Parameter Tuning for S-ABCPK: An Improved Service Composition Algorithm Considering Priori Knowledge\",\"authors\":\"Ruilin Liu, Zhongjie Wang, Xiaofei Xu\",\"doi\":\"10.4018/IJWSR.2019040105\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"QoS-aware service composition problem has been drawn great attention in recent years. As an NP-hard problem, high time complexity is inevitable if global optimization algorithms (such as integer programming) are adopted. Researchers applied various evolutionary algorithms to decrease the time complexity by looking for a near-optimum solution. However, each evolutionary algorithm has two or more parameters, the values of which are to be assigned by algorithm designers and likely have impacts on the optimization results (primarily time complexity and optimality). The authors' experiments show that there are some dependencies between the features of a service composition problem, the values of an evolutionary algorithm's parameters, and the optimization results. In this article, the authors propose an improved algorithm called Service-Oriented Artificial Bee Colony algorithm considering Priori Knowledge (S-ABCPK) to solve service composition problem and focus on the S-ABCPK's parameter turning issue. The objective is to identify the potential dependency for designers of a service composition algorithm easily setting up the values of S-ABCPK parameters to obtain a preferable composition solution without many times of tedious attempts. Eight features of the service composition problem and the priori knowledge, five S-ABCPK parameters and two metrics of the final solution are identified. Based on a large volume of experiment data, S-ABCPK parameter tuning for a given service composition problem is conducted using C4.5 algorithm and the dependency between problem features and S-ABCPK parameters are established using the neural network method. An experiment on a validation dataset shows the feasibility of the approach.\",\"PeriodicalId\":54936,\"journal\":{\"name\":\"International Journal of Web Services Research\",\"volume\":\"65 4\",\"pages\":\"88-109\"},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2019-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Web Services Research\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.4018/IJWSR.2019040105\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Web Services Research","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.4018/IJWSR.2019040105","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 3

摘要

基于qos的服务组合问题近年来受到了广泛的关注。作为NP-hard问题,如果采用全局优化算法(如整数规划),则不可避免地会有较高的时间复杂度。研究人员应用各种进化算法,通过寻找接近最优的解决方案来降低时间复杂度。然而,每一种进化算法都有两个或两个以上的参数,这些参数的值是由算法设计者分配的,并且可能对优化结果产生影响(主要是时间复杂度和最优性)。实验表明,服务组合问题的特征、演化算法的参数值与优化结果之间存在一定的依赖关系。本文提出了一种考虑先验知识的面向服务人工蜂群算法(S-ABCPK)来解决服务组合问题,并重点研究了S-ABCPK的参数转换问题。目标是为服务组合算法的设计人员识别潜在的依赖关系,从而轻松地设置S-ABCPK参数的值,从而无需多次繁琐的尝试即可获得优选的组合解决方案。确定了服务组合问题的8个特征和先验知识、5个S-ABCPK参数和最终解决方案的2个度量。在大量实验数据的基础上,利用C4.5算法对给定的服务组合问题进行S-ABCPK参数调优,并利用神经网络方法建立问题特征与S-ABCPK参数之间的依赖关系。在验证数据集上的实验验证了该方法的可行性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Parameter Tuning for S-ABCPK: An Improved Service Composition Algorithm Considering Priori Knowledge
QoS-aware service composition problem has been drawn great attention in recent years. As an NP-hard problem, high time complexity is inevitable if global optimization algorithms (such as integer programming) are adopted. Researchers applied various evolutionary algorithms to decrease the time complexity by looking for a near-optimum solution. However, each evolutionary algorithm has two or more parameters, the values of which are to be assigned by algorithm designers and likely have impacts on the optimization results (primarily time complexity and optimality). The authors' experiments show that there are some dependencies between the features of a service composition problem, the values of an evolutionary algorithm's parameters, and the optimization results. In this article, the authors propose an improved algorithm called Service-Oriented Artificial Bee Colony algorithm considering Priori Knowledge (S-ABCPK) to solve service composition problem and focus on the S-ABCPK's parameter turning issue. The objective is to identify the potential dependency for designers of a service composition algorithm easily setting up the values of S-ABCPK parameters to obtain a preferable composition solution without many times of tedious attempts. Eight features of the service composition problem and the priori knowledge, five S-ABCPK parameters and two metrics of the final solution are identified. Based on a large volume of experiment data, S-ABCPK parameter tuning for a given service composition problem is conducted using C4.5 algorithm and the dependency between problem features and S-ABCPK parameters are established using the neural network method. An experiment on a validation dataset shows the feasibility of the approach.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Web Services Research
International Journal of Web Services Research 工程技术-计算机:软件工程
CiteScore
2.40
自引率
0.00%
发文量
19
审稿时长
>12 weeks
期刊介绍: The International Journal of Web Services Research (IJWSR) is the first refereed, international publication featuring the latest research findings and industry solutions involving all aspects of Web services technology. This journal covers advancements, standards, and practices of Web services, as well as identifies emerging research topics and defines the future of Web services on grid computing, multimedia, and communication. IJWSR provides an open, formal publication for high quality articles developed by theoreticians, educators, developers, researchers, and practitioners for those desiring to stay abreast of challenges in Web services technology.
期刊最新文献
A Quasi-Newton Matrix Factorization-Based Model for Recommendation A Service Recommendation Algorithm Based on Self-Attention Mechanism and DeepFM Secure Cloud Storage and Retrieval of Personal Health Data From Smart Wearable Devices With Privacy-Preserving Techniques User Interaction Within Online Innovation Communities Research on a New Reconstruction Technology and Evaluation Method for 3D Digital Core Pore Structure
×
引用
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