paper-with-me

홈 › Papers

Can Genetic Programming Do Manifold Learning Too?

2019-02-08 · Andrew Lensen, Bing Xue, Mengjie Zhang

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.

📄 PDF Abstract BibTeX arXiv:1902.02949

Code (0)

등록된 구현이 없습니다.

Tasks

Dimensionality Reduction

Similar Papers 제목 키워드 기반

Genetic Programming for Manifold Learning: Preserving Local Topology

2021-08-23 · Andrew Lensen, Bing Xue, Mengjie Zhang

Manifold learning methods are an invaluable tool in today's world of increasingly huge datasets. Manifold learning algorithms can discover a much lower-dimensional representation (embedding) of a high-dimensional dataset…

Genetic Programming for Explainable Manifold Learning

2024-03-21 · Ben Cravens, Andrew Lensen, Paula Maddigan, Bing Xue

Manifold learning techniques play a pivotal role in machine learning by revealing lower-dimensional embeddings within high-dimensional data, thus enhancing both the efficiency and interpretability of data analysis by tra…

Multi-Objective Genetic Programming for Manifold Learning: Balancing Quality and Dimensionality

2020-01-05 · Andrew Lensen, Mengjie Zhang, Bing Xue

Manifold learning techniques have become increasingly valuable as data continues to grow in size. By discovering a lower-dimensional representation (embedding) of the structure of a dataset, manifold learning algorithms …

Enhancing Generalization in Evolutionary Feature Construction for Symbolic Regression through Vicinal Jensen Gap Minimization

2026-02-02 · Hengzhe Zhang, Qi Chen, Bing Xue, Wolfgang Banzhaf 외 arxiv

Genetic programming-based feature construction has achieved significant success in recent years as an automated machine learning technique to enhance learning performance. However, overfitting remains a challenge that li…

Intrusion DetectionData AugmentationNoise Estimation

Liquid State Genetic Programming

2023-12-05 · Mihai Oltean

A new Genetic Programming variant called Liquid State Genetic Programming (LSGP) is proposed in this paper. LSGP is a hybrid method combining a dynamic memory for storing the inputs (the liquid) and a Genetic Programming…

Benchmarking