{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:54:36Z","timestamp":1775285676335,"version":"3.50.1"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"21","license":[{"start":{"date-parts":[[2018,11,26]],"date-time":"2018-11-26T00:00:00Z","timestamp":1543190400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s00500-018-3655-2","type":"journal-article","created":{"date-parts":[[2018,11,26]],"date-time":"2018-11-26T08:45:44Z","timestamp":1543221944000},"page":"11001-11013","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An unsupervised learning approach for multilayer perceptron networks"],"prefix":"10.1007","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8315-1813","authenticated-orcid":false,"given":"Edwin","family":"Aldana-Bobadila","sequence":"first","affiliation":[]},{"given":"Angel","family":"Kuri-Morales","sequence":"additional","affiliation":[]},{"given":"Ivan","family":"Lopez-Arevalo","sequence":"additional","affiliation":[]},{"given":"Ana B.","family":"Rios-Alvarado","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,26]]},"reference":[{"issue":"3","key":"3655_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0893-6080(90)90071-R","volume":"3","author":"SC Ahalt","year":"1990","unstructured":"Ahalt SC, Krishnamurthy AK, Chen P, Melton DE (1990) Competitive learning algorithms for vector quantization. Neural Netw 3(3):277\u2013290","journal-title":"Neural Netw"},{"key":"3655_CR2","first-page":"353","volume-title":"Finding the optimal sample based on Shannon\u2019s entropy and genetic algorithms","author":"E Aldana-Bobadilla","year":"2015","unstructured":"Aldana-Bobadilla E, Alfaro-P\u00e9rez C (2015) Finding the optimal sample based on Shannon\u2019s entropy and genetic algorithms. Springer, Cham, pp 353\u2013363"},{"issue":"1","key":"3655_CR3","doi-asserted-by":"publisher","first-page":"175","DOI":"10.3390\/e17010151","volume":"17","author":"E Aldana-Bobadilla","year":"2015","unstructured":"Aldana-Bobadilla E, Kuri-Morales A (2015) A clustering method based on the maximum entropy principle. Entropy 17(1):175","journal-title":"Entropy"},{"key":"3655_CR4","doi-asserted-by":"crossref","unstructured":"Ba\u00e7 ao F, Lobo V, Painho M (2005) Self-organizing maps as substitutes for k-means clustering. In: International conference on computational science, pp 476\u2013483. Springer","DOI":"10.1007\/11428862_65"},{"issue":"2","key":"3655_CR5","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1287\/ijoc.6.2.126","volume":"6","author":"R Battiti","year":"1994","unstructured":"Battiti R, Tecchiolli G (1994) The reactive Tabu search. ORSA J Comput 6(2):126\u2013140","journal-title":"ORSA J Comput"},{"key":"3655_CR6","doi-asserted-by":"publisher","first-page":"241","DOI":"10.2307\/2348448","volume":"44","author":"SP Brooks","year":"1995","unstructured":"Brooks SP, Morgan BJT (1995) Optimization using simulated annealing. The Statistician 44:241\u2013257","journal-title":"The Statistician"},{"key":"3655_CR7","unstructured":"Burkardt J (2009) K-means clustering. In: Virginia Tech, Advanced research computing, Interdisciplinary Center for Applied Mathematics"},{"issue":"10","key":"3655_CR8","doi-asserted-by":"publisher","first-page":"1718","DOI":"10.1175\/1520-0442(2000)013<1718:USOMTI>2.0.CO;2","volume":"13","author":"T Cavazos","year":"2000","unstructured":"Cavazos T (2000) Using self-organizing maps to investigate extreme climate events: an application to wintertime precipitation in the Balkans. J Clim 13(10):1718\u20131732","journal-title":"J Clim"},{"issue":"2","key":"3655_CR9","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-642-16339-5_35","volume":"3","author":"Y Chen","year":"2010","unstructured":"Chen Y, Qin B, Liu T, Liu Y, Li S (2010) The comparison of SOM and k-means for text clustering. Comput Inf Sci 3(2):268","journal-title":"Comput Inf Sci"},{"key":"3655_CR10","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1109\/TPAMI.1979.4766909","volume":"2","author":"DL Davies","year":"1979","unstructured":"Davies DL, Bouldin DW (1979) A cluster separation measure. IEEE Trans Pattern Anal Mach Intell 2:224\u2013227","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"4","key":"3655_CR11","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s00248-001-0027-7","volume":"42","author":"SL Dollhopf","year":"2001","unstructured":"Dollhopf SL, Hashsham SA, Tiedje JM (2001) Interpreting 16S rDNA T-RFLP data: application of self-organizing maps and principal component analysis to describe community dynamics and convergence. Microb Ecol 42(4):495\u2013505","journal-title":"Microb Ecol"},{"issue":"4","key":"3655_CR12","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/MCI.2006.329691","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization. IEEE Comput Intell Mag 1(4):28\u201339","journal-title":"IEEE Comput Intell Mag"},{"key":"3655_CR13","volume-title":"Metaheuristics for hard optimization: methods and case studies","author":"J Dr\u00e9o","year":"2006","unstructured":"Dr\u00e9o J et al (2006) Metaheuristics for hard optimization: methods and case studies. Springer, Berlin"},{"key":"3655_CR14","unstructured":"Dua D, Karra Taniskidou E (2017) UCI machine learning repository. University of California, School of Information and Computer Science, Irvine, CA. http:\/\/archive.ics.uci.edu\/ml"},{"key":"3655_CR15","volume-title":"Well-separated clusters and optimal fuzzy partitions","author":"JC Dunn","year":"1974","unstructured":"Dunn JC (1974) Well-separated clusters and optimal fuzzy partitions, vol 4. Taylor & Francis, Abingdon"},{"key":"3655_CR16","doi-asserted-by":"crossref","unstructured":"Eick CF, Zeidat N, Zhao Z (2004) Supervised clustering-algorithms and benefits. In: Tools with artificial intelligence. 16th IEEE international conference on artificial intelligence, pp 774\u2013776. IEEE","DOI":"10.1109\/ICTAI.2004.111"},{"key":"3655_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1665-5","volume-title":"Handbook of metaheuristics","author":"M Gendreau","year":"2010","unstructured":"Gendreau M, Jean-Yves P (2010) Handbook of metaheuristics, vol 2. Springer, New York"},{"issue":"1","key":"3655_CR18","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1023\/A:1006554906681","volume":"12","author":"SAH Geritz","year":"1998","unstructured":"Geritz SAH, Mesze G, Metz JAJ et al (1998) Evolutionarily singular strategies and the adaptive growth and branching of the evolutionary tree. Evol Ecol 12(1):35\u201357","journal-title":"Evol Ecol"},{"issue":"3","key":"3655_CR19","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search\u2014part I. ORSA J Comput 1(3):190\u2013206","journal-title":"ORSA J Comput"},{"issue":"2","key":"3655_CR20","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1023\/A:1022602019183","volume":"3","author":"DE Goldberg","year":"1988","unstructured":"Goldberg DE, Holland JH (1988) Genetic algorithms and machine learning. Mach Learn 3(2):95\u201399","journal-title":"Mach Learn"},{"key":"3655_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7970-4","volume-title":"Entropy and information theory","author":"RM Gray","year":"2011","unstructured":"Gray RM (2011) Entropy and information theory. Springer, Berlin"},{"issue":"1","key":"3655_CR22","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/TSMC.1986.289288","volume":"16","author":"JJ Grefenstette","year":"1986","unstructured":"Grefenstette JJ (1986) Optimization of control parameters for genetic algorithms. IEEE Trans Syst Man Cybern 16(1):122\u2013128","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"3655_CR23","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF02551274","volume":"4","author":"G Gybenko","year":"1989","unstructured":"Gybenko G (1989) Approximation by superposition of sigmoidal functions. Math Control Signals Syst 4:303\u2013314","journal-title":"Math Control Signals Syst"},{"key":"3655_CR24","volume-title":"On clustering validation techniques","author":"M Halkidi","year":"2001","unstructured":"Halkidi M, Batistakis Y, Vazirgiannis M (2001) On clustering validation techniques, vol 17. Springer, Berlin"},{"issue":"1","key":"3655_CR25","first-page":"100","volume":"28","author":"JA Hartigan","year":"1979","unstructured":"Hartigan JA, Wong MA (1979) Algorithm as 136: a k-means clustering algorithm. J R Stat Soc Ser C Appl Stat 28(1):100\u2013108","journal-title":"J R Stat Soc Ser C Appl Stat"},{"key":"3655_CR26","volume-title":"Neural networks and learning machines","author":"SS Haykin","year":"2009","unstructured":"Haykin SS, Haykin SS, Haykin SS, Haykin SS (2009) Neural networks and learning machines, vol 3. Pearson, Upper Saddle River"},{"issue":"1","key":"3655_CR27","doi-asserted-by":"publisher","first-page":"13","DOI":"10.3354\/cr022013","volume":"22","author":"BC Hewitson","year":"2002","unstructured":"Hewitson BC, Crane RG (2002) Self-organizing maps: applications to synoptic climatology. Clim Res 22(1):13\u201326","journal-title":"Clim Res"},{"key":"3655_CR28","first-page":"4","volume":"97","author":"T Honkela","year":"1997","unstructured":"Honkela T, Kaski S, Lagus K, Kohonen T (1997) WEBSOM\u2014self-organizing maps of document collections. Proc WSOM 97:4\u20136","journal-title":"Proc WSOM"},{"key":"3655_CR29","doi-asserted-by":"crossref","unstructured":"Jiang H, Liu Y, Zheng L (2010) Design and simulation of simulated annealing algorithm with harmony search. In: International conference in swarm intelligence. Springer, Berlin, pp 454\u2013460","DOI":"10.1007\/978-3-642-13498-2_59"},{"key":"3655_CR30","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1007\/978-0-387-30164-8_630","volume-title":"Encyclopedia of machine learning","author":"J Kennedy","year":"2011","unstructured":"Kennedy J (2011) Particle swarm optimization. In: Sammut C, Webb GI (eds) Encyclopedia of machine learning. Springer, Berlin, pp 760\u2013766"},{"issue":"2","key":"3655_CR31","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/4235.687880","volume":"1","author":"J-H Kim","year":"1997","unstructured":"Kim J-H, Myung H (1997) Evolutionary programming techniques for constrained optimization problems. IEEE Trans Evol Comput 1(2):129\u2013140","journal-title":"IEEE Trans Evol Comput"},{"issue":"4598","key":"3655_CR32","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"key":"3655_CR33","doi-asserted-by":"crossref","unstructured":"Knops ZF, Maintz JBA, Viergever MA, Pluim JPW (2004) Registration using segment intensity remapping and mutual information. In: International conference on medical image computing and computer-assisted intervention. Springer, Berlin, pp 805\u2013812","DOI":"10.1007\/978-3-540-30135-6_98"},{"issue":"1\u20133","key":"3655_CR34","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/S0925-2312(98)00031-9","volume":"21","author":"T Kohonen","year":"1998","unstructured":"Kohonen T, Somervuo P (1998) Self-organizing maps of symbol strings. Neurocomputing 21(1\u20133):19\u201330","journal-title":"Neurocomputing"},{"key":"3655_CR35","first-page":"477","volume":"5","author":"F Kovacs","year":"2006","unstructured":"Kovacs F, Ivancsy R (2006) A novel cluster validity index: variance of the nearest neighbor distance. WSEAS Trans Comput 5:477\u2013483","journal-title":"WSEAS Trans Comput"},{"key":"3655_CR36","volume-title":"Genetic programming III: Darwinian invention and problem solving","author":"JR Koza","year":"1999","unstructured":"Koza JR (1999) Genetic programming III: Darwinian invention and problem solving, vol 3. Morgan Kaufmann, Burlington"},{"key":"3655_CR37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20859-1","volume-title":"Computational optimization, methods and algorithms","author":"S Koziel","year":"2011","unstructured":"Koziel S, Xin-She Y (2011) Computational optimization, methods and algorithms, vol 356. Springer, Berlin"},{"key":"3655_CR38","doi-asserted-by":"crossref","unstructured":"Kuri-Morales AF (2014) The best neural network architecture. In: Mexican international conference on artificial intelligence, pp 72\u201384. Springer","DOI":"10.1007\/978-3-319-13650-9_7"},{"key":"3655_CR39","unstructured":"Kuri-Morales AF (2015) Categorical encoding with neural networks and genetic algorithms. In: WSEAS proceedings of the 6th international conference on applied informatics and computing theory, pp\u00a0167\u2013175"},{"key":"3655_CR40","doi-asserted-by":"crossref","unstructured":"Kuri-Morales AF, Guti\u00e9rrez-Garc\u00eda J (2002) Penalty function methods for constrained optimization with genetic algorithms: a statistical analysis. In: Mexican international conference on artificial intelligence, pp 108\u2013117. Springer","DOI":"10.1007\/3-540-46016-0_12"},{"key":"3655_CR41","first-page":"1","volume":"21","author":"A Kuri-Morales","year":"2016","unstructured":"Kuri-Morales A (2016) Closed determination of the number of neurons in the hidden layer of a multi-layered perceptron network. Soft Comput 21:1\u201313","journal-title":"Soft Comput"},{"key":"3655_CR42","first-page":"1","volume-title":"Advances in soft computing and its applications","author":"A Kuri-Morales","year":"2013","unstructured":"Kuri-Morales A, Aldana-Bobadilla E (2013) The best genetic algorithm I. In: Gelbukh FCA, Gonz\u00e1lez M (eds) Advances in soft computing and its applications. Springer, Berlin, pp 1\u201315"},{"key":"3655_CR43","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-642-45111-9_2","volume-title":"Advances in soft computing and its applications","author":"AF Kuri-Morales","year":"2013","unstructured":"Kuri-Morales AF, Aldana-Bobadilla E, L\u00f3pez-Pe\u00f1a I (2013) The best genetic algorithm II. In: Gelbukh FCA, Gonz\u00e1lez M (eds) Advances in soft computing and its applications. Springer, Berlin, pp 16\u201329"},{"key":"3655_CR44","unstructured":"Kuri-Morales A, Quezada-Villegas C (1998) A universal eclectic genetic algorithm for constrained optimization. In: Proceedings of the 6th European congress on intelligent techniques and soft computing, vol 1, pp 518\u2013522"},{"key":"3655_CR45","doi-asserted-by":"crossref","unstructured":"Lei JZ, Ghorbani A (2004) Network intrusion detection using an improved competitive learning neural network. In: Second annual conference on communication networks and services research, 2004. Proceedings, pp 190\u2013197. IEEE","DOI":"10.1109\/DNSR.2004.1344728"},{"key":"3655_CR46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69432-8","volume-title":"Parameter setting in evolutionary algorithms","author":"FJ Lobo","year":"2007","unstructured":"Lobo FJ, Lima CF, Michalewicz Z (2007) Parameter setting in evolutionary algorithms, vol 54. Springer, Berlin"},{"key":"3655_CR47","unstructured":"MacQueen J et al (1967) Some methods for classification and analysis of multivariate observations. In: Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, vol 1, pp 281\u2013297. Oakland, CA, USA"},{"issue":"3","key":"3655_CR48","doi-asserted-by":"publisher","first-page":"1742","DOI":"10.1016\/j.ejor.2005.03.039","volume":"174","author":"SA Mingoti","year":"2006","unstructured":"Mingoti SA, Lima JO (2006) Comparing SOM neural network with fuzzy c-means, k-means and traditional hierarchical clustering algorithms. Eur J Oper Res 174(3):1742\u20131759","journal-title":"Eur J Oper Res"},{"key":"3655_CR49","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3927.001.0001","volume-title":"An introduction to genetic algorithms","author":"MF Mitchell","year":"1998","unstructured":"Mitchell MF (1998) An introduction to genetic algorithms. MIT Press, Cambridge"},{"key":"3655_CR50","unstructured":"Mitchell M, Forrest S, Holland JH (1992) The royal road for genetic algorithms: fitness landscapes and GA performance. In: Proceedings of the first European conference on artificial life, pp 245\u2013254"},{"key":"3655_CR51","unstructured":"Molga M, Smutnicki C (2005) Test functions for optimization needs. http:\/\/www.zsd.ict.pwr.wroc.pl\/files\/docs\/functions.pdf"},{"key":"3655_CR52","unstructured":"Pohlheim H (2012) GEATBX\u00ae\u2014the genetic and evolutionary algorithm toolbox for MATLAB\u00ae, 2007. http:\/\/www.geatbx.com\/ . Accessed 24 June 2016"},{"key":"3655_CR53","unstructured":"Powers DM (2011) Evaluation: from precision, recall and F-measure to ROC, informedness, markedness and correlation. Bioinfo Publications"},{"issue":"4","key":"3655_CR54","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF00203171","volume":"61","author":"H Ritter","year":"1989","unstructured":"Ritter H, Kohonen T (1989) Self-organizing semantic maps. Biol Cybern 61(4):241\u2013254","journal-title":"Biol Cybern"},{"issue":"1","key":"3655_CR55","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1109\/72.265964","volume":"5","author":"G Rudolph","year":"1994","unstructured":"Rudolph G (1994) Convergence analysis of canonical genetic algorithms. IEEE Trans Neural Netw 5(1):96\u2013101","journal-title":"IEEE Trans Neural Netw"},{"key":"3655_CR56","doi-asserted-by":"crossref","unstructured":"Spears WM, De Jong KA, B\u00e4ck T, Fogel DB, De Garis H (1993) An overview of evolutionary computation. In: European conference on machine learning, pp 442\u2013459","DOI":"10.1007\/3-540-56602-3_163"},{"issue":"4","key":"3655_CR57","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\u2014a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 11(4):341\u2013359","journal-title":"J Global Optim"},{"key":"3655_CR58","doi-asserted-by":"publisher","DOI":"10.1002\/9780470496916","volume-title":"Metaheuristics: from design to implementation","author":"E-G Talbi","year":"2009","unstructured":"Talbi E-G (2009) Metaheuristics: from design to implementation, vol 74. Wiley, New York"},{"key":"3655_CR59","unstructured":"Ultsch A (2007) Emergence in self-organizing feature maps. University Library of Bielefeld"},{"key":"3655_CR60","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-540-92910-9_19","volume-title":"Handbook of natural computing","author":"MM Hulle Van","year":"2012","unstructured":"Van Hulle MM (2012) Self-organizing maps. In: Rozenberg G, B\u00e4ck T, Kok JN (eds) Handbook of natural computing. Springer, Berlin, pp 585\u2013622"},{"issue":"4","key":"3655_CR61","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/BF01096412","volume":"3","author":"DJ White","year":"1993","unstructured":"White DJ, Anandalingam G (1993) A penalty function approach for solving bi-level linear programs. J Global Optim 3(4):397\u2013419","journal-title":"J Global Optim"},{"issue":"1","key":"3655_CR62","first-page":"45","volume":"10","author":"\u00d6 Yeniay","year":"2005","unstructured":"Yeniay \u00d6 (2005) Penalty function methods for constrained optimization with genetic algorithms. Math Comput Appl 10(1):45\u201356","journal-title":"Math Comput Appl"},{"key":"3655_CR63","unstructured":"Zha H, He X, Ding C, Gu M, Simon HD (2002) Spectral relaxation for k-means clustering. In: Advances in neural information processing systems, pp 1057\u20131064"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3655-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-018-3655-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3655-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:58:18Z","timestamp":1775282298000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-018-3655-2"}},"subtitle":["Learning driven by validity indices"],"short-title":[],"issued":{"date-parts":[[2018,11,26]]},"references-count":63,"journal-issue":{"issue":"21","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["3655"],"URL":"https:\/\/doi.org\/10.1007\/s00500-018-3655-2","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,26]]},"assertion":[{"value":"26 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"The authors declare that they have 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 the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}