By Topic

Optimal Web service composition method based on an enhanced planning graph and using an immune-inspired algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Pop, C.B. ; Dept. of Comput. Sci., Tech. Univ. of Cluj-Napoca, Cluj-Napoca, Romania ; Chifu, V.R. ; Salomie, I. ; Dinsoreanu, M.

This paper presents a new approach for the automatic composition of semantic Web services based on the AI planning graph technique. In the context of Web service composition we have extended the planning graph with the new concepts of service cluster and semantic similarity link and have adapted and enhanced an immune-inspired algorithm that ranks the composition solutions according to user preferences. The composition algorithm creates a planning graph in a multi-layered process in order to solve the Web service composition request. Within each layer, semantic similarity links between the input parameters of the selected services in the current layer and the output parameters of other services, selected in previous layers, are stored in a matrix of semantic links. The semantic similarity links are calculated by using evaluation measures adapted from information retrieval such as recall, precision and F-measure.

Published in:

Intelligent Computer Communication and Processing, 2009. ICCP 2009. IEEE 5th International Conference on

Date of Conference:

27-29 Aug. 2009