{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,29]],"date-time":"2026-10-29T20:17:54Z","timestamp":1793305074817,"version":"4.5.0"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030581145","type":"print"},{"value":"9783030581152","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58115-2_6","type":"book-chapter","created":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T18:02:51Z","timestamp":1598983371000},"page":"79-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["Learning a Formula of Interpretability to Learn Interpretable Formulas"],"prefix":"10.1007","author":[{"given":"Marco","family":"Virgolin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrea","family":"De Lorenzo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eric","family":"Medvet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Francesca","family":"Randone","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"52138","DOI":"10.1109\/ACCESS.2018.2870052","volume":"6","author":"A Adadi","year":"2018","unstructured":"Adadi, A., Berrada, M.: Peeking inside the black-box: a survey on explainable artificial intelligence (XAI). IEEE Access 6, 52138\u201352160 (2018)","journal-title":"IEEE Access"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.inffus.2019.12.012","volume":"58","author":"AB Arrieta","year":"2020","unstructured":"Arrieta, A.B., et al.: Explainable artificial intelligence (XAI): concepts, taxonomies, opportunities and challenges toward responsible AI. Inf. Fusion 58, 82\u2013115 (2020)","journal-title":"Inf. Fusion"},{"key":"6_CR3","volume-title":"Pattern Recognition and Machine Learning","author":"CM Bishop","year":"2006","unstructured":"Bishop, C.M.: Pattern Recognition and Machine Learning. Springer, New York (2006)"},{"key":"6_CR4","unstructured":"Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and Regression Trees. Wadsworth, Belmont (1984)"},{"key":"6_CR5","unstructured":"Burgess, T.F.: Guide to the design of questionnaires. A general introduction to the design of questionnaires for survey research. University of Leeds (2001)"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2013.03.038","volume":"240","author":"A Cano","year":"2013","unstructured":"Cano, A., Zafra, A., Ventura, S.: An interpretable classification rule mining algorithm. Inf. Sci. 240, 1\u201320 (2013)","journal-title":"Inf. Sci."},{"issue":"4","key":"6_CR7","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1109\/TEVC.2018.2881392","volume":"23","author":"Q Chen","year":"2018","unstructured":"Chen, Q., Zhang, M., Xue, B.: Structural risk minimization-driven genetic programming for enhancing generalization in symbolic regression. IEEE Trans. Evol. Comput. 23(4), 703\u2013717 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"6_CR8","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1089\/big.2016.0047","volume":"5","author":"A Chouldechova","year":"2017","unstructured":"Chouldechova, A.: Fair prediction with disparate impact: a study of bias in recidivism prediction instruments. Big Data 5(2), 153\u2013163 (2017)","journal-title":"Big Data"},{"issue":"2","key":"6_CR9","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"Jan","key":"6_CR10","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar, J.: Statistical comparisons of classifiers over multiple data sets. J. Mach. Learn. Res. 7(Jan), 1\u201330 (2006)","journal-title":"J. Mach. Learn. Res."},{"key":"6_CR11","unstructured":"Doshi-Velez, F., Kim, B.: Towards a rigorous science of interpretable machine learning. arXiv preprint arXiv:1702.08608 (2017)"},{"key":"6_CR12","unstructured":"Dua, D., Graff, C.: UCI machine learning repository (2017). archive.ics.uci.edu\/ml"},{"issue":"1","key":"6_CR13","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1023\/A:1010070616149","volume":"2","author":"A Ek\u00e1rt","year":"2001","unstructured":"Ek\u00e1rt, A., Nemeth, S.Z.: Selection based on the Pareto nondomination criterion for controlling code growth in genetic programming. Genet. Program Evolvable Mach. 2(1), 61\u201373 (2001)","journal-title":"Genet. Program Evolvable Mach."},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Evans, B.P., Xue, B., Zhang, M.: What\u2019s inside the black-box? A genetic programming method for interpreting complex machine learning models. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1012\u20131020 (2019)","DOI":"10.1145\/3321707.3321726"},{"issue":"3","key":"6_CR15","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1609\/aimag.v38i3.2741","volume":"38","author":"B Goodman","year":"2017","unstructured":"Goodman, B., Flaxman, S.: European union regulations on algorithmic decision-making and a \u201cright to explanation\u201d. AI Mag. 38(3), 50\u201357 (2017)","journal-title":"AI Mag."},{"issue":"5","key":"6_CR16","first-page":"93","volume":"51","author":"R Guidotti","year":"2018","unstructured":"Guidotti, R., Monreale, A., Ruggieri, S., Turini, F., Giannotti, F., Pedreschi, D.: A survey of methods for explaining black box models. ACM Comput. Surv. 51(5), 93 (2018)","journal-title":"ACM Comput. Surv."},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"He, K., Zhang, X., Ren, S., Sun, J.: Deep residual learning for image recognition. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 770\u2013778 (2016)","DOI":"10.1109\/CVPR.2016.90"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.engappai.2018.09.007","volume":"76","author":"D Hein","year":"2018","unstructured":"Hein, D., Udluft, S., Runkler, T.A.: Interpretable policies for reinforcement learning by genetic programming. Eng. Appl. Artif. Intell. 76, 158\u2013169 (2018)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"6_CR19","first-page":"65","volume":"6","author":"S Holm","year":"1979","unstructured":"Holm, S.: A simple sequentially rejective multiple test procedure. Scand. J. Stat. 6, 65\u201370 (1979)","journal-title":"Scand. J. Stat."},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/3-540-36599-0_7","volume-title":"Genetic Programming","author":"M Keijzer","year":"2003","unstructured":"Keijzer, M.: Improving symbolic regression with interval arithmetic and linear scaling. In: Ryan, C., Soule, T., Keijzer, M., Tsang, E., Poli, R., Costa, E. (eds.) EuroGP 2003. LNCS, vol. 2610, pp. 70\u201382. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36599-0_7"},{"issue":"3","key":"6_CR21","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1023\/B:GENP.0000030195.77571.f9","volume":"5","author":"M Keijzer","year":"2004","unstructured":"Keijzer, M.: Scaled symbolic regression. Genet. Program Evolvable Mach. 5(3), 259\u2013269 (2004)","journal-title":"Genet. Program Evolvable Mach."},{"key":"6_CR22","unstructured":"Lensen, A., Xue, B., Zhang, M.: Genetic programming for evolving a front of interpretable models for data visualization. IEEE Trans. Cybern., 1\u201315 (2020). https:\/\/ieeexplore.ieee.org\/abstract\/document\/9007046"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-319-28270-1_12","volume-title":"Artificial Life and Computational Intelligence","author":"Y Liang","year":"2016","unstructured":"Liang, Y., Zhang, M., Browne, W.N.: Multi-objective genetic programming for figure-ground image segmentation. In: Ray, T., Sarker, R., Li, X. (eds.) ACALCI 2016. LNCS (LNAI), vol. 9592, pp. 134\u2013146. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-28270-1_12"},{"issue":"3","key":"6_CR24","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/3236386.3241340","volume":"16","author":"ZC Lipton","year":"2018","unstructured":"Lipton, Z.C.: The mythos of model interpretability. Queue 16(3), 31\u201357 (2018)","journal-title":"Queue"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Lou, Y., Caruana, R., Gehrke, J.: Intelligible models for classification and regression. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 150\u2013158. ACM (2012)","DOI":"10.1145\/2339530.2339556"},{"issue":"4","key":"6_CR26","doi-asserted-by":"publisher","first-page":"1444","DOI":"10.1016\/j.neuroimage.2012.04.020","volume":"61","author":"M Maruyama","year":"2012","unstructured":"Maruyama, M., Pallier, C., Jobert, A., Sigman, M., Dehaene, S.: The cortical representation of simple mathematical expressions. Neuroimage 61(4), 1444\u20131460 (2012)","journal-title":"Neuroimage"},{"key":"6_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-030-43859-3_9","volume-title":"Artificial Intelligence in Music, Sound, Art and Design","author":"J McCormack","year":"2020","unstructured":"McCormack, J., Lomas, A.: Understanding aesthetic evaluation using deep learning. In: Romero, J., Ek\u00e1rt, A., Martins, T., Correia, J. (eds.) EvoMUSART 2020. LNCS, vol. 12103, pp. 118\u2013133. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-43859-3_9"},{"key":"6_CR28","doi-asserted-by":"publisher","first-page":"e103","DOI":"10.7717\/peerj-cs.103","volume":"3","author":"A Meurer","year":"2017","unstructured":"Meurer, A., et al.: SymPy: symbolic computing in Python. PeerJ Comput. Sci. 3, e103 (2017)","journal-title":"PeerJ Comput. Sci."},{"key":"6_CR29","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"6_CR30","volume-title":"A Field Guide to Genetic Programming","author":"R Poli","year":"2008","unstructured":"Poli, R., Langdon, W.B., McPhee, N.F., Koza, J.R.: A Field Guide to Genetic Programming. Lulu.com, Morrisville (2008)"},{"key":"6_CR31","series-title":"Natural Computing Series","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-642-33206-7_9","volume-title":"Theory and Principled Methods for the Design of Metaheuristics","author":"R Poli","year":"2014","unstructured":"Poli, R., McPhee, N.F.: Parsimony pressure made easy: solving the problem of bloat in GP. In: Borenstein, Y., Moraglio, A. (eds.) Theory and Principled Methods for the Design of Metaheuristics. NCS, pp. 181\u2013204. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-33206-7_9"},{"key":"6_CR32","unstructured":"Poursabzi-Sangdeh, F., Goldstein, D.G., Hofman, J.M., Vaughan, J.W., Wallach, H.: Manipulating and measuring model interpretability. arXiv preprint arXiv:1802.07810 (2018)"},{"key":"6_CR33","doi-asserted-by":"crossref","unstructured":"Raymond, C., Chen, Q., Xue, B., Zhang, M.: Genetic programming with Rademacher complexity for symbolic regression. In: IEEE Congress on Evolutionary Computation (CEC), pp. 2657\u20132664 (2019)","DOI":"10.1109\/CEC.2019.8790341"},{"key":"6_CR34","doi-asserted-by":"crossref","unstructured":"Ribeiro, M.T., Singh, S., Guestrin, C.: \u201cWhy should I trust you?\u201d Explaining the predictions of any classifier. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1135\u20131144 (2016)","DOI":"10.1145\/2939672.2939778"},{"key":"6_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-030-44094-7_11","volume-title":"Genetic Programming","author":"S Ruberto","year":"2020","unstructured":"Ruberto, S., Terragni, V., Moore, J.H.: SGP-DT: semantic genetic programming based on dynamic targets. In: Hu, T., Louren\u00e7o, N., Medvet, E., Divina, F. (eds.) EuroGP 2020. LNCS, vol. 12101, pp. 167\u2013183. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44094-7_11"},{"issue":"5","key":"6_CR36","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1038\/s42256-019-0048-x","volume":"1","author":"C Rudin","year":"2019","unstructured":"Rudin, C.: Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead. Nat. Mach. Intell. 1(5), 206\u2013215 (2019)","journal-title":"Nat. Mach. Intell."},{"key":"6_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-030-44094-7_13","volume-title":"Genetic Programming","author":"AS Sambo","year":"2020","unstructured":"Sambo, A.S., Azad, R.M.A., Kovalchuk, Y., Indramohan, V.P., Shah, H.: Time control or size control? Reducing complexity and improving accuracy of genetic programming models. In: Hu, T., Louren\u00e7o, N., Medvet, E., Divina, F. (eds.) EuroGP 2020. LNCS, vol. 12101, pp. 195\u2013210. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44094-7_13"},{"issue":"2","key":"6_CR38","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s10710-011-9150-5","volume":"13","author":"S Silva","year":"2012","unstructured":"Silva, S., Dignum, S., Vanneschi, L.: Operator equalisation for bloat free genetic programming and a survey of bloat control methods. Genet. Program Evolvable Mach. 13(2), 197\u2013238 (2012)","journal-title":"Genet. Program Evolvable Mach."},{"key":"6_CR39","series-title":"Genetic Programming","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/0-387-23254-0_17","volume-title":"Genetic Programming Theory and Practice II","author":"GF Smits","year":"2005","unstructured":"Smits, G.F., Kotanchek, M.: Pareto-front exploitation in symbolic regression. In: O\u2019Reilly, U.M., Yu, T., Riolo, R., Worzel, B. (eds.) Genetic Programming Theory and Practice II. GPEM, vol. 8, pp. 283\u2013299. Springer, Boston (2005). https:\/\/doi.org\/10.1007\/0-387-23254-0_17"},{"key":"6_CR40","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1016\/j.ins.2015.09.056","volume":"329","author":"G Squillero","year":"2016","unstructured":"Squillero, G., Tonda, A.: Divergence of character and premature convergence: a survey of methodologies for promoting diversity in evolutionary optimization. Inf. Sci. 329, 782\u2013799 (2016)","journal-title":"Inf. Sci."},{"key":"6_CR41","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1016\/j.patcog.2019.05.006","volume":"93","author":"B Tran","year":"2019","unstructured":"Tran, B., Xue, B., Zhang, M.: Genetic programming for multiple-feature construction on high-dimensional classification. Pattern Recogn. 93, 404\u2013417 (2019)","journal-title":"Pattern Recogn."},{"key":"6_CR42","doi-asserted-by":"crossref","unstructured":"Vanneschi, L., Castelli, M., Silva, S.: Measuring bloat, overfitting and functional complexity in genetic programming. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 877\u2013884 (2010)","DOI":"10.1145\/1830483.1830643"},{"key":"6_CR43","doi-asserted-by":"crossref","unstructured":"Virgolin, M., Alderliesten, T., Witteveen, C., Bosman, P.A.N.: Improving model-based genetic programming for symbolic regression of small expressions. Accepted in Evolutionary Computation. ArXiv preprint arXiv:1904.02050 (2019)","DOI":"10.1162\/evco_a_00278"},{"key":"6_CR44","doi-asserted-by":"crossref","unstructured":"Virgolin, M., Alderliesten, T., Bosman, P.A.N.: Linear scaling with and within semantic backpropagation-based genetic programming for symbolic regression. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2019, pp. 1084\u20131092. Association for Computing Machinery (2019)","DOI":"10.1145\/3321707.3321758"},{"key":"6_CR45","doi-asserted-by":"publisher","first-page":"100640","DOI":"10.1016\/j.swevo.2019.100640","volume":"53","author":"M Virgolin","year":"2020","unstructured":"Virgolin, M., Alderliesten, T., Bosman, P.A.N.: On explaining machine learning models by evolving crucial and compact features. Swarm Evol. Comput. 53, 100640 (2020)","journal-title":"Swarm Evol. Comput."},{"issue":"2","key":"6_CR46","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1109\/TEVC.2008.926486","volume":"13","author":"EJ Vladislavleva","year":"2008","unstructured":"Vladislavleva, E.J., Smits, G.F., Den Hertog, D.: Order of nonlinearity as a complexity measure for models generated by symbolic regression via Pareto genetic programming. IEEE Trans. Evol. Comput. 13(2), 333\u2013349 (2008)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"6_CR47","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.neucom.2012.06.054","volume":"125","author":"P Wang","year":"2014","unstructured":"Wang, P., Tang, K., Weise, T., Tsang, E., Yao, X.: Multiobjective genetic programming for maximizing ROC performance. Neurocomputing 125, 102\u2013118 (2014)","journal-title":"Neurocomputing"},{"issue":"5","key":"6_CR48","doi-asserted-by":"publisher","first-page":"2368","DOI":"10.1109\/TIP.2017.2787612","volume":"27","author":"W Wang","year":"2017","unstructured":"Wang, W., Shen, J.: Deep visual attention prediction. IEEE Trans. Image Process. 27(5), 2368\u20132378 (2017)","journal-title":"IEEE Trans. Image Process."},{"key":"6_CR49","doi-asserted-by":"crossref","unstructured":"Watchareeruetai, U., Matsumoto, T., Takeuchi, Y., Kudo, H., Ohnishi, N.: Construction of image feature extractors based on multi-objective genetic programming with redundancy regulations. In: IEEE International Conference on Systems, Man and Cybernetics, pp. 1328\u20131333. IEEE (2009)","DOI":"10.1109\/ICSMC.2009.5346242"},{"issue":"1","key":"6_CR50","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10710-012-9177-2","volume":"14","author":"DR White","year":"2013","unstructured":"White, D.R., et al.: Better GP benchmarks: community survey results and proposals. Genet. Program Evolvable Mach. 14(1), 3\u201329 (2013)","journal-title":"Genet. Program Evolvable Mach."},{"issue":"1","key":"6_CR51","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1162\/evco.1995.3.1.17","volume":"3","author":"BT Zhang","year":"1995","unstructured":"Zhang, B.T., M\u00fchlenbein, H.: Balancing accuracy and parsimony in genetic programming. Evol. Comput. 3(1), 17\u201338 (1995)","journal-title":"Evol. Comput."},{"issue":"3","key":"6_CR52","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1016\/j.dss.2006.12.011","volume":"43","author":"H Zhao","year":"2007","unstructured":"Zhao, H.: A multi-objective genetic programming approach to developing Pareto optimal decision trees. Decis. Support Syst. 43(3), 809\u2013826 (2007)","journal-title":"Decis. Support Syst."},{"issue":"2","key":"6_CR53","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1111\/j.1467-9868.2005.00503.x","volume":"67","author":"H Zou","year":"2005","unstructured":"Zou, H., Hastie, T.: Regularization and variable selection via the elastic net. J. Roy. Stat. Soc.: Ser. B (Stat. Methodol.) 67(2), 301\u2013320 (2005)","journal-title":"J. Roy. Stat. Soc.: Ser. B (Stat. Methodol.)"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58115-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,30]],"date-time":"2021-03-30T08:37:14Z","timestamp":1617093434000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58115-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581145","9783030581152"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58115-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leiden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2020.liacs.leidenuniv.nl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"268","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":"99","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":"0","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":"37% - 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":"3","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":"2.2","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)"}}]}}