{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T05:10:31Z","timestamp":1754111431904,"version":"3.40.3"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031020551"},{"type":"electronic","value":"9783031020568"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-02056-8_5","type":"book-chapter","created":{"date-parts":[[2022,4,19]],"date-time":"2022-04-19T10:03:00Z","timestamp":1650362580000},"page":"68-84","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["SLUG: Feature Selection Using Genetic Algorithms and\u00a0Genetic Programming"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5312-8276","authenticated-orcid":false,"given":"Nuno M.","family":"Rodrigues","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2997-8550","authenticated-orcid":false,"given":"Jo\u00e3o E.","family":"Batista","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1332-2960","authenticated-orcid":false,"given":"William","family":"La Cava","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4732-3328","authenticated-orcid":false,"given":"Leonardo","family":"Vanneschi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8223-4799","authenticated-orcid":false,"given":"Sara","family":"Silva","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,13]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Aguirre, H.E., Tanaka, K.: Genetic algorithms on NK-landscapes: effects of selection, drift, mutation, and recombination. In: Cagnoni, S., et al. (eds.) Applications of Evolutionary Computing, pp. 131\u2013142. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-78761-7","key":"5_CR1","DOI":"10.1007\/978-3-540-78761-7"},{"unstructured":"Altenberg, L.: B2.7.2. NK fitness landscapes. In: Handbook of Evolutionary Computation. pp. B2.7:5\u2013B2.7:10. IOP Publishing Ltd. and Oxford University Press, London (1997)","key":"5_CR2"},{"doi-asserted-by":"publisher","unstructured":"Ansarifar, J., Wang, L.: New algorithms for detecting multi-effect and multi-way epistatic interactions. Bioinformatics 35(24), 5078\u20135085 (2019). https:\/\/doi.org\/10.1093\/bioinformatics\/btz463","key":"5_CR3","DOI":"10.1093\/bioinformatics\/btz463"},{"doi-asserted-by":"publisher","unstructured":"Chaikla, N., Qi, Y.: Genetic algorithms in feature selection. In: IEEE SMC 1999 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No. 99CH37028). vol. 5, pp. 538\u2013540 (1999). https:\/\/doi.org\/10.1109\/ICSMC.1999.815609","key":"5_CR4","DOI":"10.1109\/ICSMC.1999.815609"},{"doi-asserted-by":"publisher","unstructured":"Chan, K., Aydin, M., Fogarty, T.: An epistasis measure based on the analysis of variance for the real-coded representation in genetic algorithms. In: The 2003 Congress on Evolutionary Computation, 2003, CEC 2003. vol. 1, pp. 297\u2013304 (2003). https:\/\/doi.org\/10.1109\/CEC.2003.1299588","key":"5_CR5","DOI":"10.1109\/CEC.2003.1299588"},{"doi-asserted-by":"publisher","unstructured":"Chiesa, M., Maioli, G., Colombo, G.: GARS: Genetic algorithm for the identification of a robust subset of features in high-dimensional datasets. BMC Bioinform. 21(54) (2020). https:\/\/doi.org\/10.1186\/s12859-020-3400-6","key":"5_CR6","DOI":"10.1186\/s12859-020-3400-6"},{"doi-asserted-by":"publisher","unstructured":"Cordell, H.J.: Epistasis: what it means, what it doesn\u2019t mean, and statistical methods to detect it in humans. Hum. Mol. Gene. 11(20), 2463\u20132468 (2002). https:\/\/doi.org\/10.1093\/hmg\/11.20.2463","key":"5_CR7","DOI":"10.1093\/hmg\/11.20.2463"},{"doi-asserted-by":"publisher","unstructured":"Davidor, Y.: Epistasis variance: a viewpoint on GA-hardness. Found. Gen. Algorithms 1, 23\u201335 (1991). https:\/\/doi.org\/10.1016\/B978-0-08-050684-5.50005-7","key":"5_CR8","DOI":"10.1016\/B978-0-08-050684-5.50005-7"},{"unstructured":"Dua, D., Graff, C.: UCI Machine Learning Repository (2017). http:\/\/archive.ics.uci.edu\/ml","key":"5_CR9"},{"doi-asserted-by":"publisher","unstructured":"Garc\u00eda-Dominguez, A., et al.: Feature selection using genetic algorithms for the generation of a recognition and classification of children activities model using environmental sound. Mob. Inf. Syst. 2020, 12 p (2020). 8617430. https:\/\/doi.org\/10.1155\/2020\/8617430","key":"5_CR10","DOI":"10.1155\/2020\/8617430"},{"unstructured":"Hall, M.A.: Correlation-based feature selection for machine learning. Ph.D. thesis, The University of Waikato (1999)","key":"5_CR11"},{"doi-asserted-by":"publisher","unstructured":"Hussein, F., Kharma, N., Ward, R.: Genetic algorithms for feature selection and weighting, a review and study. In: Proceedings of Sixth International Conference on Document Analysis and Recognition, pp. 1240\u20131244 (2001). https:\/\/doi.org\/10.1109\/ICDAR.2001.953980","key":"5_CR12","DOI":"10.1109\/ICDAR.2001.953980"},{"doi-asserted-by":"publisher","unstructured":"Jafari, S., Kapitaniak, T., Rajagopal, K., Pham, V.-T., Alsaadi, F.E.: Effect of epistasis on the performance of genetic algorithms. J. Zhejiang Univ.-Sci. A 20(2), 109\u2013116 (2018). https:\/\/doi.org\/10.1631\/jzus.A1800399","key":"5_CR13","DOI":"10.1631\/jzus.A1800399"},{"doi-asserted-by":"crossref","unstructured":"Kononenko, I.: Estimating attributes: analysis and extensions of relief. In: ECML (1994)","key":"5_CR14","DOI":"10.1007\/3-540-57868-4_57"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-319-90512-9","volume-title":"Genetic Programming Theory and Practice XV","author":"MF Korns","year":"2018","unstructured":"Korns, M.F.: Genetic programming symbolic classification: A study. In: Banzhaf, W., Olson, R.S., Tozier, W., Riolo, R. (eds.) Genetic Programming Theory and Practice XV, pp. 39\u201354. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-90512-9"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.swevo.2018.03.015","volume":"44","author":"W La Cava","year":"2019","unstructured":"La Cava, W., Silva, S., Danai, K., Spector, L., Vanneschi, L., Moore, J.H.: Multidimensional genetic programming for multiclass classification. Swarm Evol. Comput. 44, 260\u2013272 (2019). https:\/\/doi.org\/10.1016\/j.swevo.2018.03.015","journal-title":"Swarm Evol. Comput."},{"doi-asserted-by":"publisher","unstructured":"Lanzi, P.: Fast feature selection with genetic algorithms: a filter approach. In: Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC 1997). pp. 537\u2013540 (1997). https:\/\/doi.org\/10.1109\/ICEC.1997.592369","key":"5_CR17","DOI":"10.1109\/ICEC.1997.592369"},{"issue":"9","key":"5_CR18","doi-asserted-by":"publisher","first-page":"2092","DOI":"10.1177\/0003702817713501","volume":"71","author":"BK Lavine","year":"2017","unstructured":"Lavine, B.K., White, C.G.: Boosting the performance of genetic algorithms for variable selection in partial least squares spectral calibrations. Appl. Spectrosc. 71(9), 2092\u20132101 (2017)","journal-title":"Appl. Spectrosc."},{"doi-asserted-by":"crossref","unstructured":"Lee, J., Kim, Y.H.: Epistasis-based basis estimation method for simplifying the problem space of an evolutionary search in binary representation. Complexity 2019, 2095167, 13 pages (2019)","key":"5_CR19","DOI":"10.1155\/2019\/2095167"},{"unstructured":"Lehman, J., Stanley, K.O.: Exploiting open-endedness to solve problems through the search for novelty. In: Proceedings of the Eleventh International Conference on Artificial Life, Alife XI. MIT Press, Cambridge (2008)","key":"5_CR20"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.ins.2020.03.032","volume":"523","author":"AD Li","year":"2020","unstructured":"Li, A.D., Xue, B., Zhang, M.: Multi-objective feature selection using hybridization of a genetic algorithm and direct multisearch for key quality characteristic selection. Inf. Sci. 523, 245\u2013265 (2020). https:\/\/doi.org\/10.1016\/j.ins.2020.03.032","journal-title":"Inf. Sci."},{"doi-asserted-by":"publisher","unstructured":"Mathias, K.E., Eshelman, L.J., Schaffer, J.D.: Niches in NK-landscapes. In: Martin, W.N., Spears, W.M. (eds.) Foundations of Genetic Algorithms, vol. 6, pp. 27\u201346. Morgan Kaufmann, San Francisco (2001). https:\/\/doi.org\/10.1016\/B978-155860734-7\/50085-8","key":"5_CR22","DOI":"10.1016\/B978-155860734-7\/50085-8"},{"doi-asserted-by":"publisher","unstructured":"Merz, P., Freisleben, B.: On the effectiveness of evolutionary search in high-dimensional NK-landscapes. In: 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No. 98TH8360), pp. 741\u2013745 (1998). https:\/\/doi.org\/10.1109\/ICEC.1998.700144","key":"5_CR23","DOI":"10.1109\/ICEC.1998.700144"},{"doi-asserted-by":"publisher","unstructured":"Mo, H., Li, Z., Zhu, C.: A kind of epistasis-tunable test functions for genetic algorithms. Concurr. Comput. Pract. Exp. 33(8), e5030 (2021). https:\/\/doi.org\/10.1002\/cpe.5030","key":"5_CR24","DOI":"10.1002\/cpe.5030"},{"doi-asserted-by":"crossref","unstructured":"Mu\u00f1oz, L., Silva, S., Trujillo, L.: M3GP- multiclass classification with GP. In: EuroGP (2015)","key":"5_CR25","DOI":"10.1007\/978-3-319-16501-1_7"},{"doi-asserted-by":"publisher","unstructured":"Nazareth, D.L., Soofi, E.S., Zhao, H.: Visualizing attribute interdependencies using mutual information, hierarchical clustering, multidimensional scaling, and self-organizing maps. In: 2007 40th Annual Hawaii International Conference on System Sciences (HICSS 2007), pp. 53\u201353 (2007). https:\/\/doi.org\/10.1109\/HICSS.2007.608","key":"5_CR26","DOI":"10.1109\/HICSS.2007.608"},{"unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","key":"5_CR27"},{"doi-asserted-by":"publisher","unstructured":"Pelikan, M., Sastry, K., Goldberg, D.E., Butz, M.V., Hauschild, M.: Performance of evolutionary algorithms on NK landscapes with nearest neighbor interactions and tunable overlap. In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, GECCO 2009, pp. 851\u2013858. Association for Computing Machinery, New York (2009). https:\/\/doi.org\/10.1145\/1569901.1570018","key":"5_CR28","DOI":"10.1145\/1569901.1570018"},{"doi-asserted-by":"crossref","unstructured":"Petinrin, O.O., Wong, K.C.: Protocol for epistasis detection with machine learning using GenEpi package. Methods Mol. Biol. 2212, 291\u2013305 (2021)","key":"5_CR29","DOI":"10.1007\/978-1-0716-0947-7_18"},{"doi-asserted-by":"crossref","unstructured":"Reeves, C.R., Wright, C.C.: Epistasis in genetic algorithms: an experimental design perspective. In: Proceedings of the 6th International Conference on Genetic Algorithms. pp. 217\u2013224. Morgan Kaufmann Publishers Inc., San Francisco (1995)","key":"5_CR30","DOI":"10.1016\/B978-1-55860-356-1.50005-4"},{"doi-asserted-by":"publisher","unstructured":"Rochet, S.: Epistasis in genetic algorithms revisited. Infor. Sci. 102(1), 133\u2013155 (1997). https:\/\/doi.org\/10.1016\/S0020-0255(97)00017-0","key":"5_CR31","DOI":"10.1016\/S0020-0255(97)00017-0"},{"doi-asserted-by":"publisher","unstructured":"Rodrigues, N.M., Batista, J.E., Silva, S.: Ensemble genetic programming. In: Hu, T., Louren\u00e7o, N., Medvet, E., Divina, F. (eds.) Genetic Programming, pp. 151\u2013166. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-319-30668-1","key":"5_CR32","DOI":"10.1007\/978-3-319-30668-1"},{"key":"5_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-3-540-74695-9_55","volume-title":"Artificial Neural Networks \u2013 ICANN 2007","author":"K-K Seo","year":"2007","unstructured":"Seo, K.-K.: Content-Based Image Retrieval by Combining Genetic Algorithm and Support Vector Machine. In: de S\u00e1, J.M., Alexandre, L.A., Duch, W., Mandic, D. (eds.) ICANN 2007. LNCS, vol. 4669, pp. 537\u2013545. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74695-9_55"},{"doi-asserted-by":"crossref","unstructured":"Shik Shin, K., Lee, Y.J.: A genetic algorithm application in bankruptcy prediction modeling. Expert Syst. Appl. 23, 321\u2013328 (2002)","key":"5_CR34","DOI":"10.1016\/S0957-4174(02)00051-9"},{"doi-asserted-by":"publisher","unstructured":"Smith, M.G., Bull, L.: Feature construction and selection using genetic programming and a genetic algorithm. In: Ryan, C., Soule, T., Keijzer, M., Tsang, E., Poli, R., Costa, E. (eds.) Genetic Programming, pp. 229\u2013237. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-319-30668-1","key":"5_CR35","DOI":"10.1007\/978-3-319-30668-1"},{"doi-asserted-by":"publisher","unstructured":"Sohn, A., Olson, R.S., Moore, J.H.: Toward the automated analysis of complex diseases in genome-wide association studies using genetic programming. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2017, pp. 489\u2013496. Association for Computing Machinery, New York (2017). https:\/\/doi.org\/10.1145\/3071178.3071212","key":"5_CR36","DOI":"10.1145\/3071178.3071212"},{"doi-asserted-by":"publisher","unstructured":"Tin\u00f3s, R., Whitley, D., Chicano, F.: Partition crossover for pseudo-Boolean optimization. In: Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII, FOGA 2015, pp. 137\u2013149. Association for Computing Machinery, New York (2015). https:\/\/doi.org\/10.1145\/2725494.2725497","key":"5_CR37","DOI":"10.1145\/2725494.2725497"},{"doi-asserted-by":"publisher","unstructured":"Urbanowicz, R., Kiralis, J., Sinnott-Armstrong, N., et al.: GAMETES: a fast, direct algorithm for generating pure, strict, epistatic models with random architectures. BioData Mining 5(16) (2012). https:\/\/doi.org\/10.1186\/1756-0381-5-16","key":"5_CR38","DOI":"10.1186\/1756-0381-5-16"},{"doi-asserted-by":"crossref","unstructured":"Urbanowicz, R.J., Kiralis, J., Sinnott-Armstrong, N.A., Heberling, T., Fisher, J.M., Moore, J.H.: Gametes: a fast, direct algorithm for generating pure, strict, epistatic models with random architectures. BioData Mining 5, 16\u201316 (2012)","key":"5_CR39","DOI":"10.1186\/1756-0381-5-16"},{"doi-asserted-by":"publisher","unstructured":"Urbanowicz, R.J., Meeker, M., La Cava, W., Olson, R.S., Moore, J.H.: Relief-based feature selection: Introduction and review. J. Biomed. Inf. 85, 189\u2013203 (2018). https:\/\/doi.org\/10.1016\/j.jbi.2018.07.014","key":"5_CR40","DOI":"10.1016\/j.jbi.2018.07.014"},{"doi-asserted-by":"publisher","unstructured":"Vanneschi, L., Castelli, M., Manzoni, L.: The K landscapes: a tunably difficult benchmark for genetic programming. In: Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation, GECCO 2011, Association for Computing Machinery, New York (2011). https:\/\/doi.org\/10.1145\/2001576.2001773","key":"5_CR41","DOI":"10.1145\/2001576.2001773"},{"doi-asserted-by":"publisher","unstructured":"Wutzl, B., Leibnitz, K., Rattay, F., Kronbichler, M., Murata, M., Golaszewski, S.M.: Genetic algorithms for feature selection when classifying severe chronic disorders of consciousness. PLoS ONE 14(7), 1\u201316 (2019). https:\/\/doi.org\/10.1371\/journal.pone.0219683","key":"5_CR42","DOI":"10.1371\/journal.pone.0219683"},{"doi-asserted-by":"publisher","unstructured":"Xue, B., Zhang, M., Browne, W.N., Yao, X.: A survey on evolutionary computation approaches to feature selection. IEEE Trans. Evol. Comput. 20(4), 606\u2013626 (2016). https:\/\/doi.org\/10.1109\/TEVC.2015.2504420","key":"5_CR43","DOI":"10.1109\/TEVC.2015.2504420"},{"unstructured":"Zhang, S.: sonar.all-data (2018). https:\/\/www.kaggle.com\/ypzhangsam\/sonaralldata","key":"5_CR44"}],"container-title":["Lecture Notes in Computer Science","Genetic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-02056-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,19]],"date-time":"2022-04-19T10:04:31Z","timestamp":1650362671000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-02056-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031020551","9783031020568"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-02056-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"13 April 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EuroGP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Genetic Programming (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurogp2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}