Search

• A feature selection method based on binary dandelion algorithm is proposed. • The algorithm applies a sine-cosine operator and a restart strategy. • Mutual information and quick bit mutation improve the performance of the algorithm. • The algorithm performs well on datasets with larger dimensions. Feature selection (FS) is an important data preprocessing technology for machine learning and data mining. Metaheuristic algorithm (MH) has been widely used in feature selection because of its powerful search function. This paper presents an improved Binary Dandelion Algorithm using Sine Cosine operator and Restart strategy (SCRBDA) for feature selection. First, the sine cosine operator is used in the radius formula of the core dandelions (CD), which significantly enhances the ability of algorithm development and exploration. Secondly, the algorithm uses a restart strategy to increase its ability to get rid of local optimum. Thirdly, mutual information is used to guide the generation of some dandelions, which pays more attention to the correlation between the selected features and categories. Finally, quick bit mutation is used as the mutation strategy to improve the diversity of the population. The SCRBDA proposed in this paper was tested on 18 datasets of different sizes from UCI machine learning database. The SCRBDA was compared with 8 other classical feature selection algorithms, and the performance of the proposed algorithm was evaluated through feature subset size, classification accuracy, fitness value, and F1-score. The experimental results show that SCRBDA achieves the best performance, which has stronger feature reduction ability and achieves better overall performance on most datasets. Especially on large-scale datasets, SCRBDA can obtain extremely smaller feature subsets while maintaining much higher classification accuracy, and satisfactory F1-score. [ABSTRACT FROM AUTHOR]

Accurate and timely diagnosis of Type 2 Diabetes is a highly challenging task due to its initial asymptomatic nature and complex risk factor composition. Recently, Machine Learning (ML) has been actively used to build improved Type 2 Diabetes classification systems. One important aspect of these systems has been feature selection. Filter feature selection techniques especially based on mutual information have been popularly employed in recent works. However, most of them have focused on selecting relevant features and eliminating redundant ones. A third relationship called feature interaction may exist if input features are highly correlated, as in the case of Type 2 Diabetes. Feature interaction signifies the additional information about the target provided by the interaction between a subset of input features, that may not be relevant to the target individually. Second, many of the existing ML models are black-box, making the model interpretability very difficult. This paper proposes an efficient ML framework for the classification of Prediabetes and Type 2 Diabetes by incorporating feature interactions. It presents a hybrid filter-wrapper technique called Feature Interaction-based Greedy Sequential Feature selection. Agglomerative Feature Clustering and Dendrogram visualization for the analysis of interactive features is performed. A model-agnostic explainability technique of SHapley Additive explanations (SHAP) is augmented to provide local and global explanations of model predictions. The performance of the proposed classification framework was found to be interpretable as well as efficient with an accuracy of 98.8669%, precision of 98.8660%, recall of 98.8665%, and F-score of 0.9886 for Diabetes. For Prediabetes, an accuracy of 90.1187%, precision of 94.6958%, recall of 90.1187%, and F-score of 0.9403 was obtained. [ABSTRACT FROM AUTHOR]