2014 IEEE International Conference on Web Services (ICWS) (2014)
Anchorage, AK, USA
June 27, 2014 to July 2, 2014
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICWS.2014.76
The increasing amount of web services over the Internet enable users composing them to satisfy the users'needs efficiently. Such service composing is prone to errors. Automatically detecting incompatible web services interaction and correcting them will largely improve users' experience on service composing. When correcting the errors, two major issues need to be addressed: First, how to satisfy diverse correction requirements of different users, Second, how to find the corrections efficiently. This paper proposes an approach to discovering maximum diversity corrections to reduce the risk of unsatisfying different end users' needs when presenting correction plans to them. To solve the problem efficiently, this paper proposes an approximate algorithm to find diverse correction plans. Furthermore, two pruning strategies are adopted to reduce the runtime of the algorithm. Experiments illustrate that our approach outperforms the baseline on the diversity of correction plans, and the two pruning strategies reduce the runtime significantly.
Web services, Business, Approximation algorithms, Runtime, Protocols, Optimization, Clustering algorithms
S. Gong, J. Xiong, Z. Liu and M. Wojciechowski, "Discovering Diversity Corrections for Incompatible Web Services," 2014 IEEE International Conference on Web Services (ICWS), Anchorage, AK, USA, 2014, pp. 495-502.