Open Access
ARTICLE
A Novel Hybrid Sine Cosine-Flower Pollination Algorithm for Optimized Feature Selection
1 Department of Mathematics, Lahore College For Women University (LCWU), Lahore, Pakistan
2 Department of Mathematics, Forman Christian College University (FCCU), Lahore, Pakistan
3 Faculty of Computer Information Systems, Higher Colleges of Technology, Abu Dhabi, United Arab Emirates
4 Department of Computer Engineering, College of Computer and Information Sciences, King Saud University, Riyadh, Saudi Arabia
* Corresponding Author: Shazia Javed. Email:
(This article belongs to the Special Issue: Advancing Feature Engineering for Knowledge Discovery and Explainable AI)
Computers, Materials & Continua 2026, 87(2), 82 https://doi.org/10.32604/cmc.2026.071977
Received 17 August 2025; Accepted 22 December 2025; Issue published 12 March 2026
Abstract
Data serves as the foundation for training and testing machine learning and artificial intelligence models. The most fundamental part of data is its attributes or features. The feature set size changes from one dataset to another. Only the relevant features contribute meaningfully to classification accuracy. The presence of irrelevant features reduces the system’s effectiveness. Classification performance often deteriorates on high-dimensional datasets due to the large search space. Thus, one of the significant obstacles affecting the performance of the learning process in the majority of machine learning and data mining techniques is the dimensionality of the datasets. Feature selection (FS) is an effective preprocessing step in classification tasks. The aim of applying FS is to exclude redundant and unrelated features while retaining the most informative ones to optimize classification capability and compress computational complexity. In this paper, a novel hybrid binary metaheuristic algorithm, termed hSC-FPA, is proposed by hybridizing the Flower Pollination Algorithm (FPA) and the Sine Cosine Algorithm (SCA). Hybridization controls the exploration capacity of SCA and the exploitation behavior of FPA to maintain a balanced search process. SCA guides the global search in the early iterations, while FPA’s local pollination refines promising solutions in later stages. A binary conversion mechanism using a threshold function is implemented to handle the discrete nature of the feature selection problem. The functionality of the proposed hSC-FPA is authenticated on fourteen standard datasets from the UCI repository using the K-Nearest Neighbors (K-NN) classifier. Experimental results are benchmarked against the standalone SCA and FPA algorithms. The hSC-FPA consistently achieves higher classification accuracy, selects a more compact feature subset, and demonstrates superior convergence behavior. These findings support the stability and outperformance of the hybrid feature selection method presented.Keywords
Cite This Article
Copyright © 2026 The Author(s). Published by Tech Science Press.This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Submit a Paper
Propose a Special lssue
View Full Text
Download PDF
Downloads
Citation Tools