TY - GEN
T1 - Unlabeled multi-target regression with genetic programming
AU - Lopez, Uriel
AU - Trujillo, Leonardo
AU - Silva, Sara
AU - Vanneschi, Leonardo
AU - Legrand, Pierrick
N1 - info:eu-repo/grantAgreement/FCT/3599-PPCDT/DSAIPA%2FDS%2F0113%2F2019/PT#
info:eu-repo/grantAgreement/FCT/3599-PPCDT/DSAIPA%2FDS%2F0022%2F2018/PT#
info:eu-repo/grantAgreement/FCT/3599-PPCDT/PTDC%2FCCI-INF%2F29168%2F2017/PT#
Lopez, U., Trujillo, L., Silva, S., Vanneschi, L., & Legrand, P. (2020). Unlabeled multi-target regression with genetic programming. In GECCO 2020: Proceedings of the 2020 Genetic and Evolutionary Computation Conference (pp. 976-984). (GECCO 2020 - Proceedings of the 2020 Genetic and Evolutionary Computation Conference). Association for Computing Machinery. https://doi.org/10.1145/3377930.3389846
PY - 2020/6/25
Y1 - 2020/6/25
N2 - Machine Learning (ML) has now become an important and ubiquitous tool in science and engineering, with successful applications in many real-world domains. However, there are still areas in need of improvement, and problems that are still considered difficult with off-the-shelf methods. One such problem is Multi Target Regression (MTR), where the target variable is a multidimensional tuple instead of a scalar value. In this work, we propose a more difficult variant of this problem which we call Unlabeled MTR (uMTR), where the structure of the target space is not given as part of the training data. This version of the problem lies at the intersection of MTR and clustering, an unexplored problem type. Moreover, this work proposes a solution method for uMTR, a hybrid algorithm based on Genetic Programming and RANdom SAmple Consensus (RANSAC). Using a set of benchmark problems, we are able to show that this approach can effectively solve the uMTR problem.
AB - Machine Learning (ML) has now become an important and ubiquitous tool in science and engineering, with successful applications in many real-world domains. However, there are still areas in need of improvement, and problems that are still considered difficult with off-the-shelf methods. One such problem is Multi Target Regression (MTR), where the target variable is a multidimensional tuple instead of a scalar value. In this work, we propose a more difficult variant of this problem which we call Unlabeled MTR (uMTR), where the structure of the target space is not given as part of the training data. This version of the problem lies at the intersection of MTR and clustering, an unexplored problem type. Moreover, this work proposes a solution method for uMTR, a hybrid algorithm based on Genetic Programming and RANdom SAmple Consensus (RANSAC). Using a set of benchmark problems, we are able to show that this approach can effectively solve the uMTR problem.
KW - Clustering
KW - Genetic programming
KW - Multi-target regression
KW - RANSAC
KW - Unlabeled multi-target regression
UR - http://www.scopus.com/inward/record.url?scp=85091790533&partnerID=8YFLogxK
UR - http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=Alerting&SrcApp=Alerting&DestApp=WOS_CPL&DestLinkType=FullRecord&UT=WOS:000605292300113
U2 - 10.1145/3377930.3389846
DO - 10.1145/3377930.3389846
M3 - Conference contribution
AN - SCOPUS:85091790533
T3 - GECCO 2020 - Proceedings of the 2020 Genetic and Evolutionary Computation Conference
SP - 976
EP - 984
BT - GECCO 2020
PB - ACM - Association for Computing Machinery
T2 - 2020 Genetic and Evolutionary Computation Conference, GECCO 2020
Y2 - 8 July 2020 through 12 July 2020
ER -