Binary hybrid pathfinder algorithm for efficient feature selection in resource-constrained embedded systems

Abstract

Feature selection is critical for embedded machine learning systems where computational resources and memory are severely constrained. This paper presents the binary quadratically interpolated hybrid pathfinder algorithm (BQIHPFA), a novel metaheuristic optimization method designed for efficient feature subset selection in resource-limited classification tasks. BQIHPFA adapts the continuous QIHPFA to binary search spaces through sigmoid transfer functions and employs a hybrid two-group enhancement strategy combining pathfinder dynamics with salp swarm algorithm-inspired exploration. We evaluate BQIHPFA against three established binary optimization algorithms (binary particle swarm optimization (BPSO), binary grey wolf optimizer (BGWO), and binary whale optimization (BWO)) on three benchmark datasets with varying dimensionalities: Língua Brasileira de Sinais (Brazilian Sign Language) movement (90 features), Parkinson's disease detection (22 features), and Sonar Rock vs. Mine (60 features). Experimental results demonstrate that BQIHPFA achieves competitive classification accuracy (average 83.57%) with substantial feature reduction (average 64.1%) while executing 5.2 times faster than complex baselines and consuming minimal memory (peak: 45-58 MB). Ablation experiments demonstrate that every algorithmic part makes a 8-24% contribution to the total performance. BQIHPFA offers an easy-to-use, non-specific feature selection method to automated resource-constrained embedded classification systems, applicable to be deployed to low-power computing environments, and internet of things (IoT) edge systems.