loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Second International Conference on Semantics, Knowledge, and Grid (SKG'06)
Service Matchmaking and Discovery with Rough Sets
Guilin, Guangxi, China
November 01-November 03
ISBN: 0-7695-2673-X
Bin Yu, Brunel University, UK
Wenming Guo, Beijing University of Posts and Telecommunications, China
Maozhen Li, Brunel University, UK
Yong-Hua Song, Brunel University, UK
Peter Hobson, Brunel University, UK
Man Qi, Canterbury Christ Church University, China
The past few years have seen the Grid is evolving as a service-oriented computing infrastructure. It is foreseen that various resources in a Grid environment will be exposed as services for use by a wider user community. Service discovery becomes an issue of vital importance for utilising Grid facilities. This paper presents Rosse, a Rough Sets based Search Engine for service discovery that can deal with uncertainty of service properties when matching service advertisements with service requests. The evaluation results show that Rosse is more effective in service discovery compared with other mechanisms such as UDDI keyword matching and OWL-S matchmaking.
Citation:
Bin Yu, Wenming Guo, Maozhen Li, Yong-Hua Song, Peter Hobson, Man Qi, "Service Matchmaking and Discovery with Rough Sets," skg, pp.80, Second International Conference on Semantics, Knowledge, and Grid (SKG'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.