A high-dimensional feature selection method based on feature interaction clustering and integer-encoded TLBO

DOI10.1007/S40314-025-03408-3MaRDI QIDQ6871031zbMATH OpenFDO

Authors Xiaoxia Wang, Shuisheng Zhou, Binjie Hou, Yazhi Li

Publication date 20 January 2026

Published in Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S40314-025-03408-3

zbMATH Keywords

feature selectionteaching-learning-based optimizationinformation gainadaptive clusteringhigh-dimensional low-sample-size datasets

Mathematics Subject Classification ID

Statistical aspects of big data and data science (62R07)

Cites work

• A problem-specific non-dominated sorting genetic algorithm for supervised feature selection
• Algorithms for square root of semi-infinite quasi-Toeplitz $M$-matrices
• Binary differential evolution with self-learning for multi-objective feature selection
• Clustering single-cell data based on a deep embedded subspace model
• Global bounds of backward errors of polynomial eigenvalue problem solved by a companion linearization
• Markov blanket-embedded genetic algorithm for gene selection
• Proving the stability estimates of variational least-squares kernel-based methods
• Theoretical and empirical analysis of ReliefF and RReliefF

This page was built for publication: A high-dimensional feature selection method based on feature interaction clustering and integer-encoded TLBO

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6871031)