lensen2019can.pdf (847.62 kB)
0/0

Can Genetic Programming Do Manifold Learning Too?

Download (847.62 kB)
conference contribution
posted on 16.06.2020 by Andrew Lensen, Bing Xue, Mengjie Zhang
© Springer Nature Switzerland AG 2019. Exploratory data analysis is a fundamental aspect of knowledge discovery that aims to find the main characteristics of a dataset. Dimensionality reduction, such as manifold learning, is often used to reduce the number of features in a dataset to a manageable level for human interpretation. Despite this, most manifold learning techniques do not explain anything about the original features nor the true characteristics of a dataset. In this paper, we propose a genetic programming approach to manifold learning called GP-MaL which evolves functional mappings from a high-dimensional space to a lower dimensional space through the use of interpretable trees. We show that GP-MaL is competitive with existing manifold learning algorithms, while producing models that can be interpreted and re-used on unseen data. A number of promising future directions of research are found in the process.

History

Preferred citation

Lensen, A., Xue, B. & Zhang, M. (2019, January). Can Genetic Programming Do Manifold Learning Too? In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (11451 LNCSpp. 114-130). Springer International Publishing. https://doi.org/10.1007/978-3-030-16670-0_8

Title of proceedings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volume

11451 LNCS

Publication or Presentation Year

01/01/2019

Pagination

114-130

Publisher

Springer International Publishing

Publication status

Published

ISSN

0302-9743

eISSN

1611-3349

Exports

Logo branding

Categories

Exports