Search

• Pinch force strength is accurately predicted using sEMG. • Different pinch movements are accurately classified using sEMG. • Similarity of EMG features is evaluated. • An EMG feature-to-image method is proposed. The movement of intelligent EMG-driven prosthesis mainly relies on the synergy of different fingers to achieve function of grasping objects. The paper proposes a novel scheme for force prediction and movement classification about pinch between different fingers based on surface electromyography (sEMG) using machine learning. The pinch force and sEMG signals are recorded synchronously by a data acquisition device. Eight features are extracted, which are proven to have better performance in the estimation of sEMG-to-force. We present a novel feature selection method that uses the one-dimensional time series similarity assessment based on Manhattan distance to eliminate the repetitive information between features. Three optimal features carrying less repetitive information are retained. Seven machine learning algorithms are used to predict force strength. The results show that the Long Short Term Memory (LSTM) has the best performance of force prediction, achieving a R 2 of 0.9517 and RMSE of 3.2723. The paper proposes a novel method of converting EMG feature sequences to the normalized gray image in order to classify the finger movement. Five classifiers based on image feature extraction and the Convolutional Neural Network (CNN) are developed respectively. The experimental results indicate that the CNN performs best, achieving an accuracy of 97.66%. In this way, it not only realizes the accurate force prediction, but also realizes the movement classification between different fingers. The proposed methodology has the potential to realize simultaneous force and movement control of prosthetic hand. [ABSTRACT FROM AUTHOR]

Breast cancer was the most diagnosed form of cancer in 2020. Early diagnosis of breast cancer results in a significant improvement in long-term survival rates. Current methods require consultation with experts, which is expensive and time-consuming and thus may not be accessible to all. This paper seeks to train and evaluate supervised machine learning models for the accurate and efficient detection of breast cancer. The Wisconsin Breast Cancer Database dataset describes 30 attributes of cell nuclei, including, but not limited to, their radius, texture, and concavity. It contains 569 instances, 212 of which are malignant tumors. The Random Forest algorithm outperforms other algorithms in classifying breast tumors as either malignant or benign and is thus selected as our primary model. It is trained on two different subsets of the dataset having 16 and 8 features, respectively, identified with the help of multiple feature selection methods. The Random Forest models are tested post hyperparameter tuning on a holdout set, and accuracies of 100% and 99.30% respectively. The models are also compared with four other machine learning classification algorithms: Support Vector Machine (SVM), Decision Tree, Multilayer Perceptron, and K-Nearest Neighbors. The results confirm that Random Forest is the superior method for breast cancer diagnosis. [ABSTRACT FROM AUTHOR]

Feature selection refers to the process of identifying the most relevant and valuable features or characteristics in a dataset, and it is an important step that can improve the performance and accuracy of predictive models for machine learning and data mining. Feature selection is crucial in efficiently reducing the number of features, thereby enhancing classification accuracy. This, in turn, alleviates computational burdens and elevates the overall performance of machine learning algorithms. This paper extended the conventional manta ray foraging optimization (MRFO) algorithm to an improved binary MRFO (IBMFO) algorithm. IBMRFO serves as a search strategy for designing a wrapper-based feature selection approach. To commence, we introduce a novel mechanism, termed the chaotic tent map (CTM), aimed at initializing the population to fortify both the algorithm's exploitation capabilities and population diversity. Second, an adaptive somersault foraging (ASF) factor is tuned to avoid premature convergence. Finally, a binary mechanism is introduced to adapt the algorithm for binary feature selection dilemmas. Experiments are performed on 30 renowned UC Irvine machine learning repository datasets. The results of the student's t-test show that the classification algorithm has statistical significance. The findings unequivocally exhibit the superior performance of the proposed IBMRFO compared to other algorithms under scrutiny. Notably, the efficiency of the enhanced factors is assessed through rigorous testing. For post-publications supporting this work, readers can refer to https://github.com/ELF-CHEUNG/IBMRFO. • Novel chaotic tent map for population initialization from evolutionary computation. • Optimization methods based on enhanced evolutionary computation. • Adaptive factor enhances convergence rate and search efficiency of algorithm. • Extensive numerical and scientific simulations for verifications with UCI dataset. [ABSTRACT FROM AUTHOR]

Determining the correct mushroom species with the necessary ecological characteristics is critical to continue mushroom production, which is essential in gastronomy. The mushroom farmers and collectors technique may help identify toxic mushrooms by detecting poisonous mushrooms using images of different mushroom species with distinctive morphological features. However, it can be not easy to distinguish between species. This paper used a dataset of 6714 mushroom images obtained from nine different mushroom species to classify the mushroom species. For a more straightforward comprehension of mushroom images and feature extraction by reanalysis of data sets, data visualization was performed using Grad-CAM, LIME, and Heatmap methods. Residual block-based Convolutional Neural Network (CNN) architectures are trained to automatically classify the concatenated feature map obtained from the Grad-CAM, LIME, and Heatmap methods. After extracting the deep features of the images from each architecture, the Atom Search Optimization (ASO) algorithm has been used to select the most distinctive features. The 6714×9000 size of the concatenated feature map was reduced to 6714×600 using the ASO algorithm. Classification results were evaluated using six different classifiers based on the feature map obtained to determine the mushroom species. The nine classes of mushroom species were classified successfully with 95.45 % accuracy using the proposed model with the ASO algorithm and KNN classifier. The methodology introduces novel visualization techniques for interpreting CNN-based models' decisions in mushroom species classification tasks. Using metaheuristics-based CNN models with multi-feature fusion techniques allows the model to leverage diverse sources of information, potentially enhancing its ability to discriminate between mushroom species and achieve higher classification accuracy than existing methods. This study can advance the mushroom species classification field by introducing new methodologies, improving classification accuracy, providing insights into model interpretability, and facilitating knowledge transfer to related fields. • The proposed model automatically detects mushroom species. • Grad-CAM, LIME, and Heatmap methods based on CNN architectures are used to visualize mushroom images. • The ASO algorithm has been successfully applied to residual block-based CNN models for feature selection. • The hybrid model classification accuracy for different species of mushrooms is 95.45 %. [ABSTRACT FROM AUTHOR]

• BIM graphical and non-graphical data fusion strategy for BIM element classification. • Hierarchical Sequential Forward Selection (HSFS) algorithm for automatic and efficient BIM feature selection. • Multimodal deep learning model for end-to-end BIM element classification. • The developed method works for both general and fine-grained BIM element classes. • Over 98% classification accuracy, precision, recall, and F1-score. In Building Information Modeling (BIM)-based domain-specific applications, elements should be classified into fine-grained sub-categories concerning their graphical and/or non-graphical characteristics to support downstream tasks. Traditional rule-based and machine learning methods are either time-consuming or cannot meet fine-grained classification requirements in domain-specific applications. To overcome this challenge, this paper presents a novel framework based on BIM and Multi-Modal Deep Learning (MMDL) for automatic fine-grained BIM element classification. It begins with transforming multi-modal (i.e., graphical and non-graphical) element features from BIM models. A feature selection algorithm is then designed to determine relevant BIM element features automatically. Subsequently, an MMDL model is developed and deployed to fuse the selected multi-modal BIM element features for end-to-end fine-grained classification. The framework is validated with a BIM element classification dataset. The results show that fine-grained elements can be classified with high accuracy (over 98%) in an end-to-end manner, which is unattainable by other BIM element classification methods. [ABSTRACT FROM AUTHOR]

The high dimensionality of data hinders the learning ability of machine learning algorithms. Feature selection techniques can be used to reduce dimensionality, which is an important step for processing high-dimensional data. Feature selection solves this problem by removing irrelevant and redundant information, which can improve learning models, reduce calculation time, and improve learning accuracy. In this paper, a novel filter in mixed-attribute datasets for feature selection is proposed. The independent attributes are mixed or heterogeneous in the sense that both numerical and categorical attribute types may appear together in the same dataset. Based on the preordonnances theory, we use a new concept to quantify the relevance and redundancy of features even if there are heterogeneous (mixed-type) data. The technique for order preference by similarity to the ideal solution is one of the well-known multicriteria decision-making methods; it is utilized as a weighting and informative feature selection filter. To assess the effectiveness of the proposed method, several experiments, both simulated and real, are performed, including a comparison to other well-known filter methods. The experimental results show that, in most cases, the method yielded competitive results in comparison to other methods. • Introducing new criterions for relevance and complementarity. • Dealing with mixed-attribute datasets without requiring a preprocessing step. • The multi-criteria decision method, namely TOPSIS, is used to score the explanatory features. • Investigate the performance of the proposed filter in high-dimensional data by using simulated and real data sets. [ABSTRACT FROM AUTHOR]

Phonocardiogram (PCG) signals contains valuable information pertaining to heart valve functionality, rendering them potentially useful for early detection of cardiovascular diseases. Automated classification of heart sounds harbors great promise for identifying cardiac pathologies. This paper introduces a novel automated approach to classify normal and abnormal heart sounds. Our methodology involves partitioning heart sounds into four segments: S1, S2, systolic, and diastolic, followed by extraction of time–frequency and time-statistical features. Prior to data classification, we employ two techniques - particle Swarm optimization (PSO) and Sequential Forward Feature Selection (SFFS) - for efficient feature selection. We assess the performance of the proposed method on the Physionet Challenge 2016 database, utilizing the 10-fold cross-validation method. To address the issue of dataset imbalance, we apply the synthetic minority over-sampling technique (SMOTE) to create balanced datasets. Our approach surpasses existing methods in the literature, as evidenced by its superior accuracy, sensitivity, and specificity metrics. Specifically, our method achieves an accuracy of 98.03%, a sensitivity of 97.64%, and a specificity of 98.43% in distinguishing normal from abnormal heart sounds on the Physionet database. These findings outperform the results obtained by previously established methods evaluated on the Physionet 2016 challenge database. [ABSTRACT FROM AUTHOR]

In the machine learning field, especially in classification tasks, the model's design and construction are very important. Constructing the model via a limited set of features may sometimes bound the classification performance and lead to non-optimal performances that some algorithms can provide. To this end, Ensemble learning methods were proposed in the literature. These methods' main goal is to learn a set of models that provide features or predictions whose joint use could lead to a performance better than that obtained by the single model. In this paper, we propose three variants of a new efficient ensemble learning approach that was able to enhance the classification performance of a linear discriminant embedding method. As a case study we consider the efficient "Inter-class sparsity discriminative least square regression" method. We seek the estimation of an enhanced data representation. Instead of deploying multiple classifiers on top of the transformed features, we target the estimation of multiple extracted feature subsets obtained by multiple learned linear embeddings. These are associated with subsets of ranked original features. Multiple feature subsets were used for estimating the transformations. The derived extracted feature subsets were concatenated to form a single data representation vector that is used in the classification process. Many factors were studied and investigated in this paper including (Parameter combinations, number of models, different training percentages, feature selection methods combinations, etc.). Our proposed approach has been benchmarked on different image datasets of various sizes and types (faces, objects and scenes). The proposed scheme achieved competitive performance on four face image datasets (Extended Yale B, LFW-a, Gorgia and FEI) as well as on the COIL20 object dataset and the Outdoor Scene dataset. We measured the performance of our proposed schemes in comparison to (the single model ICS_DLSR, RDA_GD, RSLDA, PCE, LDE, LDA, SVM as well as the KNN algorithm) The conducted experiments showed that the proposed approach can enhance the classification performance in an efficient manner compared to the single-model based learning and was able to outperform its competing methods. • An enhanced discriminant linear data embedding is introduced. • It integrates feature selection and multiple transformed subsets (multiple models). • As a backbone model, we use the Inter-class sparsity discriminative least square regression. • Several comparisons between single models and multiple models are provided. • Classification performance after embedding is assessed on several public image datasets. [ABSTRACT FROM AUTHOR]

Feature selection aims to select crucial features to improve classification accuracy in machine learning and data mining. Existing methods concentrate on the classification information from candidate features while seldom considering the changing information supported by selected features. In this paper, we construct a dynamic support ratio (DSR), which employs the new information of selected features to support classification. DSR explicitly describes the dynamic interactions between selected features and candidate features. Simultaneously, the feature relevance and feature redundancy are treated adaptively. Thus, distinctive features can be noticed sensitively. Afterward, a novel feature selection method based on a dynamic support ratio (DSRFS) is proposed. The proposed method is established on 18 benchmark data sets with four different classifiers. Classification accuracy, standard deviation, recall and statistical validations are employed to measure the classification performance. Extensive experiments demonstrate that DSRFS not only reduces the dimension of the feature space effectively, but also obtains the best average classification accuracy. [ABSTRACT FROM AUTHOR]

Breast cancer is one of the leading killers of women around the world. Finding compounds with good bioactivity, metabolic dynamics and safety, including Absorption, Distribution, Metabolism, Excretion and Toxicity (ADMET for short), is a long and challenging task in breast cancer therapy. In the paper, molecular descriptor data of compounds was analyzed by the ensemble learning algorithm, and important features were selected for the development and validation of ADMET classification models. The overall process includes data cleaning, data splitting to training and testing sets, feature selection and classification model evaluation. A Two-Level Stacking Algorithm (TLSA) based on ensemble learning is proposed for ADMET classification. Various performance measures like classification accuracy, precision, recall, confusion matrix, F1-score, Receiver Operating Characteristic (ROC) curves and the Area Under the ROC Curves (AUC) are reported to show the superiority of the proposed method as compared to different classifiers. The experimental results show that the second level algorithm for TLSA utilizes Logistic Regression is better than other classifiers for the properties of Absorption, Distribution and Excretion, with accuracy of 94.6037%, 94.9410% and 88.1956% respectively. For the properties Metabolism and Toxicity, the second level algorithm utilizes Support Vector Machine to achieve the best classification performance, with accuracy of 88.8702% and 96.7960% respectively. The results show that the proposed approach works well with the classification of compound properties and can be a good alternative for the well-known machine learning program. • A novel TLSA model for ADMET classification of compounds is proposed. • The proposed method improves the accuracy of classification results. • Applying a wide range of evaluation metrics to ensure the model's reliability. • Most important molecular descriptors of compounds were selected using RF. [ABSTRACT FROM AUTHOR]

Paroxysmal atrial fibrillation (PAF) is a cardiac arrhythmia which is often challenging to diagnose because patients may be asymptomatic, and episodes are usually intermittent. In this paper we describe a method for identifying patients with a history of PAF using electrocardiogram (ECG) recordings during sinus rhythm. We analyzed, on a beat-to-beat basis, the P-waves in the sinus rhythm ECGs of 69 patients with a history of PAF and 59 healthy individuals. From each subject's P-waves, we calculated key electrocardiographic metrics, including some which are proposed here for the first time. Using means testing and feature selection methods, we discerned the features which were most useful for classification, and trained a Random Forest which identified PAF patients. Our approach achieved a 93.45% accuracy, sensitivity of 95.21%, and specificity of 91.40% using P-wave integral and novel amplitude and slope-based features which ranked highest in importance compared to other metrics from the literature. In particular, descriptive statistics of P-wave amplitudes, slopes, and integrals, were effective for identifying subjects with PAF history vs. healthy individuals. Our method has a high sensitivity and discrimination ability, with an AUC=0.9669 which is superior to others', and can thus be potentially valuable for the early identification of patients who are prone to episodes of PAF, even as part of the standard cardiological checkup that most adults undergo periodically. • Early identification of PAF during sinus rhythm with high accuracy. • P-wave signal metrics on a beat-to-beat basis are proposed. • P-wave amplitude, integral and slope features were ranked as the most important. • A RF classifier distinguishes PAF from healthy subjects with a state-of-the-art AUC. [ABSTRACT FROM AUTHOR]

Myocardial infarction (MI) is one of the leading causes of human mortality and morbidity around the world. Despite that much progress has been made for MI detection based on medical image analysis in recent years, most of them suffer from their expensiveness and invasive nature. In this paper, we demonstrate abnormalities of electrocardiogram (ECG) in a new quantifiable manner using nonlinear dynamics features and different classification models. Time-varying ECG data are represented as three-dimensional vectorcardiogram (VCG) and the underlying cardiac dynamics. Nonlinear dynamics measures, including entropy variability measures, complexity measures and chaotic measures, are calculated and fed into different machine learning methods for the classification task. The extracted nonlinear dynamics measures reflect in-depth cardiac dynamics characteristic, which is shown to be more sensitive to subtle ECG modifications. Therefore, it is expected to provide an early detection tool for latent ECG modifications before obvious diagnostic changes are observed. Experiments on the PTB database are conducted to demonstrate the efficiency of the proposed method. • We demonstrate abnormalities of ECG in a new quantifiable manner. • Vectorcardiogram and the underlying cardiac dynamics are extracted. • Nonlinear dynamics measures are calculated and fed into different classifiers. • We show good performance on the widely used PTB databases. [ABSTRACT FROM AUTHOR]

An intrusion detection system (IDS) is considered critical for detecting threats, intrusions, and unauthorized access. IDS monitors massive network traffic that includes irrelevant and extravagant features that profoundly impact the system's efficiency and slow down the classification process for accurate decisions. Its effectiveness is tested over the various techniques that comprise an enormous volume of data and heavy network traffic. Many approaches, such as machine learning algorithms, data mining, swarm intelligence, and artificial neural networks (ANN), have been implemented for adequate and improved IDSs. This paper recommends a novel feature selection method using a genetic algorithm (GA) that determines the optimal feature subsets from the NSL-KDD dataset. Further, hybrid classification has been performed using logistic regression (LR) and decision tree (DT) to achieve a better detection rate (DR) and accuracy (ACC). This research applied and compared several meta-heuristic algorithms' performance to optimize the selected optimal features. The experimental results show that the grey wolf optimization (GWO) algorithm gives the best accuracy of 99.44% and DR of 99.36% with the reduction of features (=20) out of (=41). The results of the proposed work are compared with the existing feature selection methods to verify improved performance. [Display omitted] • Novel feature selection method using a genetic algorithm (GA) that determines the optimal feature subsets. • Hybrid classification to achieve a better detection rate (DR) and accuracy (ACC). • Compared several meta-heuristic algorithms' performance to optimize the selected optimal features. • The grey wolf optimization (GWO) algorithm gives the best accuracy of 99.44% and DR of 99.36% with the reduction of features (=20) out of (=41). • Optimization for improvement of IDS. [ABSTRACT FROM AUTHOR]

Feature selection, which aims to screen out redundant and irrelevant features from datasets, is integral to machine learning and data mining. Grey Wolf Optimization (GWO) is a recent meta-heuristic algorithm based on swarm intelligence and has wide applicability to various optimization problems due to its fast convergence and few parameters. However, since the wolf pack is always dominated by the three leading wolves (i.e. , α , β and δ), the GWO algorithm suffers from weak exploration throughout the whole optimization process and easily stagnates into local optima. In this paper, an Adaptively Balanced Grey Wolf Optimization (ABGWO) algorithm is proposed to seek out the optimal feature subset for high-dimensional classification. Specifically, to improve the exploration ability of GWO, a random wolf is introduced to cooperate with α , β and δ. A novel level-based strategy is further adopted to select the random wolf. Besides, to dynamically modulate the exploration and exploitation ability in different optimization stages, an adaptive coefficient is introduced to regulate the leadership of α , β , δ and the randomly-selected wolf. Finally, the improvement of exploration and exploitation is validated on 12 high-dimensional datasets provided by Arizona State University and University of California Irvine, and the superiority of ABGWO is further verified by comparing it with seven state-of-the-art feature selection approaches on the aspect of classification accuracy, size of feature subset and computational time. • Introducing a random individual to prevent sharp decline in population diversity. • Semi-random selection prevents the rapid decrease of the convergence speed. • A coefficient factor linearly increases to adaptively adjust the exploration and exploitation. • The improved GWO algorithm for high-dimensional feature selection significantly boosts the classification performance. [ABSTRACT FROM AUTHOR]

Today, a significant number of biomedical data is generated continuously from various biomedical equipment and experiments due to rapid technological improvements in medical sciences. Effective biomedical data analysis, such as extracting biological and diagnostically significant features, is a very challenging task. This paper proposes hybrid Machine Learning Classification Techniques based on ensemble technique with Enhanced-Grey Wolf Optimization (E-GWO) feature selection algorithm to analyze these complex biomedical data. We combined five biomedical heart disease data sets for the experimental work: Cleveland, Long-Beach-VA, Switzerland, Hungarians, and Statlog. New hybrid Machine Learning Classification Techniques classifiers like Naive Bayes Bagging Technique (NBBT), Random Forest Bagging Technique (RFBT), Decision Tree Bagging Technique (DTBT), K-Nearest Neighbors Bagging Technique (KNNBT), Neural Network Bagging Technique (NNBT), Gradient Boosting Boosting Technique (GBBT), and Adaptive Boosting Boosting Technique (ABBT) are developed with bagging and boosting methods. Accuracy, Recall, Precision, F1-score, Specificity, Error Rate, G-mean, False Negative Rate (FNR), False Positive Rate (FPR), and Negative Predictive Value (NPV) are used to evaluate hybrid techniques. The experimental result shows that the developed hybrid classifier RFBT achieves the highest accuracy of 99.26% with E-GWO feature selection. The proposed method has 11.90% improved the accuracy to the conventional model. [ABSTRACT FROM AUTHOR]

In this paper we propose three novel feature ranking methods for supervised feature selection in the context of classification which are based on possibility theory. All three methods – nonspecificity, strife and total uncertainty – are tested on eight artificial data sets and ten medical real-world data sets and benchmarked against ReliefF, the Fisher score, the fuzzy entropy and similarity (FES), the Fuzzy similarity and entropy (FSAE) filter, symmetrical uncertainty as well as using no feature selection. The feature ranking methods were applied following two approaches: (1) using a fixed threshold for the number of highest-ranking features selected and (2) using a hybrid feature selection approach with a classifier (k-nearest neighbor classifier, decision tree, similarity classifier, SVM) to select the optimal number of features to select. The results indicate that strife and the Fisher score are the two feature ranking methods that for both approaches are on average ranked the highest in terms of the test set accuracy on the real-world data sets. Besides that, for the hybrid approach, strife uses most of the time a considerably smaller number of features than nonspecificity and total uncertainty. In terms of stability, which was measured with the adjusted stability measure (ASM), the Fisher score and strife were among the most stable feature ranking methods in this study. Additionally, strife's feature subsets were diverse compared to those of the remaining feature selection methods, making it a good candidate to be included in a feature selection ensemble. [ABSTRACT FROM AUTHOR]

Sine Cosine Algorithm (SCA) that is one of the population-based metaheuristic optimization algorithms basically consists of the updating mechanism based on sine and cosine functions. In this algorithm, a few random and adaptive variables are also utilized for more effective motions of the candidate solutions. SCA has some drawbacks like other some metaheuristic algorithms. SCA tends to be stuck into the local regions in the search space and this affects negatively on the computational effort required to find the best solution point in the search space. This paper presents four different improved versions of SCA. The proposed improvements on original SCA are the innovations on the updating mechanism of SCA. To evaluate the performances of Improved Sine Cosine Algorithms (ImpSCAs), well-known numerical optimization problems including CEC 2014 test suite are used. Firstly, different analyses of the proposed ImpSCAs are dealt with such as the convergence analysis, search history analysis, trajectory analysis, average distance analysis, and computational complexity analysis. Secondly, the proposed four versions of ImpSCAs are compared with the original SCA for CEC 2014 benchmark problems with dimension sizes of 10D, 30D and 50D. Finally, original SCA and ImpSCAs are adapted to select optimal feature combination and they are tested for 10 feature selection datasets taken from the UCI machine learning repository. The benchmark results show that the performances of the ImpSCA 1 , ImpSCA 2 , and ImpSCA 4 are better than that of the original SCA. From the feature selection results, it is observed that three versions of ImpSCAs (except ImpSCA 3) outperform the original SCA in 80% of the datasets. Source codes of ImpSCAs are publicly available at https://github.com/uguryuzgec/ImpSCAs. • We focused to improve the exploration and exploitation ability of the original SCA. • The basic idea is based on the innovations on the update mechanism. • The ISCAs were evaluated using CEC2014 benchmark test suite. • The proposed ISCAs were tested for 10 popular UCI datasets. • Three versions of ISCAs (except ISCA 3) outperform the SCA in 80% of the datasets. [ABSTRACT FROM AUTHOR]