Automated Web Service Discovery and Computing from Public Repositories through Probabilistic Matchmaking

International Journal of Electronics and Communication Engineering

© 2025 by SSRG - IJECE Journal

Volume 12 Issue 5

Year of Publication : 2025

Authors : Gajanan V. Bhole, Sudhir Kadam, Meena Chavan, A Y prabhakar, Atul Ashok Kadam, Pramod Jadhav

10.14445/23488549/IJECE-V12I5P111

How to Cite?

Gajanan V. Bhole, Sudhir Kadam, Meena Chavan, A Y prabhakar, Atul Ashok Kadam, Pramod Jadhav, "Automated Web Service Discovery and Computing from Public Repositories through Probabilistic Matchmaking," SSRG International Journal of Electronics and Communication Engineering, vol. 12,  no. 5, pp. 126-134, 2025. Crossref, https://doi.org/10.14445/23488549/IJECE-V12I5P111

Abstract:

To develop an efficient and comprehensive approach to web service discovery and retrieving APIs from vast repositories based on user queries and requirements and ranking the results based on relevance. The strategy incorporates numerous techniques like semantic search, graph-based ranking, and relevance scoring. The module applies semantic expansion on user queries the moment they are received through Word Net to improve query representation. The next step is to vectorize the expanded query through TF-IDF, which facilitates semantic similarity computation with the web services available. The semantic similarity scores are then studied with the help of a graph where the edges are semantic similarity scores, and the nodes represent web services. Importance scores are then given to each web service on this graph with the help of PageRank, helping us understand the relevance of the web services. Not just this, the Okapi BM25 algorithm is also applied to compute the relevance score. The final ranking of the web service is given based on integrated scores of Okapi BM25 and PageRank. This ranked list is finally presented to the user. With the help of The module and the approach it follows, users can navigate through vast repositories full of APIs to find the most relevant API for their use. Through the approach we follow, web service discovery and ranking become easier, even for people without a lot of experience. Hence, it offers a strong and effective solution to web service discovery and can be applied in multiple domains.

Keywords:

Web, Computing, UWSDRA, Accuracy, Efficiency, Scalability.

References:

[1] Mohammed Merzoug et al., “Effective Service Discovery Based on Pertinence Probabilities Learning,” International Journal of Advanced Computer Science and Applications, vol. 12, no. 9, pp. 799-808, 2021.
[CrossRef] [Google Scholar] [Publisher Link]
[2] Chune Li et al., “A Probabilistic Approach for Web Service Discovery,” 2013 IEEE International Conference on Services Computing, Santa Clara, CA, USA, pp. 49-56, 2013.
[CrossRef] [Google Scholar] [Publisher Link]
[3] Ulrich Küster et al., “DIANE: A Matchmaking-Centered Framework for Automated Service Discovery, Composition, Binding, and Invocation on the Web,” International Journal of Electronic Commerce, vol. 12, no. 2, pp. 41-68, 2007.
[CrossRef] [Google Scholar] [Publisher Link]
[4] Asma Adala, Nabil Tabbane, and Sami Tabbane, “A Software Framework for Automatic Web Service Discovery Based on a Hybrid Matchmaker,” Global Information Infrastructure Symposium - GIIS 2013, Trento, Italy, pp. 1-3, 2013.
[CrossRef] [Google Scholar] [Publisher Link]
[5] Min Liu et al., “An Weighted Ontology-Based Semantic Similarity Algorithm for Web Service,” Expert Systems with Applications, vol. 36, no. 10, pp. 12480-12490, 2009.
[CrossRef] [Google Scholar] [Publisher Link]
[6] Yuan Yuan, Yegang Du, and Jun Pan, “An Intelligent Web Service Discovery Framework Based on Improved Biterm Topic Model,” IEEE Access, vol. 12, pp. 144437-144455, 2024.
[CrossRef] [Google Scholar] [Publisher Link]
[7] Gilbert Cassar, Payam Barnaghi, and Klaus Moessner, “Probabilistic Matchmaking Methods for Automated Service Discovery,” IEEE Transactions on Services Computing, vol. 7, no. 4, pp. 654-666, 2014.
[CrossRef] [Google Scholar] [Publisher Link]
[8] Ghaidaa A. Al-Sultany, “Enhancing Recommendation System Using Adapted Personalized PageRank Algorithm,” 2022 5th International Conference on Engineering Technology and its Applications, Al-Najaf, Iraq, pp. 1-5, 2022.
[CrossRef] [Google Scholar] [Publisher Link]
[9] Sairam Haribabu et al., “A Novel Approach for Ontology Focused Inter- Domain Personalized Search Based on Semantic Set Expansion,” 2019 Fifteenth International Conference on Information Processing, Bengaluru, India, pp. 1-5, 2019.
[CrossRef] [Google Scholar] [Publisher Link]
[10] Dan Wang et al., “A Ranking-Based Space Search Algorithm with Control Parameters,” 2017 8th IEEE International Conference on Software Engineering and Service Science, Beijing, China, pp. 692-695, 2017.
[CrossRef] [Google Scholar] [Publisher Link]
[11] Yeqing Li, “Research and Analysis of Semantic Search Technology Based on Knowledge Graph,” 2017 IEEE International Conference on Computational Science and Engineering (CSE) and IEEE International Conference on Embedded and Ubiquitous Computing (EUC), Guangzhou, China, pp. 887-890, 2017.
[CrossRef] [Google Scholar] [Publisher Link]
[12] Masaya Murata et al., “BM25 with Exponential IDF for Instance Search,” IEEE Transactions on Multimedia, vol. 16, no. 6, pp. 1690-1699, 2014.
[CrossRef] [Google Scholar] [Publisher Link]
[13] Fraihat Salam, “New Semantic Indexing and Search System Based on Ontology,” 2013 Fourth International Conference on Emerging Intelligent Data and Web Technologies, Xi'an, China, pp. 313-318, 2013.
[CrossRef] [Google Scholar] [Publisher Link]
[14] Timothy H. Chung, and Joel W. Burdick, “Analysis of Search Decision Making Using Probabilistic Search Strategies,” IEEE Transactions on Robotics, vol. 28, no. 1, pp. 132-144, 2011.
[CrossRef] [Google Scholar] [Publisher Link]
[15] Wenge Rong, and Kecheng Liu, “A Survey of Context Aware Web Service Discovery: from User's Perspective,” 2010 Fifth IEEE International Symposium on Service Oriented System Engineering, Nanjing, China, pp. 15-22, 2010.
[CrossRef] [Google Scholar] [Publisher Link]
[16] Guo Wen-yue, Qu Hai-Cheng, and Chen Hong, “Semantic Web Service Discovery Algorithm and its Application on the Intelligent Automotive Manufacturing System,” 2010 2nd IEEE International Conference on Information Management and Engineering, Chengdu, China, pp. 601-604, 2010.
[CrossRef] [Google Scholar] [Publisher Link]
[17] T. Rajendran, and P. Balasubramanie, “An Optimal Agent-Based Architecture for Dynamic Web Service Discovery with QoS,” 2010 Second International Conference on Computing, Communication and Networking Technologies, Karur, India, pp. 1-7, 2010.
[CrossRef] [Google Scholar] [Publisher Link]
[18] Bo Zhou et al., “Using Inverted Indexing to Semantic WEB Service Discovery Search Model,” 2009 5th International Conference on Wireless Communications, Networking and Mobile Computing, Beijing, China, pp. 1-4, 2009.
[CrossRef] [Google Scholar] [Publisher Link]
[19] Jiangang Ma, Jinli Cao, and Yanchun Zhang, “A Probabilistic Semantic Approach for Discovering Web Services,” Proceedings of the 16th International Conference on World Wide Web, Banff Alberta Canada, pp. 1221-1222, 2007.
[CrossRef] [Google Scholar] [Publisher Link]