Correlated Topic Model for Web Services Ranking
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2013, Vol 4, Issue 6
Abstract
With the increasing number of published Web services providing similar functionalities, it’s very tedious for a service consumer to make decision to select the appropriate one according to her/his needs. In this paper, we explore several probabilistic topic models: Probabilistic Latent Semantic Analysis (PLSA), Latent Dirichlet Allocation (LDA) and Correlated Topic Model (CTM) to extract latent factors from web service descriptions. In our approach, topic models are used as efficient dimension reduction techniques, which are able to capture semantic relationships between word-topic and topic-service interpreted in terms of probability distributions. To address the limitation of keywords-based queries, we represent web service description as a vector space and we introduce a new approach for discovering and ranking web services using latent factors. In our experiment, we evaluated our Service Discovery and Ranking approach by calculating the precision (P@n) and normalized discounted cumulative gain (NDCGn).
Authors and Affiliations
Mustapha AZNAG, Mohamed QUAFAFOU, Zahi JARIR
Keywords
Related Articles
- EP ID EP87536
- DOI 10.14569/IJACSA.2013.040637
- Views 93
- Downloads 0
A Novel Technique for Glitch and Leakage Power Reduction in CMOS VLSI Circuits
Leakage power has become a serious concern in nanometer CMOS technologies. Dynamic and leakage power both are the main contributors to the total power consumption. In the past, the dynamic power has dominated the total p...
XML Schema-Based Minification for Communication of Security Information and Event Management (SIEM) Systems in Cloud Environments
XML-based communication governs most of today’s systems communication, due to its capability of representing complex structural and hierarchical data. However, XML document structure is considered a huge and bulky data t...
Improved Selfish Node Detection Algorithm for Mobile Ad Hoc Network
Mobile Ad hoc network (MANET) suffers from different security issues. Ideally, not all nodes in MANET cooperate in forwarding packets because of non-malicious intention. This node is called selfish node and it behaves so...
Boosted Decision Trees for Lithiasis Type Identification
Several urologic studies showed that it was important to determine the lithiasis types, in order to limit the recurrence residive risk and the renal function deterioration. The difficult problem posed by urologists for c...
Clustering based Max-Min Scheduling in Cloud Environment
Cloud Computing ensures Service Level Agreement (SLA) by provisioning of resources to cloudlets. This provisioning can be achieved through scheduling algorithms that properly maps given tasks considering different heuris...