{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T16:31:04Z","timestamp":1780504264675,"version":"3.54.1"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"15","license":[{"start":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T00:00:00Z","timestamp":1624233600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T00:00:00Z","timestamp":1624233600000},"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":["Soft Comput"],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1007\/s00500-021-05973-1","type":"journal-article","created":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T03:32:21Z","timestamp":1624246341000},"page":"10237-10256","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["A meta-heuristic density-based subspace clustering algorithm for high-dimensional data"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2262-0721","authenticated-orcid":false,"given":"Parul","family":"Agarwal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shikha","family":"Mehta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ajith","family":"Abraham","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,6,21]]},"reference":[{"key":"5973_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-10674-4","volume-title":"Feature selection and enhanced krill herd algorithm for text document clustering","author":"LMQ Abualigah","year":"2019","unstructured":"Abualigah LMQ (2019) Feature selection and enhanced krill herd algorithm for text document clustering. Springer"},{"key":"5973_CR2","doi-asserted-by":"publisher","DOI":"10.3390\/a13120345","author":"L Abualigah","year":"2020","unstructured":"Abualigah L, Gandomi AH, Elaziz MA, Hussien AG, Khasawneh AM, Alshinwan M, Houssein EH (2020) Nature-inspired optimization algorithms for text document clustering: a comprehensive analysis. Algorithms. https:\/\/doi.org\/10.3390\/a13120345","journal-title":"Algorithms"},{"key":"5973_CR3","doi-asserted-by":"publisher","first-page":"1609","DOI":"10.1016\/j.cma.2020.113609","volume":"376","author":"L Abualigah","year":"2021","unstructured":"Abualigah L, Diabat A, Mirjalili S, Abd Elaziz M, Gandomi AH (2021a) The arithmetic optimization algorithm. Comput Methods Appl Mech Eng 376:1609. https:\/\/doi.org\/10.1016\/j.cma.2020.113609","journal-title":"Comput Methods Appl Mech Eng"},{"key":"5973_CR4","doi-asserted-by":"publisher","DOI":"10.3390\/electronics10020101","author":"L Abualigah","year":"2021","unstructured":"Abualigah L, Gandomi AH, Elaziz MA, Hamad HA, Omari M, Alshinwan M, Khasawneh AM (2021b) Advances in meta-heuristic optimization algorithms in big data text clustering. Electronics. https:\/\/doi.org\/10.3390\/electronics10020101","journal-title":"Electronics"},{"issue":"14","key":"5973_CR5","doi-asserted-by":"publisher","first-page":"14","DOI":"10.5120\/17593-8331","volume":"100","author":"P Agarwal","year":"2014","unstructured":"Agarwal P, Mehta S (2014) Nature-inspired algorithms: state-of-art, problems and prospects. International Journal of Computer Applications 100(14):14\u201321. https:\/\/doi.org\/10.5120\/17593-8331","journal-title":"International Journal of Computer Applications"},{"key":"5973_CR6","doi-asserted-by":"crossref","unstructured":"Agarwal P, Mehta S (2015) Comparative analysis of nature inspired algorithms on data clustering. In: IEEE international conference on research in computational intelligence and communication networks (ICRCICN), pp 119\u2013124","DOI":"10.1109\/ICRCICN.2015.7434221"},{"key":"5973_CR7","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1080\/1206212X.2016.1224401","volume":"7074","author":"P Agarwal","year":"2016","unstructured":"Agarwal P, Mehta S (2016) Enhanced flower pollination algorithm on data clustering. Int J Comput Appl 7074:144\u2013155. https:\/\/doi.org\/10.1080\/1206212X.2016.1224401","journal-title":"Int J Comput Appl"},{"key":"5973_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-017-9547-5","author":"P Agarwal","year":"2017","unstructured":"Agarwal P, Mehta S (2017) Empirical analysis of five nature-inspired algorithms on real parameter optimization problems. Artif Intell Rev. https:\/\/doi.org\/10.1007\/s10462-017-9547-5","journal-title":"Artif Intell Rev"},{"issue":"1","key":"5973_CR9","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1504\/ijbic.2018.10014476","volume":"14","author":"P Agarwal","year":"2019","unstructured":"Agarwal P, Mehta S (2019a) ABC_DE_FP: a novel hybrid algorithm for complex continuous optimisation problems. Int J Bio Inspired Comput 14(1):46\u201361. https:\/\/doi.org\/10.1504\/ijbic.2018.10014476","journal-title":"Int J Bio Inspired Comput"},{"key":"5973_CR10","doi-asserted-by":"publisher","unstructured":"Agarwal P, Mehta S (2019b) Subspace clustering of high dimensional data using differential evolution. In: Nature-inspired algorithms for big data frameworks, pp 47\u201374, IGI Global. https:\/\/doi.org\/10.4018\/978-1-5225-5852-1.ch003","DOI":"10.4018\/978-1-5225-5852-1.ch003"},{"key":"5973_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/304181.304188","volume":"28","author":"C Aggarwal","year":"1999","unstructured":"Aggarwal C, Wolf J, Yu P, Procopiuc C, Park J (1999) Fast algorithm for projected clustering. SIGMOD 28:61\u201372","journal-title":"SIGMOD"},{"key":"5973_CR12","first-page":"307","volume":"12","author":"R Agrawal","year":"1996","unstructured":"Agrawal R, Mannila H, Srikant R, Toivonen H, Verkamo A (1996) Fast discovery of association rules. Adv Knowl Discov Data Min 12:307\u2013328","journal-title":"Adv Knowl Discov Data Min"},{"issue":"4","key":"5973_CR13","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1002\/widm.1062","volume":"2","author":"I Assent","year":"2012","unstructured":"Assent I (2012) Clustering high dimensional data. Wiley Interdiscip Rev Data Min Knowl Discov 2(4):340\u2013350. https:\/\/doi.org\/10.1002\/widm.1062","journal-title":"Wiley Interdiscip Rev Data Min Knowl Discov"},{"key":"5973_CR14","doi-asserted-by":"crossref","unstructured":"Assent I, Krieger R, Muller E, Seidl T (2008) INSCY: indexing subspace clusters with in-process-removal of redundancy. In: ICDM, pp 719\u2013724","DOI":"10.1109\/ICDM.2008.46"},{"key":"5973_CR15","unstructured":"Bache K, Lichman M (2006) UCI machine learning repository. http:\/\/archive.ics.uci.edu\/ml"},{"issue":"1810","key":"5973_CR16","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/3-540-45164-1_8","volume":"2000","author":"P Brazdil","year":"2000","unstructured":"Brazdil P, Soares C (2000) A comparison of ranking methods for classification algorithm selection. Mach Learn ECML 2000(1810):63\u201375. https:\/\/doi.org\/10.1007\/3-540-45164-1_8","journal-title":"Mach Learn ECML"},{"key":"5973_CR17","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0169-7439(01)00111-3","volume":"56","author":"M Daszykowski","year":"2001","unstructured":"Daszykowski M, Walczak B, Massart DL (2001) Looking for natural patterns in data: Part 1. density-based approach. Chemom Intell Lab Syst 56:83\u201392","journal-title":"Chemom Intell Lab Syst"},{"key":"5973_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jecp.2010.03.005","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar J (2006) Statistical Comparisons of Classifiers over Multiple Data Sets. J Mach Learn Res 7:1\u201330. https:\/\/doi.org\/10.1016\/j.jecp.2010.03.005","journal-title":"J Mach Learn Res"},{"key":"5973_CR19","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.ins.2016.01.101","volume":"348","author":"Z Deng","year":"2016","unstructured":"Deng Z, Choi KS, Jiang Y, Wang J, Wang S (2016) A survey on soft subspace clustering. Inf Sci 348:84\u2013106. https:\/\/doi.org\/10.1016\/j.ins.2016.01.101","journal-title":"Inf Sci"},{"key":"5973_CR20","doi-asserted-by":"crossref","unstructured":"Domeniconi C, Papadopoulos D, Gunopulos D, Ma S (2004) Subspace clustering of high dimensional data. In: SIAM international conference on data mining, pp 31\u201340","DOI":"10.1137\/1.9781611972740.58"},{"issue":"3","key":"5973_CR21","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1109\/TETC.2014.2330519","volume":"2","author":"A Fahad","year":"2014","unstructured":"Fahad A, Alshatri N, Tari Z, Alamri A, Khalil I, Zomaya AY, Foufou S, Bouras A (2014) A survey of clustering algorithms for big data: Taxonomy and empirical analysis. IEEE Trans Emerg Top Comput 2(3):267\u2013279. https:\/\/doi.org\/10.1109\/TETC.2014.2330519","journal-title":"IEEE Trans Emerg Top Comput"},{"key":"5973_CR22","doi-asserted-by":"crossref","unstructured":"Kailing K, Kriegel HP, Oger PK (2004) Density-connected subspace clustering for high-dimensional data. In: SDM, pp 246\u2013257","DOI":"10.1137\/1.9781611972740.23"},{"issue":"3","key":"5973_CR23","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D Karaboga","year":"2007","unstructured":"Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Global Optim 39(3):459\u2013471. https:\/\/doi.org\/10.1007\/s10898-007-9149-x","journal-title":"J Global Optim"},{"issue":"7","key":"5973_CR24","first-page":"1","volume":"91","author":"A Karami","year":"2014","unstructured":"Karami A, Johansson R (2014) Choosing DBSCAN parameters automatically using differential evolution. Int J Comput Appl 91(7):1\u201311","journal-title":"Int J Comput Appl"},{"key":"5973_CR25","doi-asserted-by":"publisher","unstructured":"Kaur A, Datta A (2014) SUBSCALE: fast and scalable subspace clustering for high dimensional data. In: IEEE international conference on data mining workshops, ICDM, pp 621\u2013628. https:\/\/doi.org\/10.1109\/ICDMW.2014.100","DOI":"10.1109\/ICDMW.2014.100"},{"issue":"1","key":"5973_CR26","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1186\/s40537-015-0027-y","volume":"2","author":"A Kaur","year":"2015","unstructured":"Kaur A, Datta A (2015) A novel algorithm for fast and scalable subspace clustering of high-dimensional data. J Big Data 2(1):17. https:\/\/doi.org\/10.1186\/s40537-015-0027-y","journal-title":"J Big Data"},{"key":"5973_CR27","doi-asserted-by":"crossref","unstructured":"Kriegel HP, Kroger P, Renz M, Wurst S (2005) A generic framework for efficient subspace clustering of high-dimensional data. In: ICDM, pp 250\u2013257","DOI":"10.1109\/ICDM.2005.5"},{"issue":"1","key":"5973_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1497577.1497578","volume":"3","author":"H-P Kriegel","year":"2009","unstructured":"Kriegel H-P, Kr\u00f6ger P, Zimek A (2009) Clustering high-dimensional data: a survey on subspace clustering, pattern-based clustering, and correlation clustering. ACM Trans Knowl Discov Data 3(1):1\u201358. https:\/\/doi.org\/10.1145\/1497577.1497578","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"10","key":"5973_CR29","doi-asserted-by":"publisher","first-page":"2372","DOI":"10.1109\/TCYB.2015.2477416","volume":"46","author":"D Kumar","year":"2016","unstructured":"Kumar D, Bezdek JC, Palaniswami M, Rajasegarar S, Leckie C, Havens TC (2016) A hybrid approach to clustering in big data. IEEE Trans Cybern 46(10):2372\u20132385. https:\/\/doi.org\/10.1109\/TCYB.2015.2477416","journal-title":"IEEE Trans Cybern"},{"key":"5973_CR30","doi-asserted-by":"publisher","unstructured":"Lin L, Gen M, Liang Y (2014) A hybrid EA for high-dimensional subspace clustering problem. In: Proceedings of the 2014 IEEE congress on evolutionary computation, CEC 2014, pp 2855\u20132860. https:\/\/doi.org\/10.1109\/CEC.2014.6900313","DOI":"10.1109\/CEC.2014.6900313"},{"key":"5973_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-020-04865-0","author":"X Liu","year":"2020","unstructured":"Liu X, Wang J, Cheng D, Shi D, Zhang Y (2020) Non-convex low-rank representation combined with rank-one matrix sum for subspace clustering. Soft Comput. https:\/\/doi.org\/10.1007\/s00500-020-04865-0","journal-title":"Soft Comput"},{"issue":"1","key":"5973_CR32","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s10994-009-5154-2","volume":"82","author":"Y Lu","year":"2011","unstructured":"Lu Y, Wang S, Li S, Zhou C (2011) Particle swarm optimizer for variable weighting in clustering high-dimensional data. Mach Learn 82(1):43\u201370. https:\/\/doi.org\/10.1007\/s10994-009-5154-2","journal-title":"Mach Learn"},{"key":"5973_CR33","doi-asserted-by":"crossref","unstructured":"Moise G, Sander J (2008) Finding non-redundant, statistically significant regions in high dimensional data: a novel approach to projected and subspace clustering. In: KDD, pp 533\u2013541.","DOI":"10.1145\/1401890.1401956"},{"key":"5973_CR34","doi-asserted-by":"crossref","unstructured":"Moise G, Sander J, Ester M (2006) P3C: a robust projected clustering algorithm. In: ICDM, pp 414\u2013425","DOI":"10.1109\/ICDM.2006.123"},{"key":"5973_CR35","doi-asserted-by":"crossref","unstructured":"M\u00fcller E G\u00fcnnemann S, Assent I, Seidl T, F\u00e4rber I (2009) Evaluating clustering in subspace projections of high dimensional data. http:\/\/dme.rwth-aachen.de\/en\/OpenSubspace\/evaluation","DOI":"10.14778\/1687627.1687770"},{"issue":"1","key":"5973_CR36","doi-asserted-by":"publisher","first-page":"1270","DOI":"10.14778\/1687627.1687770","volume":"2","author":"E M\u00fcller","year":"2009","unstructured":"M\u00fcller E, G\u00fcnnemann S, Assent I, Seidl T (2009b) Evaluating clustering in subspace projections of high dimensional data. Proc VLDB Endow 2(1):1270\u20131281","journal-title":"Proc VLDB Endow"},{"issue":"1","key":"5973_CR37","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/1007730.1007731","volume":"6","author":"L Parsons","year":"2004","unstructured":"Parsons L, Haque E, Liu H (2004) Subspace clustering for high dimensional data: a review. ACM SIGKDD Explor Newsl 6(1):90\u2013105. https:\/\/doi.org\/10.1145\/1007730.1007731","journal-title":"ACM SIGKDD Explor Newsl"},{"key":"5973_CR38","doi-asserted-by":"publisher","first-page":"1830","DOI":"10.1016\/j.jcp.2007.06.008","volume":"226","author":"I Pavlyukevich","year":"2007","unstructured":"Pavlyukevich I (2007) L\u00e9vy Flight, non local search and simulated annealing. J Comput Phys 226:1830\u20131844. https:\/\/doi.org\/10.1016\/j.jcp.2007.06.008","journal-title":"J Comput Phys"},{"issue":"2002","key":"5973_CR39","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/j.patrec.2018.07.003","volume":"112","author":"A Pesevski","year":"2018","unstructured":"Pesevski A, Franczak BC, McNicholas PD (2018) Subspace clustering with the multivariate-t distribution. Pattern Recogn Lett 112(2002):297\u2013302. https:\/\/doi.org\/10.1016\/j.patrec.2018.07.003","journal-title":"Pattern Recogn Lett"},{"key":"5973_CR40","doi-asserted-by":"crossref","unstructured":"Procopiuc CEA (2002) A monte carlo algorithm for fast projective clustering. In: SIGMOD, pp 418\u2013427","DOI":"10.1145\/564691.564739"},{"key":"5973_CR41","doi-asserted-by":"publisher","unstructured":"Road H, Jose S (1998) Automatic subspace clustering mining of high dimensional applications for data. In: Proceedings of the 1998 ACM SIGMOD international conference on management of data, 27, pp 94\u2013105. https:\/\/doi.org\/10.1145\/276305.276314","DOI":"10.1145\/276305.276314"},{"key":"5973_CR42","doi-asserted-by":"publisher","unstructured":"Sarafis IA, Trinder PW, Zalzala AMS (2003) Towards effective subspace clustering with an evolutionary algorithm. In: 2003 congress on evolutionary computation, CEC 2003 - proceedings, 2, pp 797\u2013806. https:\/\/doi.org\/10.1109\/CEC.2003.1299749","DOI":"10.1109\/CEC.2003.1299749"},{"key":"5973_CR43","doi-asserted-by":"crossref","unstructured":"Sequeira K, Zaki M (2004) SCHISM: a new approach for interesting subspace mining. In: ICDM, pp 186\u2013193","DOI":"10.1109\/ICDM.2004.10099"},{"key":"5973_CR44","unstructured":"Steinbach M, Ertoz L, Kumar V (2003) The challenges of clustering high dimensional data. In: New vistas in statistical physics, applications in econophysics, bioinformatics, and pattern recognition, pp 1\u201333"},{"key":"5973_CR45","doi-asserted-by":"publisher","unstructured":"Steinbach M, Levent E, Kumar V (2004) The challenges of clustering high dimensional data. In: New vistas in statistical physics, applications in econophysics, bioinformatics, and pattern recognition, pp 273\u2013309. https:\/\/doi.org\/10.1007\/978-3-662-08968-2_16","DOI":"10.1007\/978-3-662-08968-2_16"},{"key":"5973_CR46","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution \u2013 a simple and efficient heutistic for global optimization over continuous spaces. J Global Optim 11:341\u2013359","journal-title":"J Global Optim"},{"issue":"4","key":"5973_CR47","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.3758\/s13428-013-0329-y","volume":"45","author":"ME Timmerman","year":"2013","unstructured":"Timmerman ME, Ceulemans E, De Roover K, Van Leeuwen K (2013) Subspace K-means clustering. Behav Res Methods 45(4):1011\u20131023. https:\/\/doi.org\/10.3758\/s13428-013-0329-y","journal-title":"Behav Res Methods"},{"key":"5973_CR48","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/j.patrec.2019.01.016","volume":"130","author":"F Yan","year":"2020","unstructured":"Yan F, Wang XD, Zeng ZQ, Hong CQ (2020) Adaptive multi-view subspace clustering for high-dimensional data. Pattern Recognit Lett 130:299\u2013305. https:\/\/doi.org\/10.1016\/j.patrec.2019.01.016","journal-title":"Pattern Recognit Lett"},{"key":"5973_CR49","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-32894-7_27","volume":"7445","author":"X-SS Yang","year":"2012","unstructured":"Yang X-SS (2012a) Flower pollination algorithm for global optimization. Unconvent Comput Nat Comput 7445:240\u2013249. https:\/\/doi.org\/10.1007\/978-3-642-32894-7_27","journal-title":"Unconvent Comput Nat Comput"},{"key":"5973_CR50","doi-asserted-by":"publisher","unstructured":"Yang XS (2012). Flower pollination algorithm for global optimization. In: Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics), 7445 LNCS, pp 240\u2013249. https:\/\/doi.org\/10.1007\/978-3-642-32894-7_27","DOI":"10.1007\/978-3-642-32894-7_27"},{"key":"5973_CR51","unstructured":"Yiu ML, Mamoulis N (2003) Frequent-pattern based iterative projected clustering. In: ICDM, pp 689\u2013692"},{"issue":"16","key":"5973_CR52","doi-asserted-by":"publisher","first-page":"7005","DOI":"10.1007\/s00500-018-3339-y","volume":"23","author":"X Zhao","year":"2019","unstructured":"Zhao X, An G, Cen Y, Wang H, Zhao R (2019) Robust discriminant low-rank representation for subspace clustering. Soft Comput 23(16):7005\u20137013. https:\/\/doi.org\/10.1007\/s00500-018-3339-y","journal-title":"Soft Comput"},{"key":"5973_CR53","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.105512","volume":"193","author":"G Zhong","year":"2020","unstructured":"Zhong G, Pun CM (2020) Subspace clustering by simultaneously feature selection and similarity learning. Knowl-Based Syst 193:105512. https:\/\/doi.org\/10.1016\/j.knosys.2020.105512","journal-title":"Knowl-Based Syst"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-05973-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-021-05973-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-021-05973-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,14]],"date-time":"2021-07-14T11:20:14Z","timestamp":1626261614000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-021-05973-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,21]]},"references-count":53,"journal-issue":{"issue":"15","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["5973"],"URL":"https:\/\/doi.org\/10.1007\/s00500-021-05973-1","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,21]]},"assertion":[{"value":"11 June 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All author declares that he\/she has no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}