By Topic

A Probabilistic Latent Factor approach to service ranking

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
$33 $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

3 Author(s)
Cassar, G. ; Centre for Commun. Syst. Res., Univ. of Surrey, Guildford, UK ; Barnaghi, P. ; Moessner, K.

In this paper we investigate the use of probabilistic machine-learning techniques to extract latent factors from semantically enriched service descriptions. The latent factors provide a model to represent service descriptions of any type in vector form. With this conversion, heterogeneous service descriptions can be represented on the same homogeneous plane thus achieving interoperability between different service description technologies. Automated service discovery and ranking is achieved by extracting latent factors from queries and representing the queries in vector form. Vector algebra can then be used to match services to the query. This approach is scalable to large service repositories and provides an efficient mechanism for publishing new services after the system is deployed.

Published in:

Intelligent Computer Communication and Processing (ICCP), 2011 IEEE International Conference on

Date of Conference:

25-27 Aug. 2011