about
Can Genetic Programming Do Manifold Learning Too? (arxiv.org)
4 points by henning on Jul 13, 2019 | hide | past | pdf | discuss on HN

In plain words: It breeds simple tree-shaped formulas that squeeze many data features into a few, so you can read exactly how the reduction is done. These formulas matched standard reduction techniques while staying readable and reusable on new data.

Abstract

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.

Andrew Lensen, Bing Xue, Mengjie Zhang
arXiv:1902.02949 · cs.NE, cs.IT · submitted Feb 8, 2019
abstract · pdf · html · 16 pages, accepted in EuroGP '19

add comment on HN