{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T11:06:25Z","timestamp":1768907185226,"version":"3.49.0"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030664978","type":"print"},{"value":"9783030664985","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-66498-5_18","type":"book-chapter","created":{"date-parts":[[2021,1,18]],"date-time":"2021-01-18T01:02:54Z","timestamp":1610931774000},"page":"232-243","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Automated Business Process Discovery from Unstructured Natural-Language Documents"],"prefix":"10.1007","author":[{"given":"Alexander J.","family":"Chambers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amy M.","family":"Stringfellow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ben B.","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sophie J.","family":"Underwood","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tony G.","family":"Allard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian A.","family":"Johnston","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sarah","family":"Brockman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leslie","family":"Shing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Allan","family":"Wollaber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Courtland","family":"VanDam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,19]]},"reference":[{"issue":"2","key":"18_CR1","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1002\/widm.1045","volume":"2","author":"W van der Aalst","year":"2012","unstructured":"van der Aalst, W., Adriansyah, A., van Dongen, B.: Replaying history on process models for conformance checking and performance analysis. Wiley Interdisc. Rev. Data Mining Knowl. Discov. 2(2), 182\u2013192 (2012). https:\/\/doi.org\/10.1002\/widm.1045","journal-title":"Wiley Interdisc. Rev. Data Mining Knowl. Discov."},{"key":"18_CR2","unstructured":"van\u00a0der Aalst, W., Nikolov, A.: EMailAnalyzer: an E-Mail mining plug-in for the ProM framework. BPM Center Report-07-16 (2007)"},{"key":"18_CR3","doi-asserted-by":"publisher","unstructured":"Adriansyah, A., van Dongen, B., van der Aalst, W.: Conformance checking using cost-based fitness analysis. In: 2011 IEEE 15th International Enterprise Distributed Object Computing Conference, pp. 55\u201364, August 2011. https:\/\/doi.org\/10.1109\/EDOC.2011.12","DOI":"10.1109\/EDOC.2011.12"},{"issue":"2","key":"18_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0211486","volume":"14","author":"T Allard","year":"2019","unstructured":"Allard, T., Alvino, P., Shing, L., Wollaber, A., Yuen, J.: A dataset to facilitate automated workflow analysis. PLoS ONE 14(2), 1\u201322 (2019). https:\/\/doi.org\/10.1371\/journal.pone.0211486","journal-title":"PLoS ONE"},{"key":"18_CR5","unstructured":"Apache Camel (2019). https:\/\/camel.apache.org\/. Accessed 31 Oct 2019"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Bellotti, V., Ducheneaut, N., Howard, M., Smith, I.: Taskmaster: recasting email as task management. In: CSCW Workshop on Re-designing E-mail for the 21st Century (2002)","DOI":"10.1145\/642611.642672"},{"key":"18_CR7","unstructured":"Berti, A., van Zelst, S.J., van der Aalst, W.M.P.: Process mining for python (PM4PY): bridging the gap between process- and data science. In: 2019 International Conference on Process Mining (ICPM) (2019)"},{"key":"18_CR8","doi-asserted-by":"publisher","unstructured":"Chollet, F.: Xception: deep learning with depthwise separable convolutions. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 1251\u20131258 (2017). https:\/\/doi.org\/10.1109\/CVPR.2017.195","DOI":"10.1109\/CVPR.2017.195"},{"issue":"5","key":"18_CR9","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1109\/34.1000236","volume":"24","author":"D Comaniciu","year":"2002","unstructured":"Comaniciu, D., Meer, P.: Mean shift: a robust approach toward feature space analysis. IEEE Tran. Pattern Anal. Mach. Intell. 24(5), 603\u2013619 (2002). https:\/\/doi.org\/10.1109\/34.1000236","journal-title":"IEEE Tran. Pattern Anal. Mach. Intell."},{"key":"18_CR10","unstructured":"Cooley, R.: Classification of news stories using support vector machines. In: Proceedings 16th International Joint Conference on Artificial Intelligence Text Mining Workshop. Citeseer (1999)"},{"key":"18_CR11","unstructured":"Corston-Oliver, S., Ringger, E., Gamon, M., Campbell, R.: Task-focused summarization of email. In: Text Summarization Branches Out, Barcelona, Spain, pp. 43\u201350. Association for Computational Linguistics, July 2004"},{"key":"18_CR12","series-title":"Lecture Notes in Business Information Processing","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-34044-4_4","volume-title":"Data-Driven Process Discovery and Analysis","author":"C Di Ciccio","year":"2012","unstructured":"Di Ciccio, C., Mecella, M., Scannapieco, M., Zardetto, D., Catarci, T.: MailOfMine \u2013 analyzing mail messages for mining artful collaborative processes. In: Aberer, K., Damiani, E., Dillon, T. (eds.) SIMPDA 2011. LNBIP, vol. 116, pp. 55\u201381. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34044-4_4"},{"key":"18_CR13","doi-asserted-by":"publisher","unstructured":"Dredze, M., Lau, T., Kushmerick, N.: Automatically classifying emails into activities. In: Proceedings of the 11th International Conference on Intelligent User Interfaces, IUI 2006, New York, NY, USA, pp. 70\u201377. ACM (2006). https:\/\/doi.org\/10.1145\/1111449.1111471","DOI":"10.1145\/1111449.1111471"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.is.2012.11.014","volume":"40","author":"V Dufour-Lussier","year":"2014","unstructured":"Dufour-Lussier, V., Ber, F.L., Lieber, J., Nauer, E.: Automatic case acquisition from texts for process-oriented case-based reasoning. Inf. Syst. 40, 153\u2013167 (2014). https:\/\/doi.org\/10.1016\/j.is.2012.11.014","journal-title":"Inf. Syst."},{"issue":"3","key":"18_CR15","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF02288367","volume":"1","author":"C Eckart","year":"1936","unstructured":"Eckart, C., Young, G.: The approximation of one matrix by another of lower rank. Psychometrika 1(3), 211\u2013218 (1936). https:\/\/doi.org\/10.1007\/BF02288367","journal-title":"Psychometrika"},{"key":"18_CR16","first-page":"226","volume":"96","author":"M Ester","year":"1996","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X., et al.: A density-based algorithm for discovering clusters in large spatial databases with noise. Kdd 96, 226\u2013231 (1996)","journal-title":"Kdd"},{"key":"18_CR17","doi-asserted-by":"publisher","unstructured":"Fournier-Viger, P., Tseng, V.S.: TNS: mining top-k non-redundant sequential rules. In: Proceedings of the 28th Annual ACM Symposium on Applied Computing, SAC 2013, New York, NY, USA, pp. 164\u2013166, ACM (2013). https:\/\/doi.org\/10.1145\/2480362.2480395","DOI":"10.1145\/2480362.2480395"},{"issue":"5814","key":"18_CR18","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1126\/science.1136800","volume":"315","author":"BJ Frey","year":"2007","unstructured":"Frey, B.J., Dueck, D.: Clustering by passing messages between data points. Science 315(5814), 972\u2013976 (2007). https:\/\/doi.org\/10.1126\/science.1136800","journal-title":"Science"},{"issue":"5","key":"18_CR19","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1214\/aos\/1013203451","volume":"29","author":"JH Friedman","year":"2001","unstructured":"Friedman, J.H.: Greedy function approximation: a gradient boosting machine. Ann. Stat. 29(5), 1189\u20131232 (2001). https:\/\/doi.org\/10.1214\/aos\/1013203451","journal-title":"Ann. Stat."},{"key":"18_CR20","unstructured":"Gabrilovich, E., Markovitch, S.: Overcoming the brittleness bottleneck using wikipedia: enhancing text categorization with encyclopedic knowledge. In: Proceedings of the 21st National Conference on Artificial Intelligence - Volume 2, AAAI 2006, pp. 1301\u20131306. AAAI Press (2006)"},{"key":"18_CR21","doi-asserted-by":"publisher","unstructured":"Honnibal, M., Johnson, M.: An improved non-monotonic transition system for dependency parsing. In: Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing, Lisbon, Portugal, pp. 1373\u20131378. Association for Computational Linguistics, September 2015. https:\/\/doi.org\/10.18653\/v1\/D15-1162","DOI":"10.18653\/v1\/D15-1162"},{"issue":"1","key":"18_CR22","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert, L., Arabie, P.: Comparing partitions. J. Classif. 2(1), 193\u2013218 (1985). https:\/\/doi.org\/10.1007\/BF01908075","journal-title":"J. Classif."},{"key":"18_CR23","doi-asserted-by":"publisher","unstructured":"Jiang, J.Y., Cheng, W.H., Chiou, Y.S., Lee, S.J.: A similarity measure for text processing. In: 2011 International Conference on Machine Learning and Cybernetics, vol. 4, pp. 1460\u20131465, July 2011. https:\/\/doi.org\/10.1109\/ICMLC.2011.6016998","DOI":"10.1109\/ICMLC.2011.6016998"},{"key":"18_CR24","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-030-30284-9_5","volume-title":"Information Search, Integration, and Personalization","author":"D Jlailaty","year":"2019","unstructured":"Jlailaty, D., Grigori, D., Belhajjame, K.: Email business activities extraction and annotation. In: Kotzinos, D., Laurent, D., Spyratos, N., Tanaka, Y., Taniguchi, R. (eds.) ISIP 2018. CCIS, vol. 1040, pp. 69\u201386. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30284-9_5"},{"key":"18_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1007\/978-3-540-30549-1_43","volume-title":"AI 2004: Advances in Artificial Intelligence","author":"AM Kibriya","year":"2004","unstructured":"Kibriya, A.M., Frank, E., Pfahringer, B., Holmes, G.: Multinomial Naive Bayes for text categorization revisited. In: Webb, G.I., Yu, X. (eds.) AI 2004. LNCS (LNAI), vol. 3339, pp. 488\u2013499. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30549-1_43"},{"issue":"2\u20133","key":"18_CR26","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1080\/01638539809545028","volume":"25","author":"TK Landauer","year":"1998","unstructured":"Landauer, T.K., Foltz, P.W., Laham, D.: An introduction to latent semantic analysis. Discourse Process. 25(2\u20133), 259\u2013284 (1998). https:\/\/doi.org\/10.1080\/01638539809545028","journal-title":"Discourse Process."},{"key":"18_CR27","doi-asserted-by":"publisher","unstructured":"Leemans, S.J.J., Poppe, E., Wynn, M.T.: Directly follows-based process mining: exploration & a case study. In: 2019 International Conference on Process Mining (ICPM), pp. 25\u201332, June 2019. https:\/\/doi.org\/10.1109\/ICPM.2019.00015","DOI":"10.1109\/ICPM.2019.00015"},{"issue":"2","key":"18_CR28","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"SP Lloyd","year":"1982","unstructured":"Lloyd, S.P.: Least squares quantization in PCM. IEEE Trans. Inf. Theory 28(2), 129\u2013137 (1982). https:\/\/doi.org\/10.1109\/TIT.1982.1056489","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"18_CR29","doi-asserted-by":"publisher","first-page":"205","DOI":"10.21105\/joss.00205","volume":"2","author":"L McInnes","year":"2017","unstructured":"McInnes, L., Healy, J., Astels, S.: HDBSCAN: hierarchical density based clustering. J. Open Source Softw. 2(11), 205 (2017). https:\/\/doi.org\/10.21105\/joss.00205","journal-title":"J. Open Source Softw."},{"key":"18_CR30","unstructured":"Merity, S., Keskar, N.S., Socher, R.: Regularizing and optimizing LSTM language models. In: International Conference on Learning Representations (2018)"},{"key":"18_CR31","unstructured":"Mihalcea, R., Tarau, P.: TextRank: bringing order into text. In: Proceedings of the 2004 Conference on Empirical Methods in Natural Language Processing, Barcelona, Spain, pp. 404\u2013411. Association for Computational Linguistics, July 2004"},{"issue":"11","key":"18_CR32","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1080\/14786440109462720","volume":"2","author":"K Pearson","year":"1901","unstructured":"Pearson, K.: LIII: on lines and planes of closest fit to systems of points in space. Philos. Mag. J. Sci. 2(11), 559\u2013572 (1901). https:\/\/doi.org\/10.1080\/14786440109462720","journal-title":"Philos. Mag. J. Sci."},{"key":"18_CR33","doi-asserted-by":"publisher","unstructured":"Pelevina, M., Arefiev, N., Biemann, C., Panchenko, A.: Making sense of word embeddings. In: Proceedings of the 1st Workshop on Representation Learning for NLP, Berlin, Germany, pp. 174\u2013183. Association for Computational Linguistics, August 2016. https:\/\/doi.org\/10.18653\/v1\/W16-1620","DOI":"10.18653\/v1\/W16-1620"},{"issue":"3","key":"18_CR34","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1108\/00330330610681286","volume":"14","author":"MF Porter","year":"1980","unstructured":"Porter, M.F.: An algorithm for suffix stripping. Program 14(3), 130\u2013137 (1980). https:\/\/doi.org\/10.1108\/00330330610681286","journal-title":"Program"},{"issue":"2","key":"18_CR35","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1093\/genetics\/155.2.945","volume":"155","author":"JK Pritchard","year":"2000","unstructured":"Pritchard, J.K., Stephens, M., Donnelly, P.: Inference of population structure using multilocus genotype data. Genetics 155(2), 945\u2013959 (2000)","journal-title":"Genetics"},{"issue":"7","key":"18_CR36","first-page":"46","volume":"13","author":"JW Ratcliff","year":"1988","unstructured":"Ratcliff, J.W., Metzener, D.E.: Pattern-matching-the gestalt approach. Dr Dobbs J. 13(7), 46 (1988)","journal-title":"Dr Dobbs J."},{"key":"18_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/9780470689646.ch1","volume-title":"Automatic Keyword Extraction from Individual Documents","author":"S Rose","year":"2010","unstructured":"Rose, S., Engel, D., Cramer, N., Cowley, W.: Automatic Keyword Extraction from Individual Documents, vol. 1, pp. 1\u201320. Wiley, Hoboken (2010). https:\/\/doi.org\/10.1002\/9780470689646.ch1"},{"key":"18_CR38","doi-asserted-by":"publisher","unstructured":"Schumacher, P., Minor, M., Walter, K., Bergmann, R.: Extraction of procedural knowledge from the web: a comparison of two workflow extraction approaches. In: Proceedings of the 21st International Conference on World Wide Web, New York, NY, USA, pp. 739\u2013747. WWW 2012 Companion, ACM (2012). https:\/\/doi.org\/10.1145\/2187980.2188194","DOI":"10.1145\/2187980.2188194"},{"key":"18_CR39","series-title":"Lecture Notes in Business Information Processing","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-030-11641-5_23","volume-title":"Business Process Management Workshops","author":"L Shing","year":"2019","unstructured":"Shing, L., et al.: Extracting workflows from natural language documents: a first step. In: Daniel, F., Sheng, Q.Z., Motahari, H. (eds.) BPM 2018. LNBIP, vol. 342, pp. 294\u2013300. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11641-5_23"},{"issue":"1","key":"18_CR40","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1108\/eb026526","volume":"28","author":"K Sparck Jones","year":"1972","unstructured":"Sparck Jones, K.: A statistical interpretation of term specificity and its application in retrieval. J. Documentation 28(1), 11\u201321 (1972). https:\/\/doi.org\/10.1108\/eb026526","journal-title":"J. Documentation"},{"key":"18_CR41","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3264-1","volume-title":"The Nature of Statistical Learning Theory","author":"VN Vapnik","year":"1995","unstructured":"Vapnik, V.N.: The Nature of Statistical Learning Theory. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/978-1-4757-3264-1"},{"key":"18_CR42","first-page":"2837","volume":"11","author":"NX Vinh","year":"2010","unstructured":"Vinh, N.X., Epps, J., Bailey, J.: Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance. J. Mach. Learn. Res. 11, 2837\u20132854 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"18_CR43","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1162\/tacl\\_a_00267","volume":"7","author":"J Zeng","year":"2019","unstructured":"Zeng, J., Li, J., He, Y., Gao, C., Lyu, M.R., King, I.: What you say and how you say it: joint modeling of topics and discourse in microblog conversations. Trans. Assoc. Comput. Linguist. 7, 267\u2013281 (2019). https:\/\/doi.org\/10.1162\/tacl_a_00267","journal-title":"Trans. Assoc. Comput. Linguist."},{"key":"18_CR44","doi-asserted-by":"publisher","unstructured":"Zhang, T.: Solving large scale linear prediction problems using stochastic gradient descent algorithms. In: Proceedings of the Twenty-first International Conference on Machine Learning, ICML 2004, New York, NY, USA, pp. 116\u2013123. ACM (2004). https:\/\/doi.org\/10.1145\/1015330.1015332","DOI":"10.1145\/1015330.1015332"}],"container-title":["Lecture Notes in Business Information Processing","Business Process Management Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-66498-5_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T01:02:20Z","timestamp":1768698140000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-66498-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030664978","9783030664985"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-66498-5_18","relation":{},"ISSN":["1865-1348","1865-1356"],"issn-type":[{"value":"1865-1348","type":"print"},{"value":"1865-1356","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"19 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BPM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Business Process Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Seville","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bpm2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/congreso.us.es\/bpm2020\/index.html","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":"125","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":"27","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":"0","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":"22% - 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":"4","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"In addition, 19 papers were published from the BPM Forum, 15 from the Blockchain and RPA Forum, and 28 full and 1 short paper from the workshops out of a total of 53 submissions. The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}