C-UCB: chaos upper confidence bound in reinforcement learning for feature selection
摘要
Effective feature selection becomes increasingly important as medical data volumes increase. Despite this, existing dimensionality reduction techniques typically fail to address the unique challenges posed by medical datasets, such as their high dimensionality, class imbalance, and ethical imperative to use sensitive patient information as little as possible. To improve feature selection for medical data, this paper presents a novel reinforcement learning approach. Unlike traditional wrapper methods, which are prone to local optima and premature convergence, our approach leverages a chaos-based upper confidence bound (C-UCB) algorithm to dynamically adjust key parameters, such as the exploration coefficient (c) and the number of inner loop iterations (N), based on the mean reward from previous iterations. This dynamic adjustment not only improves algorithm performance but also significantly reduces computation time. Our experiments demonstrate that the proposed method outperforms state-of-the-art algorithms, improving the objective function by 51.43%, 42.86%, 88.57%, 71.43%, and 68.57%, compared to simulated annealing (SA), gray wolf optimization (GWO), pathfinder algorithm (PFA),