On genetic programming representations and fitness functions for interpretable dimensionality reduction
Created by W.Langdon from
gp-bibliography.bib Revision:1.8051
- @InProceedings{uriot:2022:GECCO,
-
author = "Thomas Uriot and Marco Virgolin and
Tanja Alderliesten and Peter Bosman",
-
title = "On genetic programming representations and fitness
functions for interpretable dimensionality reduction",
-
booktitle = "Proceedings of the 2022 Genetic and Evolutionary
Computation Conference",
-
year = "2022",
-
editor = "Alma Rahat and Jonathan Fieldsend and
Markus Wagner and Sara Tari and Nelishia Pillay and Irene Moser and
Aldeida Aleti and Ales Zamuda and Ahmed Kheiri and
Erik Hemberg and Christopher Cleghorn and Chao-li Sun and
Georgios Yannakakis and Nicolas Bredeche and
Gabriela Ochoa and Bilel Derbel and Gisele L. Pappa and
Sebastian Risi and Laetitia Jourdan and
Hiroyuki Sato and Petr Posik and Ofer Shir and Renato Tinos and
John Woodward and Malcolm Heywood and Elizabeth Wanner and
Leonardo Trujillo and Domagoj Jakobovic and
Risto Miikkulainen and Bing Xue and Aneta Neumann and
Richard Allmendinger and Inmaculada Medina-Bulo and
Slim Bechikh and Andrew M. Sutton and
Pietro Simone Oliveto",
-
pages = "458--466",
-
address = "Boston, USA",
-
series = "GECCO '22",
-
month = "9-13 " # jul,
-
organisation = "SIGEVO",
-
publisher = "Association for Computing Machinery",
-
publisher_address = "New York, NY, USA",
-
keywords = "genetic algorithms, genetic programming, Evolutionary
Machine Learning, dimensionality reduction,
interpretability unsupervised learning",
-
isbn13 = "978-1-4503-9237-2",
-
DOI = "doi:10.1145/3512290.3528849",
-
abstract = "Dimensionality reduction (DR) is an important
technique for data exploration and knowledge discovery.
However, most of the main DR methods are either linear
(e.g., PCA), do not provide an explicit mapping between
the original data and its lower-dimensional
representation (e.g., MDS, t-SNE, isomap), or produce
mappings that cannot be easily interpreted (e.g.,
kernel PCA, neural-based autoencoder). Recently genetic
programming (GP) has been used to evolve interpretable
DR mappings in the form of symbolic expressions. There
exists a number of ways in which GP can be used to this
end and no study exists that performs a comparison. In
this paper, we fill this gap by comparing existing GP
methods as well as devising new ones. We evaluate our
methods on several benchmark datasets based on
predictive accuracy and on how well the original
features can be reconstructed using the
lower-dimensional representation only. Finally we
qualitatively assess the resulting expressions and
their complexity. We find that various GP methods can
be competitive with state-of-the-art DR algorithms and
that they have the potential to produce interpretable
DR mappings.",
-
notes = "GECCO-2022 A Recombination of the 31st International
Conference on Genetic Algorithms (ICGA) and the 27th
Annual Genetic Programming Conference (GP)",
- }
Genetic Programming entries for
Thomas Uriot
Marco Virgolin
Tanja Alderliesten
Peter A N Bosman
Citations