{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T12:46:02Z","timestamp":1780663562252,"version":"3.54.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,4,19]],"date-time":"2022-04-19T00:00:00Z","timestamp":1650326400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,4,19]],"date-time":"2022-04-19T00:00:00Z","timestamp":1650326400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100010789","name":"Direcci\u00f3n General de Universidades e Investigaci\u00f3n","doi-asserted-by":"publisher","award":["PID2020-115832GB-I00"],"award-info":[{"award-number":["PID2020-115832GB-I00"]}],"id":[{"id":"10.13039\/501100010789","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008679","name":"Universidad de C\u00f3rdoba","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100008679","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cogn Comput"],"published-print":{"date-parts":[[2022,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>To provide a good study plan is key to avoid students\u2019 failure. Academic advising based on student\u2019s preferences, complexity of the semester, or even background knowledge is usually considered to reduce the dropout rate. This article aims to provide a good course index to recommend courses to students based on the sequence of courses already taken by each student. Hence, unlike existing long-term course planning methods, it is based on graduate students to model the course and not on external factors that might introduce some bias in the process. The proposal includes a novel sequential pattern mining algorithm, called (ES)<jats:inline-formula><jats:alternatives><jats:tex-math>$$^2$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:msup><mml:mrow\/><mml:mn>2<\/mml:mn><\/mml:msup><\/mml:math><\/jats:alternatives><\/jats:inline-formula>P (Evolutionary Search of Emerging Sequential Patterns), that properly identifies paths followed by good students and not followed by not so good students, as a long-term course planning approach. A major feature of the proposed (ES)<jats:inline-formula><jats:alternatives><jats:tex-math>$$^2$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:msup><mml:mrow\/><mml:mn>2<\/mml:mn><\/mml:msup><\/mml:math><\/jats:alternatives><\/jats:inline-formula>P algorithm is its ability to extract the best<jats:italic>k<\/jats:italic>solutions, that is, those with a best recommendation index score instead of returning the whole set of solutions above a predefined threshold. A real study case is performed including more than 13,000 students belonging to 13 faculties to demonstrate the usefulness of the proposal not only to recommend study plans but also to give advices at different stages of the students\u2019 learning process.<\/jats:p>","DOI":"10.1007\/s12559-022-10015-5","type":"journal-article","created":{"date-parts":[[2022,4,19]],"date-time":"2022-04-19T03:55:28Z","timestamp":1650340528000},"page":"1474-1495","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Course Recommendation based on Sequences: An Evolutionary Search of Emerging Sequential Patterns"],"prefix":"10.1007","volume":"14","author":[{"given":"Mohammed Ibrahim","family":"Al-Twijri","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jos\u00e9 Mar\u00eda","family":"Luna","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Francisco","family":"Herrera","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4216-6378","authenticated-orcid":false,"given":"Sebasti\u00e1n","family":"Ventura","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,4,19]]},"reference":[{"issue":"2","key":"10015_CR1","doi-asserted-by":"publisher","first-page":"18","DOI":"10.3390\/data6020018","volume":"6","author":"DB Guruge","year":"2021","unstructured":"Guruge DB, Kadel R, Halder SJ. The state of the art in methodologies of course recommender systems\u2013a review of recent research. Data. 2021;6(2):18.","journal-title":"Data."},{"key":"10015_CR2","doi-asserted-by":"crossref","unstructured":"Bhumichitr K, Channarukul S, Saejiem N, Jiamthapthaksin R, Nongpong K. Recommender Systems for university elective course recommendation. In: 2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE). IEEE; 2017. p. 1-5.","DOI":"10.1109\/JCSSE.2017.8025933"},{"issue":"5","key":"10015_CR3","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1002\/cae.22299","volume":"28","author":"M Shakhsi-Niaei","year":"2020","unstructured":"Shakhsi-Niaei M, Abuei-Mehrizi H. An optimization-based decision support system for students\u2019 personalized long-term course planning. Comput Appl Eng Educ. 2020;28(5):1247\u201364.","journal-title":"Comput Appl Eng Educ."},{"key":"10015_CR4","doi-asserted-by":"publisher","unstructured":"Wu K, Havens WS. Modelling an Academic Curriculum Plan as a Mixed-Initiative Constraint Satisfaction Problem. In: K\u00e9gl B, Lapalme G, editors. Advances in Artificial Intelligence, 18th Conference of the Canadian Society for Computational Studies of Intelligence, Canadian AI 2005, Victoria, Canada, May 9-11, 2005, Proceedings. vol. 3501 of Lecture Notes in Computer Science. Springer; 2005. p. 79-90.\u00a0https:\/\/doi.org\/10.1007\/11424918_10.","DOI":"10.1007\/11424918_10"},{"key":"10015_CR5","unstructured":"Agrawal R, Srikant R. Mining sequential patterns. In: Proceedings of the eleventh international conference on data engineering. IEEE; 1995. p. 3-14."},{"key":"10015_CR6","doi-asserted-by":"crossref","unstructured":"Srikant R, Agrawal R. Mining sequential patterns: Generalizations and performance improvements. In: International conference on extending database technology. Springer; 1996. p. 1-17.","DOI":"10.1007\/BFb0014140"},{"key":"10015_CR7","doi-asserted-by":"crossref","unstructured":"Dong G, Li J. Efficient mining of emerging patterns: Discovering trends and differences. In: Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining; 1999. p. 43-52.","DOI":"10.1145\/312129.312191"},{"key":"10015_CR8","doi-asserted-by":"publisher","unstructured":"Luna JM, Fournier-Viger P, Ventura S. Frequent itemset mining: A 25 years review. Wiley Interdiscip Rev Data Min Knowl Discov. 2019;9(6).\u00a0https:\/\/doi.org\/10.1002\/widm.1329.","DOI":"10.1002\/widm.1329"},{"key":"10015_CR9","doi-asserted-by":"publisher","unstructured":"Wu C, Shie B, Tseng VS, Yu PS. Mining top-K high utility itemsets. In: Yang Q, Agarwal D, Pei J, editors. The 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201912, Beijing, China, August 12-16, 2012. ACM; 2012. p. 78-86.\u00a0https:\/\/doi.org\/10.1145\/2339530.2339546.","DOI":"10.1145\/2339530.2339546"},{"issue":"3","key":"10015_CR10","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s12559-018-9617-2","volume":"11","author":"F Padillo","year":"2019","unstructured":"Padillo F, Luna JM, Ventura S. A Grammar-Guided Genetic Programming Algorithm for Associative Classification in Big Data. Cogn Comput. 2019;11(3):331\u201346. https:\/\/doi.org\/10.1007\/s12559-018-9617-2.","journal-title":"Cogn Comput."},{"key":"10015_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-33858-3","volume-title":"Pattern Mining with Evolutionary Algorithms","author":"S Ventura","year":"2016","unstructured":"Ventura S, Luna JM. Pattern Mining with Evolutionary Algorithms. Springer; 2016. https:\/\/doi.org\/10.1007\/978-3-319-33858-3."},{"issue":"1","key":"10015_CR12","first-page":"54","volume":"1","author":"P Fournier-Viger","year":"2017","unstructured":"Fournier-Viger P, Lin JCW, Kiran RU, Koh YS, Thomas R. A survey of sequential pattern mining. Data Science and Pattern Recognition. 2017;1(1):54\u201377.","journal-title":"Data Science and Pattern Recognition."},{"issue":"1","key":"10015_CR13","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1023\/A:1007652502315","volume":"42","author":"MJ Zaki","year":"2001","unstructured":"Zaki MJ. SPADE: An efficient algorithm for mining frequent sequences. Mach Learn. 2001;42(1):31\u201360.","journal-title":"Mach Learn."},{"key":"10015_CR14","doi-asserted-by":"crossref","unstructured":"Ayres J, Flannick J, Gehrke J, Yiu T. Sequential pattern mining using a bitmap representation. In: Proceedings of the eighth ACM SIGKDD International Conference On Knowledge Discovery and Data Mining; 2002. p. 429-35.","DOI":"10.1145\/775047.775109"},{"issue":"11","key":"10015_CR15","doi-asserted-by":"publisher","first-page":"1424","DOI":"10.1109\/TKDE.2004.77","volume":"16","author":"J Pei","year":"2004","unstructured":"Pei J, Han J, Mortazavi-Asl B, Wang J, Pinto H, Chen Q, et al. Mining sequential patterns by pattern-growth: The prefixspan approach. IEEE Trans Knowl Data Eng. 2004;16(11):1424\u201340.","journal-title":"IEEE Trans Knowl Data Eng."},{"key":"10015_CR16","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Gomariz A, Campos M, Thomas R. Fast vertical mining of sequential patterns using co-occurrence information. In: Pacific-Asia Conference on Knowledge Discovery and Data Mining. Springer; 2014. p. 40-52.","DOI":"10.1007\/978-3-319-06608-0_4"},{"key":"10015_CR17","doi-asserted-by":"publisher","unstructured":"Fournier-Viger P, Gomariz A, Gueniche T, Mwamikazi E, Thomas R. TKS: Efficient Mining of Top-K Sequential Patterns. In: Motoda H, Wu Z, Cao L, Za\u00efane OR, Yao M, Wang W, editors. Advanced Data Mining and Applications, 9th International Conference, ADMA 2013, Hangzhou, China, December 14-16, 2013, Proceedings, Part I. vol. 8346 of Lecture Notes in Computer Science. Springer; 2013. p. 109-20.\u00a0https:\/\/doi.org\/10.1007\/978-3-642-53914-5_10.","DOI":"10.1007\/978-3-642-53914-5_10"},{"issue":"4","key":"10015_CR18","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/s10115-004-0175-4","volume":"7","author":"P Tzvetkov","year":"2005","unstructured":"Tzvetkov P, Yan X, Han J. TSP: Mining top-k closed sequential patterns. Knowl Inf Syst. 2005;7(4):438\u201357. https:\/\/doi.org\/10.1007\/s10115-004-0175-4.","journal-title":"Knowl Inf Syst."},{"key":"10015_CR19","doi-asserted-by":"publisher","unstructured":"Purushothama\u00a0Raju V, Saradhi\u00a0Varma GP. Mining closed sequential patterns using genetic algorithm. In: 2014 IEEE International Conference on Advanced Communications, Control and Computing Technologies; 2014. p. 634-7.\u00a0https:\/\/doi.org\/10.1109\/ICACCCT.2014.7019165.","DOI":"10.1109\/ICACCCT.2014.7019165"},{"key":"10015_CR20","unstructured":"Zheng Z, Zhao Y, Zuo Z, Cao L. An Efficient GA-Based Algorithm for Mining Negative Sequential Patterns. In: Zaki MJ, Yu JX, Ravindran B, Pudi V, editors. Advances in Knowledge Discovery and Data Mining, 14th Pacific-Asia Conference, PAKDD 2010, Hyderabad, India, June 21-24, 2010. Proceedings. Part I. vol. 6118 of Lecture Notes in Computer Science. Springer; 2010. p. 262-73."},{"key":"10015_CR21","unstructured":"Ykhlef M, ElGibreen H. Mining sequential patterns using hybrid evolutionary algorithm. Int J Comput Inform Eng. 2009;3(12):2939 2946."},{"issue":"1","key":"10015_CR22","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/B:DAMI.0000026901.85057.58","volume":"9","author":"J Li","year":"2004","unstructured":"Li J, Manoukian T, Dong G, Ramamohanarao K. Incremental maintenance on the border of the space of emerging patterns. Data Min Knowl Disc. 2004;9(1):89\u2013116.","journal-title":"Data Min Knowl Disc."},{"key":"10015_CR23","doi-asserted-by":"crossref","unstructured":"Zhang X, Dong G, Kotagiri R. Exploring constraints to efficiently mine emerging patterns from large high-dimensional datasets. In: Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining; 2000. p. 310-4.","DOI":"10.1145\/347090.347158"},{"key":"10015_CR24","doi-asserted-by":"crossref","unstructured":"Fan H, Ramamohanarao K. Efficiently mining interesting emerging patterns. In: International Conference on Web-Age Information Management. Springer; 2003. p. 189-201.","DOI":"10.1007\/978-3-540-45160-0_19"},{"key":"10015_CR25","doi-asserted-by":"crossref","unstructured":"Kobyli\u0144ski \u0141, Walczak K. Jumping emerging patterns with occurrence count in image classification. In: Pacific-Asia Conference on Knowledge Discovery and Data Mining. Springer; 2008. p. 904-9.","DOI":"10.1007\/978-3-540-68125-0_91"},{"issue":"4","key":"10015_CR26","doi-asserted-by":"publisher","first-page":"5573","DOI":"10.3233\/JIFS-190706","volume":"37","author":"NA Sakr","year":"2019","unstructured":"Sakr NA, Abu-Elkheir M, Atwan A, Soliman H. Data driven recognition of interleaved and concurrent human activities with nonlinear characteristics. J Intell Fuzzy Syst. 2019;37(4):5573\u201388.","journal-title":"J Intell Fuzzy Syst."},{"issue":"6","key":"10015_CR27","doi-asserted-by":"publisher","first-page":"2240","DOI":"10.1021\/acs.jproteome.7b00054","volume":"16","author":"G Poezevara","year":"2017","unstructured":"Poezevara G, Lozano S, Cuissart B, Bureau R, Bureau P, Croixmarie V, et al. A computational selection of metabolite biomarkers using emerging pattern mining: a case study in human hepatocellular carcinoma. J Proteome Res. 2017;16(6):2240\u20139.","journal-title":"J Proteome Res."},{"key":"10015_CR28","doi-asserted-by":"publisher","unstructured":"Nofong VM, Liu J, Li J. A Study on the Applications of Emerging Sequential Patterns. In: Wang H, Sharaf MA, editors. Databases Theory and Applications - 25th Australasian Database Conference, ADC 2014, Brisbane, QLD, Australia, July 14-16, 2014. Proceedings. vol. 8506 of Lecture Notes in Computer Science. Springer; 2014. p. 62-73.\u00a0https:\/\/doi.org\/10.1007\/978-3-319-08608-8_6.","DOI":"10.1007\/978-3-319-08608-8_6"},{"key":"10015_CR29","doi-asserted-by":"crossref","unstructured":"Chen Z, Liu X, Shang L. Improved course recommendation algorithm based on collaborative filtering. In: 2020 International Conference on Big Data and Informatization Education (ICBDIE). IEEE; 2020. p. 466-9.","DOI":"10.1109\/ICBDIE50010.2020.00115"},{"key":"10015_CR30","doi-asserted-by":"publisher","first-page":"19550","DOI":"10.1109\/ACCESS.2019.2897979","volume":"7","author":"L Huang","year":"2019","unstructured":"Huang L, Wang CD, Chao HY, Lai JH, Philip SY. A score prediction approach for optional course recommendation via cross-user-domain collaborative filtering. IEEE Access. 2019;7:19550\u201363.","journal-title":"IEEE Access."},{"key":"10015_CR31","doi-asserted-by":"crossref","unstructured":"Lessa LF, Brand\u00e3o WC. Filtering graduate courses based on LinkedIn profiles. In: Proceedings of the 24th Brazilian Symposium on Multimedia and the Web; 2018. p. 141-7.","DOI":"10.1145\/3243082.3243094"},{"key":"10015_CR32","unstructured":"Mostafa L, Oately G, Khalifa N, Rabie W. A case based reasoning system for academic advising in egyptian educational institutions. In: 2nd International Conference on Research in Science, Engineering and Technology (ICRSET6\u20192014) March; 2014. p. 21-2."},{"key":"10015_CR33","doi-asserted-by":"crossref","unstructured":"Huang CY, Chen RC, Chen LS. Course-recommendation system based on ontology. In: 2013 International Conference on Machine Learning and Cybernetics. vol.\u00a03. IEEE; 2013. p. 1168-73.","DOI":"10.1109\/ICMLC.2013.6890767"},{"key":"10015_CR34","doi-asserted-by":"crossref","unstructured":"Ng YK, Linn J. CrsRecs: a personalized course recommendation system for college students. In: 2017 8th International Conference on Information, Intelligence, Systems & Applications (IISA). IEEE; 2017. p. 1-6.","DOI":"10.1109\/IISA.2017.8316368"},{"key":"10015_CR35","doi-asserted-by":"crossref","unstructured":"Esteban A, Zafra A, Romero C. Helping university students to choose elective courses by using a hybrid multi-criteria recommendation system with genetic optimization. Knowl-Based Syst. 2020;194: 105385.","DOI":"10.1016\/j.knosys.2019.105385"},{"issue":"6","key":"10015_CR36","doi-asserted-by":"publisher","first-page":"1101","DOI":"10.1080\/18756891.2016.1256573","volume":"9","author":"AY Noaman","year":"2016","unstructured":"Noaman AY, Luna JM, Ragab AHM, Ventura S. Recommending degree studies according to students\u2019 attitudes in high school by means of subgroup discovery. Int J Comput Intell Syst. 2016;9(6):1101\u201317. https:\/\/doi.org\/10.1080\/18756891.2016.1256573.","journal-title":"Int J Comput Intell Syst."},{"key":"10015_CR37","doi-asserted-by":"crossref","unstructured":"Volk NA, Rojas G, Vitali MV. UniNet: Next Term Course Recommendation using Deep Learning. In: 2020 International Conference on Advanced Computer Science and Information Systems (ICACSIS). IEEE; 2020. p. 377-80.","DOI":"10.1109\/ICACSIS51025.2020.9263144"},{"key":"10015_CR38","doi-asserted-by":"crossref","unstructured":"Britto J, Prabhu S, Gawali A, Jadhav Y. A Machine Learning Based Approach for Recommending Courses at Graduate Level. In: 2019 International Conference on Smart Systems and Inventive Technology (ICSSIT). IEEE; 2019. p. 117-21.","DOI":"10.1109\/ICSSIT46314.2019.8987815"},{"key":"10015_CR39","doi-asserted-by":"crossref","unstructured":"Sankhe V, Shah J, Paranjape T, Shankarmani R. Skill Based Course Recommendation System. In: 2020 IEEE International Conference on Computing, Power and Communication Technologies (GUCON). IEEE; 2020. p. 573-6.","DOI":"10.1109\/GUCON48875.2020.9231074"},{"issue":"1","key":"10015_CR40","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1080\/10494820.2019.1643742","volume":"30","author":"JM Luna","year":"2022","unstructured":"Luna JM, Fardoun HM, Padillo F, Romero C, Ventura S. Subgroup discovery in MOOCs: a big data application for describing different types of learners. Interact Learn Environ. 2022;30(1):127\u201345.","journal-title":"Interact Learn Environ."},{"key":"10015_CR41","doi-asserted-by":"publisher","unstructured":"Wang R, Za\u00efane OR. Sequence-Based Approaches to Course Recommender Systems. In: Hartmann S, Ma H, Hameurlain A, Pernul G, Wagner RR, editors. Database and Expert Systems Applications - 29th International Conference, DEXA 2018, Regensburg, Germany, September 3-6, 2018, Proceedings, Part I. vol. 11029 of Lecture Notes in Computer Science. Springer; 2018. p. 35-50.\u00a0https:\/\/doi.org\/10.1007\/978-3-319-98809-2_3.","DOI":"10.1007\/978-3-319-98809-2_3"},{"issue":"6","key":"10015_CR42","first-page":"2129","volume":"14","author":"HQ Nguyen","year":"2018","unstructured":"Nguyen HQ, Pham TT, Vo V, Vo B, Quan TT. The predictive modeling for learning student results based on sequential rules. Int J Innov Comput Inf Control. 2018;14(6):2129\u201340.","journal-title":"Int J Innov Comput Inf Control."},{"key":"10015_CR43","unstructured":"Fournier-Viger P, Gomariz A, Gueniche T, Soltani A, Wu C, Tseng VS. SPMF: a Java open-source pattern mining library. J Mach Learn Res. 2014;15(1):3389-93. Available from: http:\/\/dl.acm.org\/citation.cfm?id=2750353."},{"key":"10015_CR44","doi-asserted-by":"publisher","unstructured":"Friedman M. A Comparison of Alternative Tests of Significance for the Problem of $$m$$ Rankings. Annals Math Stat. 1940 03;11(1):86-92.\u00a0https:\/\/doi.org\/10.1214\/aoms\/1177731944.","DOI":"10.1214\/aoms\/1177731944"},{"issue":"395","key":"10015_CR45","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1080\/01621459.1986.10478341","volume":"81","author":"JP Shaffer","year":"1986","unstructured":"Shaffer JP. Modified sequentially rejective multiple test procedures. J Am Stat Assoc. 1986;81(395):826\u201331.","journal-title":"J Am Stat Assoc."}],"container-title":["Cognitive Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12559-022-10015-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12559-022-10015-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12559-022-10015-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,22]],"date-time":"2024-09-22T12:12:37Z","timestamp":1727007157000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12559-022-10015-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,19]]},"references-count":45,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["10015"],"URL":"https:\/\/doi.org\/10.1007\/s12559-022-10015-5","relation":{},"ISSN":["1866-9956","1866-9964"],"issn-type":[{"value":"1866-9956","type":"print"},{"value":"1866-9964","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,19]]},"assertion":[{"value":"22 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All procedures performed in studies involving human participants were in accordance with the ethical standards.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"The authors declare that they have no conflict of interest.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}