By Topic

Application of an improved Hungarian algorithm in semantic WEB service discovery

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)
Ning Zhou ; Inst. of Command Autom., PLA Univ. of Sci. & Technol., Nanjing ; ZiLin Song ; WeiHua Ai ; Liming Zhou

The important step towards Web service implement is the discovery of required services. Traditional Web service uses UDDI, WSDL standards etc. Keywords based searching is used in the traditional service discovery. For needing manual intervention and lack of semantic description, the methods before have low precision rate. Semantic Web service problem can be reduced to an assignment problem. A mathematical model is achieved to account for the assignment problem. Similarity matrix is formed based on service request interface parameters and service advertisement interface parameters. The improved Hungarian algorithm is described to find the answer of mathematical model and discover the optimum service by searching for feasible matching plan. Meanwhile an algorithmic instance is given to illustrate the improved Hungarian algorithm could help requester find out the right request service. The test indicates that this algorithm increases the precision ratio and the recall ratio of Web service.

Published in:

Intelligent Control and Automation, 2008. WCICA 2008. 7th World Congress on

Date of Conference:

25-27 June 2008