System Maintenance:
There may be intermittent impact on performance while updates are in progress. We apologize for the inconvenience.
By Topic

PASS: An Approach to Personalized Automated Service Composition

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

5 Author(s)
Yang Li ; State Key Lab. of Software Dev. Environ., Beihang Univ., Beijing ; Jinpeng Huai ; Hailong Sun ; Ting Deng
more authors

With the rapid development of SOC (Service oriented computing), the automated service composition has become an important research direction. Through automated service composition, business processes need not to be constructed in advance, which helps to improve the flexibility of service composition. The current research on automated service composition is mainly based on AI techniques, and a common domain-oriented knowledge base is usually required to perform the heuristic planning. In practice, it is impossible for the knowledge base to characterize the personalized requirements of different users, so the AI-based methods can not apply to the user-centric application scenarios. In this paper, we propose PASS, a novel approach to personalized automated service composition. With PASS, both the hard-constraints represented by user's initial state, and the soft-constraints represented by user preferences can be satisfied in the process of automated service composition. Furthermore, three algorithms are designed to implement preference-aware automated service composition. In these algorithms, the Pareto dominance principle and relaxation degree are used to select the most satisfied composite service for users. Finally, comprehensive simulations are conducted to evaluate the performance and effectiveness of the proposed algorithms.

Published in:

Services Computing, 2008. SCC '08. IEEE International Conference on  (Volume:1 )

Date of Conference:

7-11 July 2008