{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T01:40:00Z","timestamp":1785548400249,"version":"3.56.0"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"17","license":[{"start":{"date-parts":[[2021,1,3]],"date-time":"2021-01-03T00:00:00Z","timestamp":1609632000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,3]],"date-time":"2021-01-03T00:00:00Z","timestamp":1609632000000},"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":["Neural Comput &amp; Applic"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s00521-020-05560-9","type":"journal-article","created":{"date-parts":[[2021,1,3]],"date-time":"2021-01-03T13:02:47Z","timestamp":1609678967000},"page":"11027-11041","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":97,"title":["S-shaped versus V-shaped transfer functions for binary Manta ray foraging optimization in feature selection problem"],"prefix":"10.1007","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0929-5928","authenticated-orcid":false,"given":"Kushal Kanti","family":"Ghosh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1375-777X","authenticated-orcid":false,"given":"Ritam","family":"Guha","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6968-2079","authenticated-orcid":false,"given":"Suman Kumar","family":"Bera","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3020-3947","authenticated-orcid":false,"given":"Neeraj","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8813-4086","authenticated-orcid":false,"given":"Ram","family":"Sarkar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,1,3]]},"reference":[{"key":"5560_CR1","volume-title":"Data mining: concepts and techniques","author":"J Han","year":"2011","unstructured":"Han J, Pei J, Kamber M (2011) Data mining: concepts and techniques. Elsevier, Amsterdam"},{"issue":"8","key":"5560_CR2","doi-asserted-by":"publisher","first-page":"1723","DOI":"10.1007\/s11517-020-02194-w","volume":"58","author":"KK Ghosh","year":"2020","unstructured":"Ghosh KK et al (2020) A two-stage approach towards protein secondary structure classification. Med Biol Eng Comput 58(8):1723\u20131737. https:\/\/doi.org\/10.1007\/s11517-020-02194-w","journal-title":"Med Biol Eng Comput"},{"issue":"4","key":"5560_CR3","doi-asserted-by":"publisher","first-page":"759","DOI":"10.2478\/amcs-2018-0058","volume":"28","author":"M Kowal","year":"2018","unstructured":"Kowal M, Skobel M, Nowicki N (2018) The feature selection problem in computer-assisted cytology. Int Jou Appl Math Comput Sci 28(4):759\u2013770. https:\/\/doi.org\/10.2478\/amcs-2018-0058","journal-title":"Int Jou Appl Math Comput Sci"},{"issue":"4","key":"5560_CR4","doi-asserted-by":"publisher","first-page":"803","DOI":"10.2478\/amcs-2018-0061","volume":"28","author":"G Borowik","year":"2018","unstructured":"Borowik G (2018) Optimization on the complementation procedure to- wards efficient implementation of the index generation function. Int J Appl Math Comput Sci 28(4):803\u2013815. https:\/\/doi.org\/10.2478\/amcs-2018-0061","journal-title":"Int J Appl Math Comput Sci"},{"key":"5560_CR5","doi-asserted-by":"publisher","DOI":"10.1201\/9780429342615","volume-title":"Machine learning in cognitive IoT","author":"N Kumar","year":"2020","unstructured":"Kumar N, Makkar A (2020) Machine learning in cognitive IoT. CRC Press, Boca Raton"},{"issue":"3","key":"5560_CR6","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1109\/tmm.2019.2893549","volume":"21","author":"S Garg","year":"2019","unstructured":"Garg S et al (2019) Hybrid deep-learning-based anomaly detection scheme for suspicious flow detection in SDN: a social multimedia perspective. IEEE Trans Multimed 21(3):566\u2013578. https:\/\/doi.org\/10.1109\/tmm.2019.2893549","journal-title":"IEEE Trans Multimed"},{"issue":"3","key":"5560_CR7","doi-asserted-by":"publisher","first-page":"924","DOI":"10.1109\/tnsm.2019.2927886","volume":"16","author":"S Garg","year":"2019","unstructured":"Garg S et al (2019) A hybrid deep learning-based model for anomaly de- tection in cloud datacenter networks. IEEE Trans Netw Serv Manag 16(3):924\u2013935. https:\/\/doi.org\/10.1109\/tnsm.2019.2927886","journal-title":"IEEE Trans Netw Serv Manag"},{"key":"5560_CR8","doi-asserted-by":"publisher","first-page":"100184","DOI":"10.1016\/j.vehcom.2019.100184","volume":"20","author":"A Miglani","year":"2019","unstructured":"Miglani A, Kumar N (2019) Deep learning models for traffic ow prediction in autonomous vehicles: a review, solutions, and challenges. Veh Commun 20:100184. https:\/\/doi.org\/10.1016\/j.vehcom.2019.100184","journal-title":"Veh Commun"},{"key":"5560_CR9","volume-title":"Feature selection for knowledge discovery and data mining","author":"H Liu","year":"2012","unstructured":"Liu H, Motoda H (2012) Feature selection for knowledge discovery and data mining, vol 454. Springer, Berlin"},{"key":"5560_CR10","doi-asserted-by":"publisher","unstructured":"Guha R et al. (2020) \u201cMutually informed correlation coefficient (MICC)\u2014a new filter based feature selection method. In: 2020 IEEE Calcutta Conference (CALCON), pp. 54\u201358. https:\/\/doi.org\/10.1109\/CALCON49167.2020.9106516","DOI":"10.1109\/CALCON49167.2020.9106516"},{"issue":"1","key":"5560_CR11","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s11517-018-1874-4","volume":"57","author":"M Ghosh","year":"2018","unstructured":"Ghosh M et al (2018) Genetic algorithm based cancerous gene identification from microarray data using ensemble of filter methods. Med Biol Eng Comput 57(1):159\u2013176. https:\/\/doi.org\/10.1007\/s11517-018-1874-4","journal-title":"Med Biol Eng Comput"},{"issue":"1","key":"5560_CR12","doi-asserted-by":"publisher","first-page":"151","DOI":"10.2478\/amcs-2019-0012","volume":"29","author":"M Blachnik","year":"2019","unstructured":"Blachnik M (2019) Ensembles of instance selection methods: a comparative study. Int J Appl Math Comput Sci 29(1):151\u2013168. https:\/\/doi.org\/10.2478\/amcs-2019-0012","journal-title":"Int J Appl Math Comput Sci"},{"key":"5560_CR13","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.eswa.2019.05.035","volume":"134","author":"S Balochian","year":"2019","unstructured":"Balochian S, Baloochian H (2019) Social mimic optimization algorithm and engineering applications. Expert Syst Appl 134:178\u2013191. https:\/\/doi.org\/10.1016\/j.eswa.2019.05.035","journal-title":"Expert Syst Appl"},{"issue":"17","key":"5560_CR14","doi-asserted-by":"publisher","first-page":"12821","DOI":"10.1007\/s00500-020-05183-1","volume":"24","author":"R Guha","year":"2020","unstructured":"Guha R et al (2020) Embedded chaotic whale survival algorithm for filter-wrapper feature selection. Soft Comput 24(17):12821\u201312843. https:\/\/doi.org\/10.1007\/s00500-020-05183-1","journal-title":"Soft Comput"},{"key":"5560_CR15","doi-asserted-by":"publisher","first-page":"106341","DOI":"10.1016\/j.asoc.2020.106341","volume":"93","author":"R Guha","year":"2020","unstructured":"Guha R et al (2020) Introducing clustering based population in binary gravitational search algorithm for feature selection. Appl Soft Comput 93:106341. https:\/\/doi.org\/10.1016\/j.asoc.2020.106341","journal-title":"Appl Soft Comput"},{"key":"5560_CR16","doi-asserted-by":"publisher","first-page":"39496","DOI":"10.1109\/ACCESS.2019.2906757","volume":"7","author":"Q Al-Tashi","year":"2019","unstructured":"Al-Tashi Q et al (2019) Binary optimization using hybrid grey wolf optimization for feature selection. IEEE Access 7:39496\u201339508","journal-title":"IEEE Access"},{"issue":"15","key":"5560_CR17","doi-asserted-by":"publisher","first-page":"6249","DOI":"10.1007\/s00500-018-3282-y","volume":"23","author":"MM Mafarja","year":"2019","unstructured":"Mafarja MM, Mirjalili S (2019) Hybrid binary ant lion optimizer with rough set and approximate entropy reducts for feature selection. Soft Comput 23(15):6249\u20136265","journal-title":"Soft Comput"},{"issue":"11","key":"5560_CR18","doi-asserted-by":"publisher","first-page":"1424","DOI":"10.1109\/tpami.2004.105","volume":"26","author":"O Il-Seok","year":"2004","unstructured":"Il-Seok O, Lee J-S, Moon B-R (2004) Hybrid genetic algorithms for feature selection. IEEE Trans Pattern Anal Mach Intell 26(11):1424\u20131437. https:\/\/doi.org\/10.1109\/tpami.2004.105","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"5560_CR19","doi-asserted-by":"publisher","DOI":"10.1155\/2013\/524017","author":"H Chen","year":"2013","unstructured":"Chen H et al (2013) A heuristic feature selection approach for text categorization by using chaos optimization and genetic algorithm. Math Probl Eng. https:\/\/doi.org\/10.1155\/2013\/524017","journal-title":"Math Probl Eng"},{"key":"5560_CR20","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of ICNN\u201995-international conference on neural networks. vol 4. IEEE, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"key":"5560_CR21","doi-asserted-by":"publisher","unstructured":"Chakraborty B (2008) Feature subset selection by particle swarm optimization with fuzzy fitness function. In: 2008 3rd international conference on intelligent system and knowledge engineering. vol 1, pp 1038\u20131042. https:\/\/doi.org\/10.1109\/ISKE.2008.4731082","DOI":"10.1109\/ISKE.2008.4731082"},{"issue":"9","key":"5560_CR22","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1016\/j.pnsc.2008.03.018","volume":"18","author":"S Lee","year":"2008","unstructured":"Lee S et al (2008) Modified binary particle swarm optimization. Progress Nat Sci 18(9):1161\u20131166. https:\/\/doi.org\/10.1016\/j.pnsc.2008.03.018","journal-title":"Progress Nat Sci"},{"issue":"4","key":"5560_CR23","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1016\/j.patrec.2006.09.003","volume":"28","author":"X Wang","year":"2007","unstructured":"Wang X et al (2007) Feature selection based on rough sets and particle swarm optimization. Pattern Recognit Lett 28(4):459\u2013471","journal-title":"Pattern Recognit Lett"},{"issue":"1","key":"5560_CR24","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo V, Colorni A (1996) Ant system optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern Part B (Cybern) 26(1):29\u201341","journal-title":"IEEE Trans Syst Man Cybern Part B (Cybern)"},{"issue":"9","key":"5560_CR25","doi-asserted-by":"publisher","first-page":"1351","DOI":"10.1016\/j.patrec.2008.02.006","volume":"29","author":"L Ke","year":"2008","unstructured":"Ke L, Feng Z, Ren Z (2008) An efficient ant colony optimization approach to attribute reduction in rough set theory. Pattern Recognit Lett 29(9):1351\u20131357","journal-title":"Pattern Recognit Lett"},{"issue":"3","key":"5560_CR26","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.patrec.2009.10.013","volume":"31","author":"Y Chen","year":"2010","unstructured":"Chen Y, Miao D, Wang R (2010) A rough set approach to feature selection based on ant colony optimization. Pattern Recognit Lett 31(3):226\u2013233. https:\/\/doi.org\/10.1016\/j.patrec.2009.10.013","journal-title":"Pattern Recognit Lett"},{"key":"5560_CR27","unstructured":"Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Tech. rep. Technical report-tr06, Erciyes University, Engineering Faculty, Computer Engineering Department"},{"key":"5560_CR28","unstructured":"Shokouhifar M, Sabet S (2010) A hybrid approach for effective feature selection using neural networks and artificial bee colony optimization. In: 3rd international conference on machine vision (ICMV 2010), pp 502\u2013506"},{"key":"5560_CR29","doi-asserted-by":"publisher","first-page":"97890","DOI":"10.1109\/ACCESS.2020.2996611","volume":"8","author":"KK Ghosh","year":"2020","unstructured":"Ghosh KK et al (2020) Binary social mimic optimization algorithm with X-shaped transfer function for feature selection. IEEE Access 8:97890\u201397906. https:\/\/doi.org\/10.1109\/ACCESS.2020.2996611","journal-title":"IEEE Access"},{"key":"5560_CR30","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/j.asoc.2017.11.006","volume":"62","author":"M Mafarja","year":"2018","unstructured":"Mafarja M, Mirjalili S (2018) Whale optimization approaches for wrapper feature selection. Appl Soft Comput 62:441\u2013453","journal-title":"Appl Soft Comput"},{"issue":"3","key":"5560_CR31","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/s11047-009-9175-3","volume":"9","author":"E Rashedi","year":"2010","unstructured":"Rashedi E, Nezamabadi-Pour H, Saryazdi S (2010) BGSA: binary gravitational search algorithm. Nat Comput 9(3):727\u2013745","journal-title":"Nat Comput"},{"key":"5560_CR32","doi-asserted-by":"publisher","first-page":"75393","DOI":"10.1109\/ACCESS.2020.2988157","volume":"8","author":"B Chatterjee","year":"2020","unstructured":"Chatterjee B et al (2020) Late acceptance hill climbing based social ski driver algorithm for feature selection. IEEE Access 8:75393\u201375408. https:\/\/doi.org\/10.1109\/ACCESS.2020.2988157","journal-title":"IEEE Access"},{"key":"5560_CR33","doi-asserted-by":"publisher","first-page":"83548","DOI":"10.1109\/access.2020.2991543","volume":"8","author":"KK Ghosh","year":"2020","unstructured":"Ghosh KK et al (2020) Improved binary sailfish optimizer based on adaptive $$\\beta$$-Hill climbing for feature selection. IEEE Access 8:83548\u201383560. https:\/\/doi.org\/10.1109\/access.2020.2991543","journal-title":"IEEE Access"},{"key":"5560_CR34","doi-asserted-by":"publisher","first-page":"102629","DOI":"10.1109\/ACCESS.2020.2999093","volume":"8","author":"S Ahmed","year":"2020","unstructured":"Ahmed S et al (2020) Hybrid of harmony search algorithm and ring theory- based evolutionary algorithm for feature selection. IEEE Access 8:102629\u2013102645. https:\/\/doi.org\/10.1109\/ACCESS.2020.2999093","journal-title":"IEEE Access"},{"key":"5560_CR35","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/j.neucom.2015.06.083","volume":"172","author":"E Emary","year":"2016","unstructured":"Emary E, Zawbaa HM, Hassanien AE (2016) Binary grey wolf optimization approaches for feature selection. Neurocomputing 172:371\u2013381. https:\/\/doi.org\/10.1016\/j.neucom.2015.06.083","journal-title":"Neurocomputing"},{"key":"5560_CR36","unstructured":"Mafarja Majdi, et al. (2017) S-shaped vs. V-shaped transfer functions for ant lion optimization algorithm in feature selection problem. In: Proceedings of the international conference on future networks and distributed systems, pp 1\u20137"},{"key":"5560_CR37","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.eswa.2018.09.015","volume":"117","author":"M Mafarja","year":"2019","unstructured":"Mafarja M et al (2019) Binary grasshopper optimisation algorithm approaches for feature selection problems. Expert Syst Appl 117:267\u2013286","journal-title":"Expert Syst Appl"},{"key":"5560_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2012.09.002","volume":"9","author":"S Mirjalili","year":"2013","unstructured":"Mirjalili S, Lewis A (2013) S-shaped versus V-shaped transfer functions for binary particle swarm optimization. Swarm Evol Comput 9:1\u201314","journal-title":"Swarm Evol Comput"},{"issue":"1","key":"5560_CR39","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1):67\u201382. https:\/\/doi.org\/10.1109\/4235.585893","journal-title":"IEEE Trans Evol Comput"},{"key":"5560_CR40","doi-asserted-by":"publisher","first-page":"103300","DOI":"10.1016\/j.engappai.2019.103300","volume":"87","author":"W Zhao","year":"2020","unstructured":"Zhao W, Zhang Z, Wang L (2020) Manta ray foraging optimization: an effective bio-inspired optimizer for engineering applications. Eng Appl Artif Intell 87:103300. https:\/\/doi.org\/10.1016\/j.engappai.2019.103300","journal-title":"Eng Appl Artif Intell"},{"key":"5560_CR41","unstructured":"Rizzo J (2016) Ocean Animals: Who\u2019s Who in the Deep Blue. Animals Series. National Geographic Society. ISBN: 9781426325069. https:\/\/books.google.co.in\/books?id=Klu4DQAAQBAJ"},{"key":"5560_CR42","doi-asserted-by":"crossref","DOI":"10.1353\/book.30084","volume-title":"Sharks","author":"G Helfman","year":"2014","unstructured":"Helfman G, Burgess GH (2014) Sharks. JHU Press, Baltimore"},{"key":"5560_CR43","unstructured":"Bigelow HB (1953) Sawfishes, guitarfishes, skates and rays. In: Saw- fishes, guitarfishes, skates and rays, and chimaeroids, pp 1\u2013514"},{"key":"5560_CR44","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/j.neucom.2017.04.053","volume":"260","author":"MM Mafarja","year":"2017","unstructured":"Mafarja MM, Mirjalili S (2017) Hybrid whale optimization algorithm with simulated annealing for feature selection. Neurocomputing 260:302\u2013312. https:\/\/doi.org\/10.1016\/j.neucom.2017.04.053","journal-title":"Neurocomputing"},{"issue":"3","key":"5560_CR45","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1080\/00031305.1992.10475879","volume":"46","author":"NS Altman","year":"1992","unstructured":"Altman NS (1992) An introduction to kernel and nearest-neighbor non parametric regression. Am Stat 46(3):175\u2013185. https:\/\/doi.org\/10.1080\/00031305.1992.10475879","journal-title":"Am Stat"},{"key":"5560_CR46","unstructured":"Dua D, Graff C (2017) UCI machine learning repository. http:\/\/archive.ics.uci.edu\/ml"},{"key":"5560_CR47","volume-title":"The python language reference manual","author":"G Van Rossum","year":"2011","unstructured":"Van Rossum G, Drake FL (2011) The python language reference manual. Network Theory Ltd, London"},{"key":"5560_CR48","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.ins.2019.05.038","volume":"497","author":"M Taradeh","year":"2019","unstructured":"Taradeh M et al (2019) An evolutionary gravitational search-based feature selection. Inf Sci 497:219\u2013239","journal-title":"Inf Sci"},{"key":"5560_CR49","doi-asserted-by":"publisher","DOI":"10.1007\/s12559-019-09668-6","author":"M Mafarja","year":"2019","unstructured":"Mafarja M et al. (2019) Efficient hybrid nature-inspired binary optimizers for feature selection. Cognit Comput. https:\/\/doi.org\/10.1007\/s12559-019-09668-6","journal-title":"Cognit Comput"},{"key":"5560_CR50","first-page":"171","volume":"1","author":"F Wilcoxon","year":"1970","unstructured":"Wilcoxon F, Katti SK, Wilcox RA (1970) Critical values and probability levels for the Wilcoxon rank sum test and the Wilcoxon signed rank test. Sel Tables Math Stat 1:171\u2013259","journal-title":"Sel Tables Math Stat"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-020-05560-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-020-05560-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-020-05560-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,16]],"date-time":"2023-10-16T18:27:59Z","timestamp":1697480879000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-020-05560-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,3]]},"references-count":50,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["5560"],"URL":"https:\/\/doi.org\/10.1007\/s00521-020-05560-9","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,3]]},"assertion":[{"value":"15 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 November 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2021","order":3,"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":"We wish to confirm that there are no known conflicts of interest associated with this publication and there has been no significant financial support for this work that could have influenced its outcome.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}