基于可组合关联模型的web服务分类算法  

Web services classification algorithm based on composable relevance model

作　　者：雷万保[1] 朱怡安[1] 孙占志[1] 钟冬[1] 

机构地区：[1]西北工业大学计算机学院,陕西西安710129

出　　处：《华中科技大学学报（自然科学版）》2010年第8期57-60,共4页Journal of Huazhong University of Science and Technology(Natural Science Edition)

基　　金：国家自然科学基金资助项目(60573101)

摘　　要：在充分分析web服务之间可组合关联模型的前提下,将服务集分解成若干可组合相关的服务子集,进而在不影响服务组合结果和质量的基础上,有效地减少了无效服务组合分析次数,提高了服务组合算法效率.该算法完全透明于具体的服务组合算法且可离线工作.最后,借助实验对算法进行必要性和有效性分析,证明该算法能够显著地提高服务组合效率.The composable relevance models among web services were analyzed deeply. Web services set was classified into some composable subsets, which effectively reduce the invalid analysis times of web services and improve the efficiency of web services composition algorithm on the base of having no effect on the result and quality of web services composition. This algorithm is fully transparent to spe- cial web services composition and support off-line working mechanism. Finally, by virtue of some pointed experiments of the validity and necessity analysis, it is proven that this algorithm can effectively improve the efficiency of Web services composition.

关 键 词：WEB服务 面向服务的架构 服务分类 服务组合 关联模型 

分 类 号：TP313[自动化与计算机技术—计算机软件与理论]