Bayesian network based services recommendation

Wu, Jian; Liang, Qianhui; Jian, Hengyi

doi:10.1109/apscc.2009.5394105

Cited by 2 publications

(1 citation statement)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Specially, we replace one or more atomic services in original sequence S 0 to generate the set of candidate service sequences, as Figure 1 shows. This is the Service Recommendation Algorithm based on Bayes Approach (BSR) which we have described in our previous work (Wu, Liang, & Jian, 2009). Before introducing the algorithm of BSR, we'd like to give a definition of Service Sequence Edit Distance first.…”

Section: Bsr Algorithmmentioning

confidence: 99%

Composite Service Recommendation Based on Bayes Theorem

Chen

et al. 2012

International Journal of Web Services Research

View full text Add to dashboard Cite

The number of web services increased exponentially in the past decade. Identifying a set of best candidates from vast services is the first step of composite service recommendation. Much of the previous work focused on the accuracy and efficiency in service matchmaking and optimization. Little attention was paid to the logs of web service execution, which contain diverse information such as service functionality, QoS record, execution order, etc. In this paper, we present how we apply Bayesian approach in analyzing service execution logs and then recommend an optimized service sequence based on the original service sequence. Compared with the existing methods, the approach has two main advantages: first, the resulting service sequences are more robust and compatible; second, the result has higher (both explicit and implicit) quality. The authors also propose three algorithms that are based on the recommendation approach. At the end, the authors show the experiment results to illustrate how this work helps facilitate composite service recommendation.

show abstract

Section: Bsr Algorithmmentioning

confidence: 99%