# A dynamic multitask evolutionary algorithm for high-dimensional feature selection based on multi-indicator task construction and elite competition learning

**Authors:** Jinxin Tie, Chunfang Yan, Maosong Li, Jianqiang Gong, Yujie Wu, Hailin Fang, Meng Li, Weiwei Zhang, Jie Li

PMC · DOI: 10.3389/frai.2025.1667167 · Frontiers in Artificial Intelligence · 2025-10-20

## TL;DR

This paper introduces a new evolutionary algorithm that improves feature selection in high-dimensional data by using multitask learning and competitive optimization techniques.

## Contribution

The novel framework combines multi-indicator task construction with elite competition learning to enhance feature selection efficiency and accuracy.

## Key findings

- The proposed algorithm achieved the highest accuracy on 11 out of 13 datasets.
- It selected the fewest features on eight out of 13 datasets with an average dimensionality reduction of 96.2%.
- The method demonstrated superior performance in balancing exploration, exploitation, and knowledge sharing.

## Abstract

High-dimensional data often contain noisy and redundant features, posing challenges for accurate and efficient feature selection. To address this, a dynamic multitask learning framework is proposed, which integrates competitive learning and knowledge transfer within an evolutionary optimization setting. The framework begins by generating two complementary tasks through a multi-criteria strategy that combines multiple feature relevance indicators, ensuring both global comprehensiveness and local focus. These tasks are optimized in parallel using a competitive particle swarm optimization algorithm enhanced with hierarchical elite learning, where each particle learns from both winners and elite individuals to avoid premature convergence. To further improve optimization efficiency and diversity, a probabilistic elite-based knowledge transfer mechanism is introduced, allowing particles to selectively learn from elite solutions across tasks. Experimental results on 13 high-dimensional benchmark datasets demonstrate that the proposed algorithm achieves superior classification accuracy with fewer selected features compared to several state-of-the-art methods. Across 13 benchmarks, the proposed method achieves the highest accuracy on 11 out of 13 datasets and the fewest features on eight out of 13, with an average accuracy of 87.24% and an average dimensionality reduction of 96.2% (median 200 selected features), clearly validating its effectiveness in balancing exploration, exploitation, and knowledge sharing for robust feature selection.

## Full-text entities

- **Diseases:** Lymphoma (MESH:D008223), Lung Cancer (MESH:D008175), Leukemia 2 (MESH:D007938)
- **Chemicals:** CY (MESH:D003545), CSO (-)
- **Species:** Nicotiana tabacum (American tobacco, species) [taxon 4097], Jaya (genus) [taxon 2028856]
- **Cell lines:** Nci9 — Homo sapiens (Human), Induced pluripotent stem cell (CVCL_RG56), Prostate6033 — Homo sapiens (Human), Finite cell line (CVCL_X329), NCI9 — Homo sapiens (Human), Transformed cell line (CVCL_2642)

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/PMC12580185/full.md

## Figures

8 figures with captions in the complete paper: https://tomesphere.com/paper/PMC12580185/full.md

## References

36 references — full list in the complete paper: https://tomesphere.com/paper/PMC12580185/full.md

---
Source: https://tomesphere.com/paper/PMC12580185