摘要
以用户请求的输出为目标,建立服务组合发现生成树,选择最优服务组合分支来完成服务任务。针对成功的服务事务表采用Apriori算法进行挖掘,发现频繁组合的服务,预先进行组合成为快速、高效、功能更强的原子级服务,提供给用户使用。
Set the output of users'request as the target, establish spanning tree of web service composition during the discovery pro- cess ,then choose the best service composition to complete the task of service. In terms of the successful service table, we take the Apriori algorithm to mine and find the service of frequent itemset, combine it in advance and become fast, efficient and more power- ful atomic-class service in order to serve users.
出处
《微计算机信息》
2009年第21期129-130,152,共3页
Control & Automation