A graph b-coloring based method for composition-oriented web services classification

Authors:
Lyes Dekar;Hamamache Kheddouci
Affiliations:
Université de Lyon, Lyon, France and Laboratoire LIESP, Université Lyon1, Villeurbanne Cedex, France;Université de Lyon, Lyon, France and Laboratoire LIESP, Université Lyon1, Villeurbanne Cedex, France
Venue:
ISMIS'08 Proceedings of the 17th international conference on Foundations of intelligent systems
Year:
2008

Citing 4
Cited 2

The b-chromatic number of a graph

Discrete Applied Mathematics
METEOR-S web service annotation framework with machine learning classification

SWSWPC'04 Proceedings of the First international conference on Semantic Web Services and Web Process Composition
A heuristic approach to semantic web services classification

KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part III
A distributed algorithm for a b-coloring of a graph

ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications

Community structure in interaction web service networks

International Journal of Web Based Communities
On topological structure of web services networks for composition

International Journal of Web Engineering and Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Web services aim to be the key of the Web development in the next years, by enabling the deployment, the sharing and the gathering of functionalities in a more simple and flexible way. The expectable growth of the number of Web services makes the need for automatic organization and discovery of Web services more important. In this paper, we propose a new classification based on Web services composition. The Web services that are often composed, are grouped together dynamically. Then, we give a graph based approach, that uses the b-coloring to partition these Web services into clusters and maintain them.