- No file added yet -
Can Genetic Programming Do Manifold Learning Too?
conference contribution
posted on 2020-06-16, 22:17 authored by Andrew LensenAndrew Lensen, Bing XueBing Xue, Mengjie ZhangMengjie 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_8Publisher DOI
Title of proceedings
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Volume
11451 LNCSPublication or Presentation Year
2019-01-01Pagination
114-130Publisher
Springer International PublishingPublication status
PublishedISSN
0302-9743eISSN
1611-3349Usage metrics
Categories
No categories selectedLicence
Exports
RefWorksRefWorks
BibTeXBibTeX
Ref. managerRef. manager
EndnoteEndnote
DataCiteDataCite
NLMNLM
DCDC