Name
Abstract | ||
|---|---|---|
Nowadays, how to efficiently compose web services has become a hotspot. In this paper, we introduce a method of recommending an optimal service sequence based on the original service sequence for a composite service. This method uses a Bayesian-based approach and selects the service sequence that has the largest probability as the best choice. Compared with existing methods, this method has two advantages: firstly, service sequences recommended by this method are robust; secondly, this method produces a composite service with a high quality and it does this efficiently. We have conducted experiments to illustrate how our work helps facilitate web service composition. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/APSCC.2009.5394105 | APSCC |
Keywords | Field | DocType |
web service,probability density function,bayesian network,web services,probability,data mining,quality of service,bayesian methods,algorithm design and analysis | Data mining,Algorithm design,Web service composition,Computer science,Quality of service,Bayesian network,Web service,Hotspot (Wi-Fi),Bayesian probability | Conference |
Volume | Issue | ISSN |
null | null | null |
ISBN | Citations | PageRank |
978-1-4244-5336-8 | 1 | 0.36 |
References | Authors | |
5 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jian Wu | 1 | 933 | 95.62 |
| Qianhui Liang | 2 | 275 | 20.24 |
| Hengyi Jian | 3 | 21 | 1.79 |