TY - GEN
T1 - WS-Rec
T2 - 2013 IEEE 14th International Conference on Information Reuse and Integration, IEEE IRI 2013
AU - Squicciarini, Anna Cinzia
AU - Carminati, Barbara
AU - Karumanchi, Sushama
PY - 2013
Y1 - 2013
N2 - Web service selection involves finding services from a possibly large database of similar services. The challenges involved in finding a suitable service include large time consumption, and difficulty of finding a perfect match according to the user specified search keywords. For instance, users may have privacy and security concerns, as the information involved with service selection and provisioning may be sensitive for both providers and users. In this paper, we define an approach to provide customized recommendation of composite services according to a variety of user-specified criteria, including classic quality of service as well as complex privacy and security dimensions. We conduct an extensive experimental evaluation, using datasets of actual WSDL documents and comparing our algorithms with state-of-the-art solutions. Our experimental evaluation demonstrates that our algorithms are both effective and efficient.
AB - Web service selection involves finding services from a possibly large database of similar services. The challenges involved in finding a suitable service include large time consumption, and difficulty of finding a perfect match according to the user specified search keywords. For instance, users may have privacy and security concerns, as the information involved with service selection and provisioning may be sensitive for both providers and users. In this paper, we define an approach to provide customized recommendation of composite services according to a variety of user-specified criteria, including classic quality of service as well as complex privacy and security dimensions. We conduct an extensive experimental evaluation, using datasets of actual WSDL documents and comparing our algorithms with state-of-the-art solutions. Our experimental evaluation demonstrates that our algorithms are both effective and efficient.
UR - http://www.scopus.com/inward/record.url?scp=84891089823&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84891089823&partnerID=8YFLogxK
U2 - 10.1109/IRI.2013.6642452
DO - 10.1109/IRI.2013.6642452
M3 - Conference contribution
AN - SCOPUS:84891089823
SN - 9781479910502
T3 - Proceedings of the 2013 IEEE 14th International Conference on Information Reuse and Integration, IEEE IRI 2013
SP - 46
EP - 53
BT - Proceedings of the 2013 IEEE 14th International Conference on Information Reuse and Integration, IEEE IRI 2013
PB - IEEE Computer Society
Y2 - 14 August 2013 through 16 August 2013
ER -