Recent Advancements in Semantic Web Service Selection

References

• Y. Xia, P. Chen, L. Bao, M. Wang, and J. Yang, “A QoS-aware web service selection algorithm based on clustering,” in 2011 IEEE Int. Conf. on Web Services, 2011, pp. 428–435.
   Google Scholar
• R. Karthiban, “A QoS-aware web service selection based on clustering,” Int. J. Sci. Res. Publ. (IJSRP), Vol. 4, no. 2, pp. 1–5, 2014.
   Google Scholar
• L. Purohit, and S. Kumar, “Clustering based approach for web service selection using skyline computations,” in 2019 IEEE Int. Conf. on Web Services (ICWS), Milan, Italy, 2019, pp. 260–264., DOI:10.1109/ICWS.2019.00052.
   Google Scholar
• K. R. Kalantari, A. Ebrahimnejad, and H. Motameni. Efficient improved ant colony optimisation algorithm for dynamic software rejuvenation in web services “, Vol. 14, no. 4, pp. 369–76.
   Google Scholar
• K. Kalantari, A. Ebrahimnejad, and H. Motameni, “Dynamic software rejuvenation in web services: a whale optimization algorithm-based approach,” Turkish Journal of Electrical Engineering & Computer Sciences, Vol. 28, pp. 890–903, 2020. DOI:10.3906/elk-1905-177.
   Web of Science ®Google Scholar
• K. Kalantari, A. Ebrahimnejad, and H. Motameni, “A fuzzy neural network for web service selection aimed at dynamic software rejuvenation,” Turkish Journal of Electrical Engineering & Computer Sciences, Vol. 28, pp. 2718–2734, 2020. DOI:10.3906/elk-2001-33.
   Web of Science ®Google Scholar
• K. Rezaei Kalantari, A. Ebrahimnejad, and H. Motameni, “Presenting a new fuzzy system for web service selection aimed at dynamic software rejuvenation,” Complex Intell. Syst, Vol. 6, pp. 697–710, 2020. DOI:10.1007/s40747-020-00168-x
   Web of Science ®Google Scholar
• Q. Gao, “Similarity matching algorithm for ontology-based semantic Information Retrieval model,” in Proceedings of the 10th World Congress on Intelligent Control and Automation, 2012, pp. 758–763. DOI:10.1109/WCICA.2012.6357979.
   Google Scholar
• D. Sánchez, M. Batet, D. Isern, and A. Valls, “Ontology-based semantic similarity: a new feature-based approach,” Expert Systems with Applications, Vol. 39, no. 9, pp. 7718–7728, 2012.
   Web of Science ®Google Scholar
• F. Liu, F. Xiao, Y. Lin, and Y. Zhang, “An intuitionistic fuzzy set model for concept Similarity Using ontological relations,” in 2012 IEEE Asia-Pacific Services Computing Conference, Guilin, 2012, pp. 319–324., DOI:10.1109/APSCC.2012.27.
   Google Scholar
• Y. Zhang, A. Panangadan, and V. K. Prasanna, “UFOM: unified fuzzy ontology matching,” in IEEE 15th Int. Conf. on Information Reuse and Integration, Redwood City, CA, 2014, pp. 787–794. DOI:10.1109/IRI.2014.7051969.
   Google Scholar
• G. Kousiouris, et al., “A microservice-based framework for integrating IoT management platforms, semantic and AI services for supply chain management,” ICT Express, Vol. 5, no. 2, pp. 141–145, 2019. ISSN 2405-9595, DOI:10.1016/j.icte.2019.04.002.
   Web of Science ®Google Scholar
• H. Rahman, and M. I. Hussain, “A light-weight dynamic ontology for internet of things using machine learning technique,” ICT Express, Vol. 7, no. 3, pp. 355–360, 2020. DOI:10.1016/j.icte.2020.12.002.
   Web of Science ®Google Scholar
• H. Yahyaoui, M. Almulla, and E. Boujarwah, “Measuring semantic similarity between services using hypergraphs,” in 23rd ACM Int. Conference on Information Integration and Web Intelligence, Nov. 2021, pp. 205–211.
   Google Scholar
• V. Traneva, S. Tranev, and V. Atanassova, “An intuitionistic fuzzy approach to the Hungarian algorithm,” in Numerical Methods and Applications. NMA 2018. Lecture Notes in Computer Science, 11189, G. Nikolov, N. Kolkovska, and K Georgiev, Eds. Springer, Cham, 2019, pp. 167–175. DOI:10.1007/978-3-030-10692-8_19.
   Google Scholar
• S. Dias, S. Kolhe, R. Shinde, R. Chaudhari, and R. Wahul. Query Time Optimization Using Hungarian Algorithm, Vol. 570, pp. 271–276, 2020. DOI:10.1007/978-981-13-8715-932.
   Google Scholar
• P. M. Taher, and R. Navigli, “From senses to texts: An All-in-one graph-based approach for measuring semantic similarity,” Artif. Intell., Vol. 228, pp. 95–128, 2015. DOI:10.1016/j.artint.2015.07.005.
   Web of Science ®Google Scholar
• B. Natarajan, M. S. Obaidat, B. Sadoun, R. Manoharan, S. Ramachandran, and N. Velusamy, “New clustering-based semantic service selection and user preferential model,” IEEE Systems Journal, Vol. 15, no. 4, pp. 4980–4988, 2021. DOI:10.1109/JSYST.2020.3025407.
   Web of Science ®Google Scholar
• I. Traverso, M. Vidal, B. Kämpgen, and Y. Vetter, “GADES: A graph-based semantic similarity measure.,” in In 12th Int. Conf. on Semantic Systems (SEMANTiCS 2016). Association for Computing Machinery, NY, USA, 2016. PP. 101–104, 2016. DOI:10.1145/2993318.2993343
   Google Scholar
• C. Paul, A. Rettinger, A. Mogadala, C. A. Knoblock, and P. Szekely. Efficient Graph-Based Document Similarity, 2016.
   Google Scholar
• H. Sack, E. Blomqvist, M. d’Aquin, C. Ghidini, S. Ponzetto, and C. Lange. The Semantic Web. Latest Advances and New Domains. ESWC 2016. LNCS, vol 9678. Springer, Cham. DOI:10.1007/978-3-319-34129-3_21.
   Google Scholar
• H. Zhu, D. Liu, S. Zhang, Y. Zhu, L. Teng, and S. Teng, “Solving the many to many assignment problem by improving the Kuhn–Munkres algorithm with backtracking,” Theor. Comput. Sci., Vol. 618, pp. 30–41, 2016. ISSN 0304-3975, DOI:10.1016/j.tcs.2016.01.002.
   Web of Science ®Google Scholar
• T. H. Cormen, C. E. Leiserson, R. L. Rivest, and Stein. Introduction to Algorithms. 3rd. London: MIT Press and McGraw-Hill Book Company, 2009.
   Google Scholar
• M. Enayattabr, A. Ebrahimnejad, and H. Motameni. An Acceptability Index Based Approach for Solving Shortest Path Problem on a Network with Interval Weights. France: RAIRO – Operations Research, 2020, 55. DOI:10.1051/ro/2020033.
   Google Scholar
• A. A. Sori, A. Ebrahimnejad, H. Motameni, and J. L. Verdegay, “Fuzzy constrained shortest path problem for location-based online services,” Int. J. Uncertain. Fuzziness Knowl.-Based Syst., Vol. 29, no. 2, pp. 231–248, 2021. DOI:10.1142/S0218488521500116.
   Google Scholar