{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T18:07:44Z","timestamp":1783015664182,"version":"3.54.6"},"reference-count":41,"publisher":"MIT Press","issue":"3","content-domain":{"domain":["direct.mit.edu"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,9,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Interaction\u2013Transformation (IT) is a new representation for Symbolic Regression that reduces the space of solutions to a set of expressions that follow a specific structure. The potential of this representation was illustrated in prior work with the algorithm called SymTree. This algorithm starts with a simple linear model and incrementally introduces new transformed features until a stop criterion is met. While the results obtained by this algorithm were competitive with the literature, it had the drawback of not scaling well with the problem dimension. This article introduces a mutation-only Evolutionary Algorithm, called ITEA, capable of evolving a population of IT expressions. One advantage of this algorithm is that it enables the user to specify the maximum number of terms in an expression. In order to verify the competitiveness of this approach, ITEA is compared to linear, nonlinear, and Symbolic Regression models from the literature. The results indicate that ITEA is capable of finding equal or better approximations than other Symbolic Regression models while being competitive to state-of-the-art nonlinear models. Additionally, since this representation follows a specific structure, it is possible to extract the importance of each original feature of a data set as an analytical function, enabling us to automate the explanation of any prediction. In conclusion, ITEA is competitive when comparing to regression models with the additional benefit of automating the extraction of additional information of the generated models.<\/jats:p>","DOI":"10.1162\/evco_a_00285","type":"journal-article","created":{"date-parts":[[2020,12,11]],"date-time":"2020-12-11T17:19:05Z","timestamp":1607707145000},"page":"367-390","update-policy":"https:\/\/doi.org\/10.1162\/mitpressjournals.corrections.policy","source":"Crossref","is-referenced-by-count":47,"title":["Interaction\u2013Transformation Evolutionary Algorithm for Symbolic Regression"],"prefix":"10.1162","volume":"29","author":[{"given":"F. O.","family":"de Franca","sequence":"first","affiliation":[{"name":"Center for Mathematics, Computation and Cognition, Heuristics, Analysis and Learning Laboratory, Federal University of ABC, Santo Andre, Brazil folivetti@ufabc.edu.br"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G. S. I.","family":"Aldeia","sequence":"additional","affiliation":[{"name":"Center for Mathematics, Computation and Cognition, Heuristics, Analysis and Learning Laboratory, Federal University of ABC, Santo Andre, Brazil guilherme.aldeia@ufabc.edu.br"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"281","published-online":{"date-parts":[[2021,9,1]]},"reference":[{"key":"2021090111591873500_B1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-319-16501-1_1","volume-title":"European Conference on Genetic Programming","author":"Albinati","year":"2015"},{"key":"2021090111591873500_B2","first-page":"1","volume-title":"2018 IEEE Congress on Evolutionary Computation","author":"Aldeia","year":"2018"},{"key":"2021090111591873500_B3","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1145\/2576768.2598291","volume-title":"Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation","author":"Arnaldo","year":"2014"},{"key":"2021090111591873500_B4","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1145\/2739480.2754693","volume-title":"Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation","author":"Arnaldo","year":"2015"},{"issue":"1","key":"2021090111591873500_B5","first-page":"5595","article-title":"Automatic differentiation in machine learning: A survey","volume":"18","author":"Baydin","year":"2017","journal-title":"The Journal of Machine Learning Research"},{"key":"2021090111591873500_B6","first-page":"10:100313","article-title":"GSGP-C++ 2.0: A geometric semantic genetic programming framework","author":"Castelli","year":"2019","journal-title":"SoftwareX"},{"key":"2021090111591873500_B7","article-title":"Nearest neighbor (NN) norms: NN pattern classification techniques","author":"Dasarathy","year":"1991","journal-title":"IEEE Computer Society Tutorial"},{"issue":"1\u20132","key":"2021090111591873500_B8","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0020-0255(02)00371-7","article-title":"Symbolic and numerical regression: Experiments and applications","volume":"150","author":"Davidson","year":"2003","journal-title":"Information Sciences"},{"key":"2021090111591873500_B9","first-page":"442:18","article-title":"A greedy search tree heuristic for symbolic regression","author":"de Franca","year":"2018","journal-title":"Information Sciences"},{"issue":"1","key":"2021090111591873500_B10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0020-0190(02)00204-1","article-title":"Evolutionary computing","volume":"82","author":"Eiben","year":"2002","journal-title":"Information Processing Letters"},{"key":"2021090111591873500_B11","first-page":"1","volume-title":"2018 IEEE Congress on Evolutionary Computation","author":"Fracasso","year":"2018"},{"issue":"5","key":"2021090111591873500_B12","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0893-6080(89)90020-8","article-title":"Multilayer feedforward networks are universal approximators","volume":"2","author":"Hornik","year":"1989","journal-title":"Neural Networks"},{"key":"2021090111591873500_B13","first-page":"1763","volume-title":"IEEE Congress on Evolutionary Computation","author":"Icke","year":"2013"},{"key":"2021090111591873500_B14","article-title":"darioizzo\/dcgp: Enable parallelization with pagmo","author":"Izzo","year":"2019"},{"key":"2021090111591873500_B15","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/978-3-319-55696-3_3","volume-title":"European Conference on Genetic Programming","author":"Izzo","year":"2017"},{"issue":"410","key":"2021090111591873500_B16","doi-asserted-by":"crossref","first-page":"594","DOI":"10.2307\/2289810","article-title":"Nonlinear regression analysis and its applications","volume":"85","author":"Kass","year":"1990","journal-title":"Journal of the American Statistical Association"},{"key":"2021090111591873500_B17","volume":"17","author":"Koza","year":"1994","journal-title":"Genetic programming II"},{"key":"2021090111591873500_B18","doi-asserted-by":"crossref","first-page":"1056","DOI":"10.1145\/3321707.3321776","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO)","author":"La Cava","year":"2019"},{"key":"2021090111591873500_B19","volume-title":"International Conference on Learning Representations","author":"La Cava","year":"2019"},{"key":"2021090111591873500_B20","first-page":"1092","article-title":"Size fair and homologous tree genetic programming crossovers","volume":"2","author":"Langdon","year":"1999","journal-title":"Proceedings of the 1st Annual Conference on Genetic and Evolutionary Computation"},{"issue":"3","key":"2021090111591873500_B21","first-page":"18","article-title":"Classification and regression by randomforest","volume":"2","author":"Liaw","year":"2002","journal-title":"R News"},{"key":"2021090111591873500_B22","article-title":"UCI machine learning repository","author":"Lichman","year":"2013"},{"key":"2021090111591873500_B23","first-page":"4765","article-title":"A unified approach to interpreting model predictions","author":"Lundberg","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"2021090111591873500_B24","doi-asserted-by":"crossref","first-page":"1151","DOI":"10.1145\/3205455.3205593","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference","author":"Martins","year":"2018"},{"key":"2021090111591873500_B25","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-1-4614-1770-5_13","article-title":"FFX: Fast, scalable, deterministic symbolic regression technology","author":"McConaghy","year":"2011","journal-title":"Genetic Programming Theory and Practice IX"},{"key":"2021090111591873500_B26","first-page":"1","article-title":"Cartesian genetic programming: Its status and future","author":"Miller","year":"2019","journal-title":"Genetic Programming and Evolvable Machines"},{"key":"2021090111591873500_B27","doi-asserted-by":"crossref","first-page":"2701","DOI":"10.1145\/1388969.1389075","volume-title":"Proceedings of the 10th Annual Conference Companion on Genetic and Evolutionary Computation","author":"Miller","year":"2008"},{"key":"2021090111591873500_B28","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/978-3-642-32937-1_3","volume-title":"International Conference on Parallel Problem Solving from Nature","author":"Moraglio","year":"2012"},{"issue":"1","key":"2021090111591873500_B29","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1109\/TEVC.2012.2195319","article-title":"The use of an analytic quotient operator in genetic programming","volume":"17","author":"Ni","year":"2012","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"1","key":"2021090111591873500_B30","doi-asserted-by":"crossref","DOI":"10.1186\/s13040-017-0154-4","article-title":"Pmlb: A large benchmark suite for machine learning evaluation and comparison","volume":"10","author":"Olson","year":"2017","journal-title":"BioData Mining"},{"issue":"Oct","key":"2021090111591873500_B31","first-page":"2825","article-title":"Scikit-learn: Machine learning in Python","volume":"12","author":"Pedregosa","year":"2011","journal-title":"Journal of Machine Learning Research"},{"issue":"3","key":"2021090111591873500_B32","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1162\/evco.1998.6.3.231","article-title":"Schema theory for genetic programming with one-point crossover and point mutation","volume":"6","author":"Poli","year":"1998","journal-title":"Evolutionary Computation"},{"key":"2021090111591873500_B33","author":"Poli","year":"2008","journal-title":"A field guide to genetic programming"},{"key":"2021090111591873500_B34","doi-asserted-by":"crossref","first-page":"1135","DOI":"10.1145\/2939672.2939778","volume-title":"Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"Ribeiro","year":"2016"},{"key":"2021090111591873500_B35","article-title":"Model-agnostic interpretability of machine learning","author":"Ribeiro","year":"2016"},{"key":"2021090111591873500_B36","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-030-44094-7_11","article-title":"SGP-DT: Semantic genetic programming based on dynamic targets","author":"Ruberto","year":"2020"},{"key":"2021090111591873500_B37","article-title":"Shogun 4.1.0---Tajinohi no Agatamori","author":"Sonnenburg","year":"2016"},{"issue":"5","key":"2021090111591873500_B38","doi-asserted-by":"crossref","first-page":"237","DOI":"10.2307\/3029337","article-title":"The generalized Weierstrass approximation theorem","volume":"21","author":"Stone","year":"1948","journal-title":"Mathematics Magazine"},{"issue":"2","key":"2021090111591873500_B39","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1023\/A:1022699900025","article-title":"Incremental induction of decision trees","volume":"4","author":"Utgoff","year":"1989","journal-title":"Machine Learning"},{"issue":"2","key":"2021090111591873500_B40","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1109\/TEVC.2008.926486","article-title":"Order of nonlinearity as a complexity measure for models generated by symbolic regression via Pareto genetic programming","volume":"13","author":"Vladislavleva","year":"2009","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"12","key":"2021090111591873500_B41","doi-asserted-by":"crossref","first-page":"1797","DOI":"10.1016\/S0008-8846(98)00165-3","article-title":"Modeling of strength of high-performance concrete using artificial neural networks","volume":"28","author":"Yeh","year":"1998","journal-title":"Cement and Concrete Research"}],"container-title":["Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/direct.mit.edu\/evco\/article-pdf\/29\/3\/367\/1959462\/evco_a_00285.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/direct.mit.edu\/evco\/article-pdf\/29\/3\/367\/1959462\/evco_a_00285.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,4]],"date-time":"2022-12-04T07:11:07Z","timestamp":1670137867000},"score":1,"resource":{"primary":{"URL":"https:\/\/direct.mit.edu\/evco\/article\/29\/3\/367\/97354\/Interaction-Transformation-Evolutionary-Algorithm"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":41,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2021,9,1]]},"published-print":{"date-parts":[[2021,9,1]]}},"URL":"https:\/\/doi.org\/10.1162\/evco_a_00285","relation":{},"ISSN":["1530-9304"],"issn-type":[{"value":"1530-9304","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2021]]},"published":{"date-parts":[[2021]]}}}