A New Approach for Coronary Artery Diseases Diagnosis Based on Genetic Algorithm

2019 ◽  
pp. 44-59
Author(s):  
Sidahmed Mokeddem ◽  
Baghdad Atmani ◽  
Mostéfa Mokaddem
Keyword(s):  
Genetic Algorithm ◽  
Coronary Artery ◽  
Classification Accuracy ◽  
Selection Procedure ◽  
Machine Learning Algorithms ◽  
Feature Model ◽  
Support Vector ◽  
Coronary Artery Diseases ◽  
C4.5 Decision Tree ◽  
Pertinent Feature

Feature Selection (FS) has become the motivation of much research on decision support systems areas for which datasets with large number of features are analyzed. This paper presents a new method for the diagnosis of Coronary Artery Diseases (CAD) founded on Genetic Algorithm (GA) wrapper Bayes Naïve (BN). Initially, thirteen attributes were involved in predicting CAD. In GA–BN algorithm, GA produces in each iteration a subset of attributes that will be evaluated using the BN in the second step of the selection procedure. The final result set of attribute holds the most pertinent feature model that increases the accuracy. The accuracy results showed that the algorithm produces 85.50% classification accuracy in the diagnosis of CAD. Therefore, the strength of the Algorithm is then compared with other machine learning algorithms such as Support Vector Machine (SVM), Multi-Layer Perceptron (MLP) and C4.5 decision tree Algorithm. The result of classification accuracy for those algorithms are respectively 83.5%, 83.16% and 80.85%. Then, the GA wrapper BN Algorithm is similarly compared with other FS algorithms. The Obtained results have shown very favorable outcomes for the diagnosis of CAD.

A New Approach for Coronary Artery Diseases Diagnosis Based on Genetic Algorithm

2014 ◽  
Vol 6 (4) ◽  
pp. 1-15 ◽  
Author(s):  
Sidahmed Mokeddem ◽  
Baghdad Atmani ◽  
Mostéfa Mokaddem
Keyword(s):  
Genetic Algorithm ◽  
Coronary Artery ◽  
Classification Accuracy ◽  
Selection Procedure ◽  
Machine Learning Algorithms ◽  
Feature Model ◽  
Support Vector ◽  
Coronary Artery Diseases ◽  
C4.5 Decision Tree ◽  
Pertinent Feature

Feature Selection (FS) has become the motivation of much research on decision support systems areas for which datasets with large number of features are analyzed. This paper presents a new method for the diagnosis of Coronary Artery Diseases (CAD) founded on Genetic Algorithm (GA) wrapper Bayes Naïve (BN). Initially, thirteen attributes were involved in predicting CAD. In GA–BN algorithm, GA produces in each iteration a subset of attributes that will be evaluated using the BN in the second step of the selection procedure. The final result set of attribute holds the most pertinent feature model that increases the accuracy. The accuracy results showed that the algorithm produces 85.50% classification accuracy in the diagnosis of CAD. Therefore, the strength of the Algorithm is then compared with other machine learning algorithms such as Support Vector Machine (SVM), Multi-Layer Perceptron (MLP) and C4.5 decision tree Algorithm. The result of classification accuracy for those algorithms are respectively 83.5%, 83.16% and 80.85%. Then, the GA wrapper BN Algorithm is similarly compared with other FS algorithms. The Obtained results have shown very favorable outcomes for the diagnosis of CAD.

scholarly journals Classification of SSVEP-based BCIs using Genetic Algorithm

2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Hamideh Soltani ◽  
Zahra Einalou ◽  
Mehrdad Dadgostar ◽  
Keivan Maghooli
Keyword(s):  
Genetic Algorithm ◽  
Dimension Reduction ◽  
Classification Accuracy ◽  
Bayesian Method ◽  
Computer Interface ◽  
Support Vector ◽  
Svm Classifier ◽  
Effective Dimension ◽  
Effective Dimension Reduction

AbstractBrain computer interface (BCI) systems have been regarded as a new way of communication for humans. In this research, common methods such as wavelet transform are applied in order to extract features. However, genetic algorithm (GA), as an evolutionary method, is used to select features. Finally, classification was done using the two approaches support vector machine (SVM) and Bayesian method. Five features were selected and the accuracy of Bayesian classification was measured to be 80% with dimension reduction. Ultimately, the classification accuracy reached 90.4% using SVM classifier. The results of the study indicate a better feature selection and the effective dimension reduction of these features, as well as a higher percentage of classification accuracy in comparison with other studies.

scholarly journals A Novel Fast Training Method for SVM and Its Application in Fault Diagnosis of Service Robot

2015 ◽  
Vol 11 (6) ◽  
pp. 4 ◽  
Author(s):  
Xianfeng Yuan ◽  
Mumin Song ◽  
Fengyu Zhou ◽  
Yugang Wang ◽  
Zhumin Chen
Keyword(s):  
Fault Diagnosis ◽  
Classification Accuracy ◽  
Machine Learning Algorithms ◽  
Sensor Data ◽  
Service Robot ◽  
Support Vector ◽  
Svm Classifier ◽  
Processing Unit ◽  
Training Method ◽  
Fast Training

Support Vector Machines (SVM) is a set of popular machine learning algorithms which have been successfully applied in diverse aspects, but for large training data sets the processing time and computational costs are prohibitive. This paper presents a novel fast training method for SVM, which is applied in the fault diagnosis of service robot. Firstly, sensor data are sampled under different running conditions of the robot and those samples are divided as training sets and testing sets. Secondly, the sampled data are preprocessed and the principal component analysis (PCA) model is established for fault feature extraction. Thirdly, the feature vectors are used to train the SVM classifier, which achieves the fault diagnosis of the robot. To speed up the training process of SVM, on the one hand, sample reduction is done using the proposed support vectors selection (SVS) algorithm, which can ensure good classification accuracy and generalization capability. On the other hand, we take advantage of the excellent parallel computing abilities of Graphics Processing Unit (GPU) to pre-calculate the kernel matrix, which avoids the recalculation during the cross validation process. Experimental results illustrate that the proposed method can significantly reduce the training time without decreasing the classification accuracy.

scholarly journals Classification of Emotional States Inparkinson’s Disease Patients Using Time,Frequency and Time-Frequency Analysis

2021 ◽  
Author(s):  
Rejith K.N ◽  
Kamalraj Subramaniam ◽  
Ayyem Pillai Vasudevan Pillai ◽  
Roshini T V ◽  
Renjith V. Ravi ◽  
...  
Keyword(s):  
Frequency Domain ◽  
Classification Accuracy ◽  
Machine Learning Algorithms ◽  
Signal Frequency ◽  
Spectral Energy ◽  
Support Vector ◽  
Svm Classifier ◽  
Time Frequency ◽  
Energy Entropy ◽  
Teager Energy

Abstract In this work, PD patients and healthy individuals were categorized with machine-learning algorithms. EEG signals associated with six different emotions, (Happiness(E1), Sadness(E2), Fear(E3), Anger(E4), Surprise,(E5) and disgust(E6)) were used for the study. EEG data were collected from 20 PD patients and 20 normal controls using multimodal stimuli. Different features were used to categorize emotional data. Emotional recognition in Parkinson’s disease (PD) has been investigated in three domains namely, time, frequency and time frequency using Entropy, Energy-Entropy and Teager Energy-Entropy features. Three classifiers namely, K-Nearest Neighbor Algorithm, Support Vector Machine and Probabilistic Neural Network were used to observethe classification results. Emotional EEG stimuli such as anger, surprise, happiness, sadness, fear, and disgust were used to categorize PD patients and healthy controls (HC). For each EEG signal, frequency features corresponding to alpha, beta and gamma bands were obtained for nine feature extraction methods (Entropy, Energy Entropy, Teager Energy Entropy, Spectral Entropy, Spectral Energy-Entropy, Spectral Teager Energy-Entropy, STFT Entropy, STFT Energy-Entropy and STFT Teager Energy-Entropy). From the analysis, it is observed that the entropy feature in frequency domain performs evenly well (above 80 %) for all six emotions with KNN. Classification results shows that using the selected energy entropy combination feature in frequency domain provides highest accuracy for all emotions except E1 and E2 for KNN and SVM classifier, whereas other features give accuracy values of above 60% for most emotions.It is also observed that emotion E1 gives above 90 % classification accuracy for all classifiers in time domain.In frequency domain also, emotion E1 gives above 90% classification accuracy using PNN classifier.

A New Hybrid Feature Subset Selection Framework Based on Binary Genetic Algorithm and Information Theory

2019 ◽  
Vol 18 (03) ◽  
pp. 1950020 ◽  
Author(s):  
Alok Kumar Shukla ◽  
Pradeep Singh ◽  
Manu Vardhan
Keyword(s):  
Genetic Algorithm ◽  
Feature Selection ◽  
Classification Accuracy ◽  
B Cell Lymphoma ◽  
Feature Subset Selection ◽  
Classification Model ◽  
Significant Feature ◽  
Support Vector ◽  
Feature Subset ◽  
Binary Genetic Algorithm

The explosion of the high-dimensional dataset in the scientific repository has been encouraging interdisciplinary research on data mining, pattern recognition and bioinformatics. The fundamental problem of the individual Feature Selection (FS) method is extracting informative features for classification model and to seek for the malignant disease at low computational cost. In addition, existing FS approaches overlook the fact that for a given cardinality, there can be several subsets with similar information. This paper introduces a novel hybrid FS algorithm, called Filter-Wrapper Feature Selection (FWFS) for a classification problem and also addresses the limitations of existing methods. In the proposed model, the front-end filter ranking method as Conditional Mutual Information Maximization (CMIM) selects the high ranked feature subset while the succeeding method as Binary Genetic Algorithm (BGA) accelerates the search in identifying the significant feature subsets. One of the merits of the proposed method is that, unlike an exhaustive method, it speeds up the FS procedure without lancing of classification accuracy on reduced dataset when a learning model is applied to the selected subsets of features. The efficacy of the proposed (FWFS) method is examined by Naive Bayes (NB) classifier which works as a fitness function. The effectiveness of the selected feature subset is evaluated using numerous classifiers on five biological datasets and five UCI datasets of a varied dimensionality and number of instances. The experimental results emphasize that the proposed method provides additional support to the significant reduction of the features and outperforms the existing methods. For microarray data-sets, we found the lowest classification accuracy is 61.24% on SRBCT dataset and highest accuracy is 99.32% on Diffuse large B-cell lymphoma (DLBCL). In UCI datasets, the lowest classification accuracy is 40.04% on the Lymphography using k-nearest neighbor (k-NN) and highest classification accuracy is 99.05% on the ionosphere using support vector machine (SVM).

scholarly journals A Parallel Genetic Algorithm Based Feature Selection and Parameter Optimization for Support Vector Machine

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Zhi Chen ◽  
Tao Lin ◽  
Ningjiu Tang ◽  
Xin Xia
Keyword(s):  
Genetic Algorithm ◽  
Classification Accuracy ◽  
Coarse Grained ◽  
Support Vector ◽  
Svm Classifier ◽  
Feature Subset ◽  
Parallel Genetic Algorithm ◽  
Support Vectors ◽  
Optimal Feature Subset ◽  
Optimal Feature

The extensive applications of support vector machines (SVMs) require efficient method of constructing a SVM classifier with high classification ability. The performance of SVM crucially depends on whether optimal feature subset and parameter of SVM can be efficiently obtained. In this paper, a coarse-grained parallel genetic algorithm (CGPGA) is used to simultaneously optimize the feature subset and parameters for SVM. The distributed topology and migration policy of CGPGA can help find optimal feature subset and parameters for SVM in significantly shorter time, so as to increase the quality of solution found. In addition, a new fitness function, which combines the classification accuracy obtained from bootstrap method, the number of chosen features, and the number of support vectors, is proposed to lead the search of CGPGA to the direction of optimal generalization error. Experiment results on 12 benchmark datasets show that our proposed approach outperforms genetic algorithm (GA) based method and grid search method in terms of classification accuracy, number of chosen features, number of support vectors, and running time.

scholarly journals A Hybrid Feature Selection Method for Improve the Accuracy of Medical Classification Process

2021 ◽  
Vol 11 (1) ◽  
pp. 50-55
Author(s):  
Maria Mohammad Yousef ◽  
Keyword(s):  
Machine Learning ◽  
Feature Selection ◽  
Dimensionality Reduction ◽  
Classification Accuracy ◽  
Fitness Function ◽  
Machine Learning Algorithms ◽  
Feature Subset Selection ◽  
High Dimensionality ◽  
Support Vector ◽  
Feature Subset

Generally, medical dataset classification has become one of the biggest problems in data mining research. Every database has a given number of features but it is observed that some of these features can be redundant and can be harmful as well as disrupt the process of classification and this problem is known as a high dimensionality problem. Dimensionality reduction in data preprocessing is critical for increasing the performance of machine learning algorithms. Besides the contribution of feature subset selection in dimensionality reduction gives a significant improvement in classification accuracy. In this paper, we proposed a new hybrid feature selection approach based on (GA assisted by KNN) to deal with issues of high dimensionality in biomedical data classification. The proposed method first applies the combination between GA and KNN for feature selection to find the optimal subset of features where the classification accuracy of the k-Nearest Neighbor (kNN) method is used as the fitness function for GA. After selecting the best-suggested subset of features, Support Vector Machine (SVM) are used as the classifiers. The proposed method experiments on five medical datasets of the UCI Machine Learning Repository. It is noted that the suggested technique performs admirably on these databases, achieving higher classification accuracy while using fewer features.

scholarly journals Diagnosis of breast cancer using machine learning algorithms based on features selected by Genetic Algorithm: Assessed on five datasets

2021 ◽  
Vol 23 (11) ◽  
pp. 749-758
Author(s):  
Saranya N ◽  
◽  
Kavi Priya S ◽  
Keyword(s):  
Breast Cancer ◽  
Machine Learning ◽  
Genetic Algorithm ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
Cancer Prognosis ◽  
Support Vector ◽  
Breast Cancer Dataset ◽  
Human Beings ◽  
Original Dataset

Breast Cancer is one of the chronic diseases occurred to human beings throughout the world. Early detection of this disease is the most promising way to improve patients’ chances of survival. The strategy employed in this paper is to select the best features from various breast cancer datasets using a genetic algorithm and machine learning algorithm is applied to predict the outcomes. Two machine learning algorithms such as Support Vector Machines and Decision Tree are used along with Genetic Algorithm. The proposed work is experimented on five datasets such as Wisconsin Breast Cancer-Diagnosis Dataset, Wisconsin Breast Cancer-Original Dataset, Wisconsin Breast Cancer-Prognosis Dataset, ISPY1 Clinical trial Dataset, and Breast Cancer Dataset. The results exploit that SVM-GA achieves higher accuracy of 98.16% than DT-GA of 97.44%.

scholarly journals Automatic Classification of Locomotion in Sport: A Case Study from Elite Netball.

2020 ◽  
Vol 19 (2) ◽  
pp. 1-20
Author(s):  
P.D. Smith ◽  
A. Bedford
Keyword(s):  
Frequency Domain ◽  
Classification Accuracy ◽  
Work Load ◽  
Machine Learning Algorithms ◽  
Support Vector ◽  
Test Case ◽  
Data Sets ◽  
Rotation Rates ◽  
Movement Type ◽  
Measurement Units

AbstractIn team sport Human Activity Recognition (HAR) using inertial measurement units (IMUs) has been limited to athletes performing a set routine in a controlled environment, or identifying a high intensity event within periods of relatively low work load. The purpose of this study was to automatically classify locomotion in an elite sports match where subjects perform rapid changes in movement type, direction, and intensity. Using netball as a test case, six athletes wore a tri-axial accelerometer and gyroscope. Feature extraction of player acceleration and rotation rates was conducted on the time and frequency domain over a 1s sliding window. Applying several machine learning algorithms Support Vector Machines (SVM) was found to have the highest classification accuracy (92.0%, Cohen’s kappa Ƙ = 0.88). Highest accuracy was achieved using both accelerometer and gyroscope features mapped to the time and frequency domain. Time and frequency domain data sets achieved identical classification accuracy (91%). Model accuracy was greatest when excluding windows with two or more classes, however detecting the athlete transitioning between locomotion classes was successful (69%). The proposed method demonstrated HAR of locomotion is possible in elite sport, and a far more efficient process than traditional video coding methods.

Sign in / Sign up

Export Citation Format

Share Document