{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:24:30Z","timestamp":1767338670959,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":11,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819944019"},{"type":"electronic","value":"9789819944026"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-981-99-4402-6_27","type":"book-chapter","created":{"date-parts":[[2023,7,26]],"date-time":"2023-07-26T23:02:45Z","timestamp":1690412565000},"page":"373-379","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Composite Service Selection Approach Based on\u00a0Functionality Folding and\u00a0Reinforcement Learning"],"prefix":"10.1007","author":[{"given":"Weijie","family":"Chu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yun","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YiFeng","family":"Xiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tong","family":"Mo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weiping","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,27]]},"reference":[{"issue":"3","key":"27_CR1","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1109\/TSC.2018.2830773","volume":"14","author":"Y Zhang","year":"2021","unstructured":"Zhang, Y., Cui, G., Deng, S., Chen, F., Wang, Y., He, Q.: Efficient query of quality correlation for service composition. IEEE Trans. Serv. Comput. 14(3), 695\u2013709 (2021). https:\/\/doi.org\/10.1109\/TSC.2018.2830773","journal-title":"IEEE Trans. Serv. Comput."},{"key":"27_CR2","doi-asserted-by":"publisher","unstructured":"Chu, W., Wang, Y., Mo, T., Li, W.: A constraint satisfaction service composition method supporting one to many task pattern. In: 2021 IEEE International Conference on Services Computing (SCC), Chicago, IL, USA, pp. 382\u2013387 (2021). https:\/\/doi.org\/10.1109\/SCC53864.2021.00054","DOI":"10.1109\/SCC53864.2021.00054"},{"issue":"5","key":"27_CR3","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1109\/TSC.2017.2727050","volume":"13","author":"L Ren","year":"2020","unstructured":"Ren, L., Wang, W., Xu, H.: A reinforcement learning method for constraint-satisfied services composition. IEEE Trans. Serv. Comput. 13(5), 786\u2013800 (2020). https:\/\/doi.org\/10.1109\/TSC.2017.2727050","journal-title":"IEEE Trans. Serv. Comput."},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"55","DOI":"10.4018\/IJWSR.2020100104","volume":"17","author":"X Yu","year":"2020","unstructured":"Yu, X., Ye, C., Li, B., Zhou, H., Huang, M.: A deep Q-learning network for dynamic constraint-satisfied service composition. Int. J. Web Serv. Res. (IJWSR) 17, 55\u201375 (2020)","journal-title":"Int. J. Web Serv. Res. (IJWSR)"},{"issue":"02","key":"27_CR5","first-page":"187","volume":"46","author":"L Chenghua","year":"2019","unstructured":"Chenghua, L., Jisong, K.: Multi-attribute decision making and adaptive genetic algorithm for solving QoS optimization of web service composition. Comput. Sci. 46(02), 187\u2013195 (2019)","journal-title":"Comput. Sci."},{"key":"27_CR6","unstructured":"Song, C., Jingquan, Z., Ruiyun, C.: Investigation on optimization of web service composition employing chaos ant colony algorithm. Comput. Technol. Dev. 27(02), 178\u2013181+186 (2017)"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-319-69035-3_27","volume-title":"Service-Oriented Computing","author":"H Wang","year":"2017","unstructured":"Wang, H., Gu, M., Yu, Q., Fei, H., Li, J., Tao, Y.: Large-scale and adaptive service composition using deep reinforcement learning. In: Maximilien, M., Vallecillo, A., Wang, J., Oriol, M. (eds.) ICSOC 2017. LNCS, vol. 10601, pp. 383\u2013391. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69035-3_27"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.future.2018.07.062","volume":"90","author":"SK Gavvala","year":"2019","unstructured":"Gavvala, S.K., Jatoth, C., Gangadharan, G.R., Buyya, R.: QoS-aware cloud service composition using eagle strategy. Futur. Gener. Comput. Syst. 90, 273\u2013290 (2019)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"8314","DOI":"10.1109\/ACCESS.2019.2963548","volume":"8","author":"Z Wang","year":"2020","unstructured":"Wang, Z., Cheng, B., Zhang, W., Chen, J.: Q-Graphplan: QoS-aware automatic service composition with the extended planning graph. IEEE Access 8, 8314\u20138323 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2019.2963548","journal-title":"IEEE Access"},{"issue":"3","key":"27_CR10","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1109\/TBDATA.2020.2975587","volume":"8","author":"L Qi","year":"2022","unstructured":"Qi, L., He, Q., Chen, F., Zhang, X., Dou, W., Ni, Q.: Data-driven web APIs recommendation for building web applications. IEEE Trans. Big Data 8(3), 685\u2013698 (2022). https:\/\/doi.org\/10.1109\/TBDATA.2020.2975587","journal-title":"IEEE Trans. Big Data"},{"key":"27_CR11","doi-asserted-by":"publisher","unstructured":"Gong, W., et al.: DAWAR: diversity-aware web APIs recommendation for mashup creation based on correlation graph. In: Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 2022). Association for Computing Machinery, New York, NY, USA, pp. 395\u2013404 (2022). https:\/\/doi.org\/10.1145\/3477495.3531962","DOI":"10.1145\/3477495.3531962"}],"container-title":["Communications in Computer and Information Science","Service Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-4402-6_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,26]],"date-time":"2023-07-26T23:05:36Z","timestamp":1690412736000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-4402-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819944019","9789819944026"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-4402-6_27","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Service Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Harbin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icss22023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.ccf.org.cn\/ICSS2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"71","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}