DocumentCode
2709552
Title
Service Matchmaking and Discovery with Rough Sets
Author
Yu, Bin ; Guo, Wenming ; Li, Maozhen ; Song, Yong-hua ; Hobson, Peter ; Qi, Man
Author_Institution
Electron. & Comput. Eng., Brunel Univ., Uxbridge, UK
fYear
2006
fDate
1-3 Nov. 2006
Firstpage
80
Lastpage
80
Abstract
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.
Keywords
Web services; advertising; grid computing; rough set theory; search engines; service-oriented architecture; Rosse; grid facilities; grid resources; rough set-based search engine; service advertisement matching; service discovery; service matchmaking; service property uncertainty; service requests; service-oriented computing infrastructure; user community;
fLanguage
English
Publisher
ieee
Conference_Titel
Semantics, Knowledge and Grid, 2006. SKG '06. Second International Conference on
Conference_Location
Guilin
Print_ISBN
0-7695-2673-X
Type
conf
DOI
10.1109/SKG.2006.93
Filename
5727717
Link To Document