Enriching Web Services Tags to Improve Data-Driven Web Services Composition

Keywords: Service composition, clustering, enrichment tag, data-driven, web service, WSDL

Abstract

Due to the large number of existing services and complexity of manual composition, automatic service composition is provided to enable automatic search of the service compositions for the given queries. Many solutions for automatic service composition have been developed, including integer programming, graph planning, artificial intelligence, and so on in this paper, a heuristic method is proposed to improve the data-driven composition of web services by enriching tags based on tags semantic. To do so, firstly, useful information on web services is collected from various sources and is turned into collections of tags. In the next step, using the hierarchical clustering algorithm, the tags are clustered based on semantic similarity. Thereafter, for services which do not have enough tags, enrichment of the tag is carried out and finally, using an algorithm, composition solutions based on QoS parameters are extracted, which can formulate user targets or even provide potential compositions. Moreover, a series of tests were conducted on the web services, which validate the efficiency of the proposed approach. The experimental results confirm the effectiveness of the proposed service composition method and high quality of tag enriching strategies.

  

Downloads

Download data is not yet available.

Author Biographies

Nahid Dara, Diabetes Research Center, Shahid Sadoughi University of Medical Sciences, Yazd, Iran; Department of Computer Engineering, Yazd Branch, Islamic Azad University, Yazd, Iran

Nahid Dara is a master of science in software engineering. She received the B.S degree from Yazd university in 2006 and M.S degree from Islamic Azad University of Yazd in 2016. She is a software engineer in Yazd Diabetes research Center, Shahid Sadoughi University of medical sciences from 2007. Her research interests include software engineering and data mining and database.

Sima Emadi, Department of Computer Engineering, Yazd Branch, Islamic Azad University, Yazd, Iran

Sima Emadi is an Assistant Professor and Director of Computer postgraduate at Computer Engineering Department, Islamic Azad University, Yazd Branch. He received the B.Eng. degree from Islamic Azad University, Iran, in 1995 and the M.S. degree from Islamic Azad University, Iran, in 1997, both in Computer Software engineering. In 2008 she completed the Ph.D. program at Islamic Azad University, Science and Research Branch, Iran. Her current research interests include services computing Software, Web service Composition, Service Driven Architecture, Software Testing and Design Pattern.

References

Q.Z. Sheng, et al., ‘Web services composition: A decade’s overview’. Information Sciences, 280:218-238, 2014.

G. Zou, et al., ‘Dynamic composition of Web services using efficient planners in large-scale service repository’. Knowledge-Based Systems, 62:98-112, 2014.

X. Liu, et al., ‘Data-driven composition for service-oriented situational web applications’. IEEE Transactions on Services Computing, 8(1):2-16, 2015.

L. Fang, et al. ‘Towards automatic tagging for web services’. in Web Services (ICWS), 2012 IEEE 19th International Conference on. IEEE, 2012.

J. Wu, et al., ‘Clustering web services to facilitate service discovery’. Knowledge and information systems, 38(1):207-229, 2014.

M. Lin and D.W. Cheung. ‘Automatic tagging web services using machine learning techniques’. in Web Intelligence (WI) and Intelligent Agent Technologies (IAT), 2014 IEEE/WIC/ACM International Joint Conferences on. IEEE, 2014.

S. Song and S.-W. Lee, ‘A goal-driven approach for adaptive service composition using planning’. Mathematical and Computer Modelling, 58(1):261-273, 2013.

W. Tan, et al., ‘Data-driven service composition in enterprise SOA solutions: A Petri net approach’. IEEE Transactions on Automation Science and Engineering, 7(3):686-694, 2010.

S.-P. Ma, et al. ‘Real-world RESTful service composition: a transformation-annotation-discovery approach’. in 2017 IEEE 10th Conference on Service-Oriented Computing and Applications (SOCA). IEEE, 2017.

A. De Renzis, et al., ‘Case-based reasoning for web service discovery and selection’. Electronic Notes in Theoretical Computer Science, 321:89-112, 2016.

S. Deng, et al., ‘Top-${rm k} $ Automatic Service Composition: A Parallel Method for Large-Scale Service Sets’. IEEE Transactions on Automation Science and Engineering, 11(3):891-905, 2014.

X. Liu, et al. ‘Composing data-driven service mashups with tag-based semantic annotations’. in Web Services (ICWS), 2011 IEEE International Conference on. IEEE, 2011.

E. Bouillet, et al. ‘A tag-based approach for the design and composition of information processing applications’. in ACM Sigplan Notices. ACM, 2008.

D. Wang, Y. Yang, and Z. Mi, ‘A genetic-based approach to web service composition in geo-distributed cloud environment’. Computers & Electrical Engineering, 43:129-141, 2015.

Y.-Y. FanJiang and Y. Syu, ‘Semantic-based automatic service composition with functional and non-functional requirements in design time: A genetic algorithm approach’. Information and Software Technology, 56(3):352-373, 2014.

Z. Gao, et al., ‘Discovery and Analysis About the Evolution of Service Composition Patterns’. Journal of Web Engineering, 18(7):579-626, 2019.

C. Vairetti R. Alarcon and J. Bellido, ‘A semantic approach for dynamically determining complex composed service behaviour’. Journal of Web Engineering, 15(3&4):310-338, 2016.

M. Shi, et al., ‘A topic-sensitive method for mashup tag recommendation utilizing multi-relational service data’. IEEE Transactions on Services Computing, 2018.

G.M. Kapitsaki, ‘Creating and utilizing section-level Web service tags in service replaceability’. Service Oriented Computing and Applications, 11(3):285-299, 2017.

M. Shi, et al. ‘A probabilistic topic model for mashup tag recommendation’. in 2016 IEEE International Conference on Web Services (ICWS). IEEE, 2016.

Z. Azmeh, et al. ‘Automatic Web Service Tagging Using Machine Learning and WordNet Synsets’. in WEBIST (Selected Papers). Springer, 2010.

J.-R. Falleri, et al. ‘Automatic tag identification in web service descriptions’. in WEBIST'10: The International Conference on Web Information Systems and Technology. 2010.

L. Chen, et al. ‘Wtcluster: Utilizing tags for web services clustering’. in International Conference on Service-Oriented Computing. Springer, 2011.

K. Zheng, et al. ‘User clustering-based web service discovery’. in Internet Computing for Science and Engineering (ICICSE), 2012 Sixth International Conference on. IEEE, 2012.

Z. Zhu, et al. ‘WS-SCAN: A effective approach for web services clustering’. in Computer Application and System Modeling (ICCASM), 2010 International Conference on. IEEE, 2010.

C.B. Pop, et al. ‘Semantic Web Service Clustering for Efficient Discovery Using an Ant-Based Method’. in IDC. Springer, 2010.

N. Gholamzadeh and F. Taghiyareh. ‘Ontology-based fuzzy web services clustering’. in Telecommunications (IST), 2010 5th International Symposium on. IEEE, 2010.

D.K.V. Nandini N, ‘Facilitating the Service Discovery for the Cluster of Web Services using Hybrid WSTRec’. International Journal of Advanced Research in Computer Science and Software Engineering, 5(2):5, 2015.

M. SHI J. LIU D. Zhou, ‘A hybrid approach for automatic mashup tag recommendation’. J Web Eng, 16(7&8):676-692, 2017.

E. Bouillet, et al. ‘A faceted requirements-driven approach to service design and composition’. in Web Services, 2008. ICWS'08. IEEE International Conference on. IEEE, 2008.

A. Ranganathan, A. Riabov, and O. Udrea. ‘Mashup-based information retrieval for domain experts’. in Proceedings of the 18th ACM conference on Information and knowledge management. ACM, 2009.

A.V. Riabov, et al. ‘Wishful search: interactive composition of data mashups’. in Proceedings of the 17th international conference on World Wide Web. ACM, 2008.

A. Bouguettaya, et al., ‘Efficient agglomerative hierarchical clustering’. Expert Systems with Applications, 42(5):2785-2797, 2015.

Z. Su, et al. ‘Plagiarism detection using the Levenshtein distance and Smith-Waterman algorithm’. in Innovative Computing Information and Control, 2008. ICICIC'08. 3rd International Conference on. IEEE, 2008.

R.L. Cilibrasi and P.M. Vitanyi, ‘The google similarity distance’. IEEE Transactions on knowledge and data engineering, 19(3), 2007.

A.K. Jain and R.C. Dubes, Algorithms for clustering data. Prentice-Hall, Inc., 1988.

S. Niwattanakul, et al. ‘Using of Jaccard coefficient for keywords similarity’. in Proceedings of the international multiconference of engineers and computer scientists. 2013.

Published
2021-03-16
Section
Articles