# Solving classification problems using Traceless Genetic Programming

arXiv: https://arxiv.org/abs/2111.14790 · HTML: https://mlsanity.com/paper/2111.14790/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 1 of its 6 references that are in the map.
- First posted on arXiv 7 Oct 2021.

## Builds on (most cited first, 1 of 1)

- [Solving even-parity problems using traceless genetic programming](https://mlsanity.com/paper/2110.02014/) (2021)

## Abstract (arXiv)

Traceless Genetic Programming (TGP) is a new Genetic Programming (GP) that may be used for solving difficult real-world problems. The main difference between TGP and other GP techniques is that TGP does not explicitly store the evolved computer programs. In this paper, TGP is used for solving real-world classification problems taken from PROBEN1. Numerical experiments show that TGP performs similar and sometimes even better than other GP techniques for the considered test problems.
