{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:14:04Z","timestamp":1743106444989,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030926342"},{"type":"electronic","value":"9783030926359"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92635-9_3","type":"book-chapter","created":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T13:02:45Z","timestamp":1641042165000},"page":"38-53","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["\u201cFailure\u201d Service Pattern Mining for Exploratory Service Composition"],"prefix":"10.1007","author":[{"given":"Yunjing","family":"Yuan","sequence":"first","affiliation":[]},{"given":"Jing","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yanbo","family":"Han","sequence":"additional","affiliation":[]},{"given":"Qianwen","family":"Li","sequence":"additional","affiliation":[]},{"given":"Gaojian","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Boyang","family":"Jiao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Xu, H., Wang, X., Wang, Y., Li, N., Tu, Z., Wang, Z., Xu, X.: Domain priori knowledge based integrated solution design for internet of services. In: 2020 IEEE International Conference on Services Computing (SCC), pp. 446\u2013453. IEEE, Beijing, China (2020)","DOI":"10.1109\/SCC49832.2020.00065"},{"issue":"2","key":"3_CR2","doi-asserted-by":"publisher","first-page":"88","DOI":"10.4018\/IJWSR.2019040105","volume":"16","author":"R Liu","year":"2019","unstructured":"Liu, R., Wang, Z., Xu, X.: Parameter tuning for S-ABCPK: an improved service composition algorithm considering priori knowledge. Int. J. Web Serv. Res. (IJWSR) 16(2), 88\u2013109 (2019)","journal-title":"Int. J. Web Serv. Res. (IJWSR)"},{"issue":"7","key":"3_CR3","doi-asserted-by":"publisher","first-page":"1080","DOI":"10.1016\/j.future.2011.08.017","volume":"28","author":"M Liu","year":"2012","unstructured":"Liu, M., Wang, M., Shen, W., Luo, N., Yan, J.: A quality of service (QoS)-aware execution plan selection approach for a service composition process. Futur. Gener. Comput. Syst. 28(7), 1080\u20131089 (2012)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Ding, W., Wang, J., Han, Y.: ViPen: a model supporting knowledge provenance for exploratory service composition. In: 2010 IEEE International Conference on Services Computing, pp. 265\u2013272. IEEE, Miami, FL, USA (2010)","DOI":"10.1109\/SCC.2010.44"},{"issue":"9","key":"3_CR5","first-page":"36","volume":"3","author":"S Yan","year":"2008","unstructured":"Yan, S., Wang, J., Liu, C.: An approach to discover dependencies between service operations. IEEE Int. J. Software 3(9), 36\u201343 (2008)","journal-title":"IEEE Int. J. Software"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Yan, S., Han, Y., Wang, J., Liu, C., Wang, G.: A user-steering exploratory service composition approach. In: 2008 IEEE International Conference on Services Computing, pp. 309\u2013316. IEEE, Honolulu, HI, USA (2008)","DOI":"10.1109\/SCC.2008.78"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Xu, X., Liu, R., Wang, Z., Tu, Z., Xu, H.: RE2SEP: a two-phases pattern-based paradigm for software service engineering. In: 2017 IEEE World Congress on Services (SERVICES), pp. 67\u201370. IEEE, Honolulu, HI, USA (2017)","DOI":"10.1109\/SERVICES.2017.30"},{"issue":"6","key":"3_CR8","doi-asserted-by":"publisher","first-page":"1240","DOI":"10.3923\/itj.2011.1240.1245","volume":"10","author":"X Fang","year":"2011","unstructured":"Fang, X., Gao, X., Yin, Z., Zhao, Q.: An efficient process mining method based on discrete particle swarm optimization. Inf. Technol. J. 10(6), 1240\u20131245 (2011)","journal-title":"Inf. Technol. J."},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Sangaiah, A.K., Hosseinabadi, A.A.R., Shareh, M.B., Bozorgi Rad, S.Y., Zolfagharian, A., Chilamkurti, N.: IoT resource allocation and optimization based on heuristic algorithm. Sensors 20(2), 539 (2020)","DOI":"10.3390\/s20020539"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-15387-7_8","volume-title":"Knowledge-Based and Intelligent Information and Engineering Systems","author":"C Bratosin","year":"2010","unstructured":"Bratosin, C., Sidorova, N., van der Aalst, W.: Discovering process models with genetic algorithms using sampling. In: Setchi, R., Jordanov, I., Howlett, R.J., Jain, L.C. (eds.) KES 2010. LNCS (LNAI), vol. 6276, pp. 41\u201350. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15387-7_8"},{"key":"3_CR11","series-title":"Lecture Notes in Business Information Processing","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-00328-8_11","volume-title":"Business Process Management Workshops","author":"M Song","year":"2009","unstructured":"Song, M., G\u00fcnther, C.W., van der Aalst, W.M.P.: Trace clustering in process mining. In: Ardagna, D., Mecella, M., Yang, J. (eds.) BPM 2008. LNBIP, vol. 17, pp. 109\u2013120. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00328-8_11"},{"issue":"1","key":"3_CR12","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1017\/S0269888912000331","volume":"28","author":"C Jiang","year":"2013","unstructured":"Jiang, C., Coenen, F., Zito, M.: A survey of frequent subgraph mining algorithms. Knowl. Eng. Rev. 28(1), 75\u2013105 (2013)","journal-title":"Knowl. Eng. Rev."},{"issue":"4","key":"3_CR13","first-page":"161","volume":"10","author":"CR Wijesinghe","year":"2021","unstructured":"Wijesinghe, C.R., Weerasinghe, A.R.: Mining frequent patterns in bioinformatics workflows. Int. J. Biosci. Biochem. Bioinf. 10(4), 161\u2013169 (2021)","journal-title":"Int. J. Biosci. Biochem. Bioinf."},{"issue":"3","key":"3_CR14","doi-asserted-by":"publisher","first-page":"2479","DOI":"10.5194\/isprs-archives-XLII-3-2479-2018","volume":"42","author":"G Zhou","year":"2018","unstructured":"Zhou, G., et al.: An improved method of AGM for high precision geolocation of SAR images. ISPRS Int. Arch. Photogrammetry Remote Sens. Spat. Inf. Sci. 42(3), 2479\u20132485 (2018)","journal-title":"ISPRS Int. Arch. Photogrammetry Remote Sens. Spat. Inf. Sci."},{"issue":"3","key":"3_CR15","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/s10618-014-0365-y","volume":"29","author":"L Akoglu","year":"2015","unstructured":"Akoglu, L., Tong, H., Koutra, D.: Graph-based anomaly detection and description: a survey. Data Min. Knowl. Disc. 29(3), 626\u2013688 (2015)","journal-title":"Data Min. Knowl. Disc."},{"issue":"9","key":"3_CR16","first-page":"2105","volume":"10","author":"B Huynh","year":"2016","unstructured":"Huynh, B., Nguyen, D., Vo, B.: Parallel frequent subgraph mining on multi-core processor systems. ICIC Express Lett. 10(9), 2105\u20132113 (2016)","journal-title":"ICIC Express Lett."},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Meng, H., Wu, L., Zhang, T., Chen, G., Li, D.: Mining frequent composite service patterns. In: 2008 Seventh International Conference on Grid and Cooperative Computing, pp. 713\u2013718. IEEE, Shenzhen, Guangdong, China (2008)","DOI":"10.1109\/GCC.2008.102"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Shafiq, M., Alhajj, R., Rokne, J.: Reducing search space for web service ranking using semantic logs and semantic FP-tree based association rule mining. In: Proceedings of the 2015 IEEE 9th International Conference on Semantic Computing (IEEE ICSC 2015), pp. 1\u20138. IEEE, Anaheim, CA, USA (2015)","DOI":"10.1109\/ICOSC.2015.7050771"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-319-64471-4_22","volume-title":"Database and Expert Systems Applications","author":"H Labbaci","year":"2017","unstructured":"Labbaci, H., Medjahed, B., Aklouf, Y.: Learning interactions from web service logs. In: Benslimane, D., Damiani, E., Grosky, W.I., Hameurlain, A., Sheth, A., Wagner, R.R. (eds.) DEXA 2017. LNCS, vol. 10439, pp. 275\u2013289. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-64471-4_22"},{"key":"3_CR20","unstructured":"Yan, X., Han, J.: gSpan: graph-based substructure pattern mining. In: 2002 IEEE International Conference on Data Mining, 2002, Proceedings, pp. 721\u2013724. IEEE, Maebashi City, Japan (2002)"},{"issue":"4","key":"3_CR21","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1109\/TSC.2013.42","volume":"7","author":"Z Fan","year":"2014","unstructured":"Fan, Z., Peng, Y., Choi, B., Xu, J., Bhowmick, S.: Towards efficient authenticated subgraph query service in outsourced graph databases. IEEE Trans. Serv. Comput. 7(4), 696\u2013713 (2014)","journal-title":"IEEE Trans. Serv. Comput."},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-030-37188-3_13","volume-title":"Big Data Analytics","author":"P Fournier-Viger","year":"2019","unstructured":"Fournier-Viger, P., Cheng, C., Lin, J.-W., Yun, U., Kiran, R.U.: TKG: efficient mining of top-K frequent subgraphs. In: Madria, S., Fournier-Viger, P., Chaudhary, S., Reddy, P.K. (eds.) BDA 2019. LNCS, vol. 11932, pp. 209\u2013226. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-37188-3_13"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Liu, R., Xu, X., Wang, Z., Sheng, Q., Xu, H.: Probability matrix of request-solution mapping for efficient service selection. In: 2017 IEEE International Conference on Web Services (ICWS), pp. 444\u2013451. IEEE, Honolulu, HI, USA (2017)","DOI":"10.1109\/ICWS.2017.51"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Collaborative Computing: Networking, Applications and Worksharing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92635-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T13:03:33Z","timestamp":1641042213000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92635-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030926342","9783030926359"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92635-9_3","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CollaborateCom","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Collaborative Computing: Networking, Applications and Worksharing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"colcom2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/collaboratecom.eai-conferences.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Confy +","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"206","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":"62","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":"7","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":"30% - 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)"}}]}}