A Web service search engine for large-scale Web service discovery based on the probabilistic topic modeling and clustering

被引:24
作者
Bukhari, Afnan [1 ]
Liu, Xumin [2 ]
机构
[1] Taif Univ, Dept Informat Technol, At Taif, Saudi Arabia
[2] Rochester Inst Technol, Dept Comp Sci, Rochester, NY 14623 USA
关键词
Web service; Discovery; Clustering; Topic model; Vector;
D O I
10.1007/s11761-018-0232-6
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
With the ever increasing number of Web services, discovering an appropriate Web service requested by users has become a vital yet challenging task. We need a scalable and efficient search engine to deal with the large volume of Web services. The aim of this approach is to provide an efficient search engine that can retrieve the most relevant Web services in a short time. The proposed Web service search engine (WSSE) is based on the probabilistic topic modeling and clustering techniques that are integrated to support each other by discovering the semantic meaning of Web services and reducing the search space. The latent Dirichlet allocation (LDA) is used to extract topics from Web service descriptions. These topics are used to group similar Web services together. Each Web service description is represented as a topic vector, so the topic model is an efficient technique to reduce the dimensionality of word vectors and to discover the semantic meaning that is hidden in Web service descriptions. Also, the Web service description is represented as a word vector to address the drawbacks of the keyword-based search system. The accuracy of the proposed WSSE is compared with the keyword-based search system. Also, the precision and recall metrics are used to evaluate the performance of the proposed approach and the keyword-based search system. The results show that the proposed WSSE based on LDA and clustering outperforms the keyword-based search system.
引用
收藏
页码:169 / 182
页数:14
相关论文
共 21 条
[1]  
Al-Masri E, 2007, 2007 IEEE INTERNATIONAL CONFERENCE ON WEB SERVICES, PROCEEDINGS, P1104
[2]  
[Anonymous], 2015, MATLAB VERS 8 5 0 19
[3]  
Aznag M., 2013, P 2 EUR C SERV OR CL, P19, DOI DOI 10.1007/978-3-642-40651-5_3
[4]  
Chen L, 2013, LECT NOTES COMPUT SC, V8274, P162, DOI 10.1007/978-3-642-45005-1_12
[5]  
Chen L, 2011, LECT NOTES COMPUT SC, V7084, P204, DOI 10.1007/978-3-642-25535-9_14
[6]   CLUSTER SEPARATION MEASURE [J].
DAVIES, DL ;
BOULDIN, DW .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1979, 1 (02) :224-227
[7]  
Elgazzar Khalid, 2010, 2010 IEEE International Conference on Web Services (ICWS), P147, DOI 10.1109/ICWS.2010.31
[8]   goDiscovery: Web Service Discovery Made Efficient [J].
Elshater, Yehia ;
Elgazzar, Khalid ;
Martin, Patrick .
2015 IEEE INTERNATIONAL CONFERENCE ON WEB SERVICES (ICWS), 2015, :711-716
[9]  
Fensel D, 2008, IMPLEMENTING SEMANTI, P169
[10]  
Griffiths T., 2002, TECHNICAL REPORT