基于遗传算法的Web服务发现优化选择模型研究

Xiao Jun
{"title":"基于遗传算法的Web服务发现优化选择模型研究","authors":"Xiao Jun","doi":"10.1109/ICACTE.2010.5579698","DOIUrl":null,"url":null,"abstract":"Traditional Web services, which are mainly technical specifications based on UDDI, provide service discovery by simple classification and key word matching, resulting in low precision ratio and recall ratio as well as low compatibility of service multiplexing and service composition. This paper, basing on Web service models and in combination with genetic algorithm, brings forward a multi-target optimization selection model based on similarity, QoS, matching degree, rating and feasibility of Web services, and provides an effective method for Web service discovery.","PeriodicalId":255806,"journal":{"name":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Study on optimization selection model of Web service discovery based on genetic algorithm\",\"authors\":\"Xiao Jun\",\"doi\":\"10.1109/ICACTE.2010.5579698\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Traditional Web services, which are mainly technical specifications based on UDDI, provide service discovery by simple classification and key word matching, resulting in low precision ratio and recall ratio as well as low compatibility of service multiplexing and service composition. This paper, basing on Web service models and in combination with genetic algorithm, brings forward a multi-target optimization selection model based on similarity, QoS, matching degree, rating and feasibility of Web services, and provides an effective method for Web service discovery.\",\"PeriodicalId\":255806,\"journal\":{\"name\":\"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-09-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICACTE.2010.5579698\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACTE.2010.5579698","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

传统的Web服务主要是基于UDDI的技术规范,通过简单的分类和关键词匹配来提供服务发现,导致服务的正确率和查全率较低,服务复用和服务组合的兼容性较差。本文以Web服务模型为基础,结合遗传算法,提出了基于Web服务的相似度、QoS、匹配度、评级和可行性的多目标优化选择模型,为Web服务发现提供了一种有效的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Study on optimization selection model of Web service discovery based on genetic algorithm
Traditional Web services, which are mainly technical specifications based on UDDI, provide service discovery by simple classification and key word matching, resulting in low precision ratio and recall ratio as well as low compatibility of service multiplexing and service composition. This paper, basing on Web service models and in combination with genetic algorithm, brings forward a multi-target optimization selection model based on similarity, QoS, matching degree, rating and feasibility of Web services, and provides an effective method for Web service discovery.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信