{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T16:34:24Z","timestamp":1774888464193,"version":"3.50.1"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"18","license":[{"start":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T00:00:00Z","timestamp":1676505600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T00:00:00Z","timestamp":1676505600000},"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":["Multimed Tools Appl"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s11042-023-14484-0","type":"journal-article","created":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T01:02:43Z","timestamp":1676509363000},"page":"27571-27591","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Mining frequent Itemsets from transaction databases using hybrid switching framework"],"prefix":"10.1007","volume":"82","author":[{"given":"P.P","family":"Jashma Suresh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"U","family":"Dinesh Acharya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.V. Subba","family":"Reddy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,2,16]]},"reference":[{"key":"14484_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.eswa.2018.03.041","volume":"105","author":"N Aryabarzan","year":"2018","unstructured":"Aryabarzan N, Minaei-Bidgoli B, Teshnehlab M (2018) negFIN: an efficient algorithm for fast mining frequent itemsets. Expert Syst Appl 105:129\u2013143. https:\/\/doi.org\/10.1016\/j.eswa.2018.03.041","journal-title":"Expert Syst Appl"},{"key":"14484_CR2","unstructured":"Bhatt R, Dhall A, (2010) Skin segmentation dataset. UCI Machine Learning Repository."},{"key":"14484_CR3","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1016\/j.eswa.2017.10.039","volume":"96","author":"H Bui","year":"2018","unstructured":"Bui H, Vo B, Nguyen H, Nguyen-Hoang T-A, Hong T-P (2018) A weighted N-list-based method for mining frequent weighted itemsets. Expert Syst Appl 96:388\u2013405. https:\/\/doi.org\/10.1016\/j.eswa.2017.10.039","journal-title":"Expert Syst Appl"},{"issue":"3","key":"14484_CR4","doi-asserted-by":"publisher","first-page":"1439","DOI":"10.1007\/s10489-020-01899-7","volume":"51","author":"H Bui","year":"2021","unstructured":"Bui H, Vo B, Nguyen-Hoang T-A, Yun U (2021) Mining frequent weighted closed itemsets using the WN-list structure and an early pruning strategy. Appl Intell 51(3):1439\u20131459. https:\/\/doi.org\/10.1007\/s10489-020-01899-7","journal-title":"Appl Intell"},{"key":"14484_CR5","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jpdc.2018.11.002","volume":"125","author":"L Bustio-Mart\u00ednez","year":"2019","unstructured":"Bustio-Mart\u00ednez L, Letras-Luna M, Cumplido R, Hern\u00e1ndez-Le\u00f3n R, Feregrino-Uribe C, Bande-Serrano JM (2019) Using hashing and lexicographic order for frequent Itemsets mining on data streams. J Parallel Distrib Comput 125:58\u201371. https:\/\/doi.org\/10.1016\/j.jpdc.2018.11.002","journal-title":"J Parallel Distrib Comput"},{"key":"14484_CR6","unstructured":"Chen DD (2015) Online retail data set. UC Irvine Machine Learning Repository."},{"key":"14484_CR7","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.ins.2018.01.046","volume":"439\u2013440","author":"K-W Chon","year":"2018","unstructured":"Chon K-W, Hwang S-H, Kim M-S (2018) GMiner: a fast GPU-based frequent itemset mining method for large-scale data. Inf Sci 439\u2013440:19\u201338. https:\/\/doi.org\/10.1016\/j.ins.2018.01.046","journal-title":"Inf Sci"},{"issue":"3","key":"14484_CR8","doi-asserted-by":"publisher","first-page":"3387","DOI":"10.1007\/s10489-021-02574-1","volume":"52","author":"Y Cui","year":"2022","unstructured":"Cui Y, Gan W, Lin H, Zheng W (2022) FRI-miner: fuzzy rare itemset mining. Appl Intell 52(3):3387\u20133402. https:\/\/doi.org\/10.1007\/s10489-021-02574-1","journal-title":"Appl Intell"},{"key":"14484_CR9","doi-asserted-by":"publisher","first-page":"104477","DOI":"10.1016\/j.engappai.2021.104477","volume":"106","author":"R Davashi","year":"2021","unstructured":"Davashi R (2021) UP-tree & UP-mine: a fast method based on upper bound for frequent pattern mining from uncertain data. Eng Appl Artif Intell 106:104477. https:\/\/doi.org\/10.1016\/j.engappai.2021.104477","journal-title":"Eng Appl Artif Intell"},{"issue":"3","key":"14484_CR10","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1007\/s10489-017-0932-1","volume":"47","author":"S Dawar","year":"2017","unstructured":"Dawar S, Goyal V, Bera D (2017) A hybrid framework for mining high-utility itemsets in a sparse transaction database. Appl Intell 47(3):809\u2013827. https:\/\/doi.org\/10.1007\/s10489-017-0932-1","journal-title":"Appl Intell"},{"issue":"13","key":"14484_CR11","doi-asserted-by":"publisher","first-page":"5424","DOI":"10.1016\/j.eswa.2015.03.004","volume":"42","author":"Z-H Deng","year":"2015","unstructured":"Deng Z-H, Lv S-L (2015) PrePost+: an efficient N-lists-based algorithm for mining frequent itemsets via children\u2013parent equivalence pruning. Expert Syst Appl 42(13):5424\u20135432. https:\/\/doi.org\/10.1016\/j.eswa.2015.03.004","journal-title":"Expert Syst Appl"},{"key":"14484_CR12","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.knosys.2017.10.016","volume":"139","author":"Y Djenouri","year":"2018","unstructured":"Djenouri Y, Belhadi A, Fournier-Viger P (2018) Extracting useful knowledge from event logs: a frequent itemset mining approach. Knowl-Based Syst 139:132\u2013148. https:\/\/doi.org\/10.1016\/j.knosys.2017.10.016","journal-title":"Knowl-Based Syst"},{"issue":"3","key":"14484_CR13","doi-asserted-by":"publisher","first-page":"2096","DOI":"10.3906\/elk-1602-113","volume":"25","author":"G Gatuha","year":"2017","unstructured":"Gatuha G, Jiang T (2017) Smart frequent itemsets mining algorithm based on FP-tree and DIFFset data structures. Turk J Electric Eng Comput Sci 25(3):2096\u20132107. https:\/\/doi.org\/10.3906\/elk-1602-113","journal-title":"Turk J Electric Eng Comput Sci"},{"key":"14484_CR14","doi-asserted-by":"publisher","first-page":"100146","DOI":"10.1016\/j.bdr.2020.100146","volume":"21","author":"P Goyal","year":"2020","unstructured":"Goyal P, Challa JS, Shrivastava S, Goyal N (2020) Anytime frequent Itemset Mining of Transactional Data Streams. Big Data Research 21:100146. https:\/\/doi.org\/10.1016\/j.bdr.2020.100146","journal-title":"Big Data Research"},{"key":"14484_CR15","unstructured":"Hebrail G, Berard A (2012 Aug 30) Individual household electric power consumption data set. \u00c9. d. France, Ed., ed: UCI Machine Learning Repository"},{"issue":"10","key":"14484_CR16","first-page":"3529","volume":"12","author":"J Ilamchezhian","year":"2021","unstructured":"Ilamchezhian J (2021) A novel approach for frequent Itemset mining using geometric progression number labeling. Turk J Comput Math Educ (TURCOMAT) 12(10):3529\u20133538","journal-title":"Turk J Comput Math Educ (TURCOMAT)"},{"key":"14484_CR17","doi-asserted-by":"publisher","unstructured":"Jamsheela O, Raju GK (2021) Parallelization of frequent Itemset mining methods with FP-tree: an experiment with PrePost+ algorithm. Int Arab J Inf Technol 18(2): 208\u2013213. https:\/\/doi.org\/10.34028\/iajit\/18\/2\/9","DOI":"10.34028\/iajit\/18\/2\/9"},{"issue":"6","key":"14484_CR18","first-page":"1727","volume":"8","author":"J Kaliappan","year":"2019","unstructured":"Kaliappan J, Sai SM, Preetham KS (2019) Weblog and retail industries analysis using a robust modified Apriori algorithm. Int J Innov Technol Explor Eng 8(6):1727\u20131733","journal-title":"Int J Innov Technol Explor Eng"},{"key":"14484_CR19","doi-asserted-by":"publisher","first-page":"113004","DOI":"10.1016\/j.eswa.2019.113004","volume":"142","author":"S Lessanibahri","year":"2020","unstructured":"Lessanibahri S, Gastaldi L, Gonz\u00e1lez Fern\u00e1ndez C (2020) A novel pruning algorithm for mining long and maximum length frequent itemsets. Expert Syst Appl 142:113004. https:\/\/doi.org\/10.1016\/j.eswa.2019.113004","journal-title":"Expert Syst Appl"},{"key":"14484_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-98809-2_1","volume-title":"International conference on database and expert systems applications","author":"CK Leung","year":"2018","unstructured":"Leung CK, Zhang H, Souza J, Lee W (2018) Scalable vertical mining for big data analytics of frequent itemsets. In: International conference on database and expert systems applications. Springer, Cham, pp 3\u201317. https:\/\/doi.org\/10.1007\/978-3-319-98809-2_1"},{"key":"14484_CR21","doi-asserted-by":"publisher","unstructured":"Li Z, Chen F, Wu J, Liu Z, Liu W (2021) Efficient weighted probabilistic frequent itemset mining in uncertain databases. Expert Syst 38(5). https:\/\/doi.org\/10.1111\/exsy.12551","DOI":"10.1111\/exsy.12551"},{"issue":"7","key":"14484_CR22","doi-asserted-by":"publisher","first-page":"4806","DOI":"10.1007\/s10489-020-02080-w","volume":"51","author":"JC-W Lin","year":"2021","unstructured":"Lin JC-W, Ahmed U, Srivastava G, Wu JM-T, Hong T-P, Djenouri Y (2021) Linguistic frequent pattern mining using a compressed structure. Appl Intell 51(7):4806\u20134823. https:\/\/doi.org\/10.1007\/s10489-020-02080-w","journal-title":"Appl Intell"},{"key":"14484_CR23","doi-asserted-by":"publisher","first-page":"116220","DOI":"10.1016\/j.eswa.2021.116220","volume":"191","author":"J Liu","year":"2022","unstructured":"Liu J, Ye Z, Yang X, Wang X, Shen L, Jiang X (2022) Efficient strategies for incremental mining of frequent closed itemsets over data streams. Expert Syst Appl 191:116220. https:\/\/doi.org\/10.1016\/j.eswa.2021.116220","journal-title":"Expert Syst Appl"},{"issue":"4","key":"14484_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3488380","volume":"16","author":"D Liu","year":"2022","unstructured":"Liu D, Li Y, Baskett W, Lin D, Shyu C-R (2022) RHPTree\u2014risk hierarchical pattern tree for scalable long pattern mining. ACM Trans Knowl Discov Data 16(4):1\u201333. https:\/\/doi.org\/10.1145\/3488380","journal-title":"ACM Trans Knowl Discov Data"},{"key":"14484_CR25","unstructured":"Nguyen HH (2019) Boosting frequent itemset mining via early stopping intersections. arXiv:190107773 [cs]"},{"key":"14484_CR26","doi-asserted-by":"publisher","first-page":"116840","DOI":"10.1109\/ACCESS.2020.3004530","volume":"8","author":"T-N Nguyen","year":"2020","unstructured":"Nguyen T-N, Nguyen LTT, Vo B, Nguyen N-T, Nguyen TDD (2020) An N-list-based approach for mining frequent inter-transaction patterns. IEEE Access 8:116840\u2013116855. https:\/\/doi.org\/10.1109\/ACCESS.2020.3004530","journal-title":"IEEE Access"},{"key":"14484_CR27","doi-asserted-by":"publisher","unstructured":"Ponmudiyan Poovan JS, Udupi DA, Subba Reddy NV (2022) A multithreaded hybrid framework for mining frequent itemsets. IJECE 12(3): 3249-3264. https:\/\/doi.org\/10.11591\/ijece.v12i3","DOI":"10.11591\/ijece.v12i3"},{"key":"14484_CR28","doi-asserted-by":"publisher","first-page":"183722","DOI":"10.1109\/ACCESS.2020.3029302","volume":"8","author":"J-F Qu","year":"2020","unstructured":"Qu J-F, Hang B, Wu Z, Wu Z, Gu Q, Tang B (2020) Efficient Mining of Frequent Itemsets Using Only one Dynamic Prefix Tree. IEEE Access 8:183722\u2013183735. https:\/\/doi.org\/10.1109\/ACCESS.2020.3029302","journal-title":"IEEE Access"},{"key":"14484_CR29","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.ins.2018.11.026","volume":"479","author":"MM Rahman","year":"2019","unstructured":"Rahman MM, Ahmed CF, Leung CK-S (2019) Mining weighted frequent sequences in uncertain databases. Inf Sci 479:76\u2013100. https:\/\/doi.org\/10.1016\/j.ins.2018.11.026","journal-title":"Inf Sci"},{"key":"14484_CR30","unstructured":"Reiss A (April 2019) Stricker D, Pamap2 physical activity monitoring data set. Retrieved."},{"key":"14484_CR31","doi-asserted-by":"crossref","unstructured":"Siahaan APU, Ikhwan A, Aryza S (2018) A novelty of data mining for promoting education based on FP-growth algorithm.","DOI":"10.31227\/osf.io\/jpsfa"},{"issue":"3","key":"14484_CR32","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1080\/02533839.2018.1454853","volume":"41","author":"MK Sohrabi","year":"2018","unstructured":"Sohrabi MK, Taheri N (2018) A Hadoop-based parallel mining of frequent itemsets using N-lists. J Chin Inst Eng 41(3):229\u2013238. https:\/\/doi.org\/10.1080\/02533839.2018.1454853","journal-title":"J Chin Inst Eng"},{"key":"14484_CR33","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.knosys.2018.04.038","volume":"154","author":"LH Son","year":"2018","unstructured":"Son LH, Chiclana F, Kumar R, Mittal M, Khari M, Chatterjee JM, Baik SW (2018) ARM\u2013AMO: an efficient association rule mining algorithm based on animal migration optimization. Knowl-Based Syst 154:68\u201380. https:\/\/doi.org\/10.1016\/j.knosys.2018.04.038","journal-title":"Knowl-Based Syst"},{"key":"14484_CR34","unstructured":"Stolfo SJ, (1999) KDD cup 1999 dataset. UCI KDD repository. http:\/\/kdd.ics.uci.edu."},{"key":"14484_CR35","doi-asserted-by":"publisher","first-page":"101721","DOI":"10.1016\/j.datak.2019.101721","volume":"123","author":"MK Vanahalli","year":"2019","unstructured":"Vanahalli MK, Patil N (2019) An efficient dynamic switching algorithm for mining colossal closed itemsets from high dimensional datasets. Data Knowl Eng 123:101721. https:\/\/doi.org\/10.1016\/j.datak.2019.101721","journal-title":"Data Knowl Eng"},{"key":"14484_CR36","doi-asserted-by":"publisher","first-page":"106064","DOI":"10.1016\/j.knosys.2020.106064","volume":"201\u2013202","author":"B Vo","year":"2020","unstructured":"Vo B, Bui H, Vo T, Le T (2020) Mining top-rank-k frequent weighted itemsets using WN-list structures and an early pruning strategy. Knowl-Based Syst 201\u2013202:106064. https:\/\/doi.org\/10.1016\/j.knosys.2020.106064","journal-title":"Knowl-Based Syst"},{"key":"14484_CR37","doi-asserted-by":"publisher","unstructured":"Waghere SS, RajaRajeswari P, Ganesan V (2021) Retrieval of frequent itemset using improved mining algorithm in Hadoop. Singapore, 787\u2013798. https:\/\/doi.org\/10.1007\/978-981-15-5148-2_68","DOI":"10.1007\/978-981-15-5148-2_68"},{"key":"14484_CR38","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1016\/j.asoc.2017.09.013","volume":"62","author":"L Wang","year":"2018","unstructured":"Wang L, Meng J, Xu P, Peng K (2018) Mining temporal association rules with frequent itemsets tree. Appl Soft Comput 62:817\u2013829. https:\/\/doi.org\/10.1016\/j.asoc.2017.09.013","journal-title":"Appl Soft Comput"},{"key":"14484_CR39","doi-asserted-by":"publisher","unstructured":"Wang G, Cong G, Zhang Y, Hai Z, Ye J (2021) A synopsis based approach for Itemset frequency estimation over massive multi-transaction stream. ACM Trans Knowl Discov Data 16(2):29:1-29:30. https:\/\/doi.org\/10.1145\/3465238","DOI":"10.1145\/3465238"},{"key":"14484_CR40","doi-asserted-by":"publisher","unstructured":"Wu N, Zou Y, Shan C (2021) A frequent Itemset mining method based on local differential privacy. In International Conference on Web Information Systems and Applications Springer, 225-236. https:\/\/doi.org\/10.1007\/978-3-030-87571-8_20","DOI":"10.1007\/978-3-030-87571-8_20"},{"issue":"3","key":"14484_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3480245","volume":"16","author":"Y Wu","year":"2022","unstructured":"Wu Y, Luo L, Li Y, Guo L, Fournier-Viger P, Zhu X, Wu X (2022) NTP-miner: nonoverlapping three-way sequential pattern mining. ACM Trans Knowl Discov Data 16(3):1\u201321. https:\/\/doi.org\/10.1145\/3480245","journal-title":"ACM Trans Knowl Discov Data"},{"key":"14484_CR42","doi-asserted-by":"publisher","first-page":"102738","DOI":"10.1016\/j.parco.2020.102738","volume":"101","author":"Y Xun","year":"2021","unstructured":"Xun Y, Zhang J, Yang H, Qin X (2021) HBPFP-DC: a parallel frequent itemset mining using spark. Parallel Comput 101:102738. https:\/\/doi.org\/10.1016\/j.parco.2020.102738","journal-title":"Parallel Comput"},{"issue":"1","key":"14484_CR43","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s10844-019-00590-9","volume":"55","author":"Y Yamamoto","year":"2020","unstructured":"Yamamoto Y, Tabei Y, Iwanuma K (2020) PARASOL: a hybrid approximation approach for scalable frequent itemset mining in streaming data. J Intell Inf Syst 55(1):119\u2013147. https:\/\/doi.org\/10.1007\/s10844-019-00590-9","journal-title":"J Intell Inf Syst"},{"issue":"4","key":"14484_CR44","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/s00530-020-00725-x","volume":"27","author":"M Yimin","year":"2021","unstructured":"Yimin M, Junhao G, Mwakapesa DS, Nanehkaran YA, Chi Z, Xiaoheng D, Zhigang C (2021) PFIMD: a parallel MapReduce-based algorithm for frequent itemset mining. Multimedia Systems 27(4):709\u2013722. https:\/\/doi.org\/10.1007\/s00530-020-00725-x","journal-title":"Multimedia Systems"},{"issue":"2","key":"14484_CR45","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1007\/s11227-017-2049-z","volume":"75","author":"R Zhang","year":"2019","unstructured":"Zhang R, Chen W, Hsu T-C, Yang H, Chung Y-C (2019) ANG: a combination of Apriori and graph computing techniques for frequent itemsets mining. J Supercomput 75(2):646\u2013661. https:\/\/doi.org\/10.1007\/s11227-017-2049-z","journal-title":"J Supercomput"},{"issue":"11","key":"14484_CR46","doi-asserted-by":"publisher","first-page":"3003","DOI":"10.1007\/s13042-018-00918-x","volume":"10","author":"C Zhang","year":"2019","unstructured":"Zhang C, Tian P, Zhang X, Liao Q, Jiang ZL, Wang X (2019) HashEclat: an efficient frequent itemset algorithm. Int J Mach Learn & Cyber 10(11):3003\u20133016. https:\/\/doi.org\/10.1007\/s13042-018-00918-x","journal-title":"Int J Mach Learn & Cyber"},{"issue":"2","key":"14484_CR47","doi-asserted-by":"publisher","first-page":"3948","DOI":"10.1109\/JIOT.2018.2885851","volume":"6","author":"C Zhang","year":"2019","unstructured":"Zhang C, Tian P, Zhang X, Jiang ZL, Yao L, Wang X (2019) Fast Eclat algorithms based on Minwise hashing for large scale transactions. IEEE Internet Things J 6(2):3948\u20133961. https:\/\/doi.org\/10.1109\/JIOT.2018.2885851","journal-title":"IEEE Internet Things J"},{"key":"14484_CR48","doi-asserted-by":"publisher","unstructured":"Zhao X, Ning SY (2021) Improved algorithm of multiple minimum support association rules based on can tree 206\u2013213. https:\/\/doi.org\/10.1007\/978-3-030-92632-8_20","DOI":"10.1007\/978-3-030-92632-8_20"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-023-14484-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11042-023-14484-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-023-14484-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,27]],"date-time":"2023-06-27T09:29:08Z","timestamp":1687858148000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11042-023-14484-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,16]]},"references-count":48,"journal-issue":{"issue":"18","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["14484"],"URL":"https:\/\/doi.org\/10.1007\/s11042-023-14484-0","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"value":"1380-7501","type":"print"},{"value":"1573-7721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,16]]},"assertion":[{"value":"13 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 April 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}