scholarly journals Feature Selection and Classification of Clinical Datasets Using Bioinspired Algorithms and Super Learner

2021 ◽  
Vol 2021 ◽  
pp. 1-18
Author(s):  
S. Murugesan ◽  
R. S. Bhuvaneswaran ◽  
H. Khanna Nehemiah ◽  
S. Keerthana Sankari ◽  
Y. Nancy Jane
Keyword(s):  
Feature Selection ◽  
Heart Disease ◽  
Classification Accuracy ◽  
Support Vector ◽  
Breast Cancer Dataset ◽  
Training Set ◽  
Krill Herd ◽  
Super Learner ◽  
Bioinspired Algorithms ◽  
Testing Set

A computer-aided diagnosis (CAD) system that employs a super learner to diagnose the presence or absence of a disease has been developed. Each clinical dataset is preprocessed and split into training set (60%) and testing set (40%). A wrapper approach that uses three bioinspired algorithms, namely, cat swarm optimization (CSO), krill herd (KH) ,and bacterial foraging optimization (BFO) with the classification accuracy of support vector machine (SVM) as the fitness function has been used for feature selection. The selected features of each bioinspired algorithm are stored in three separate databases. The features selected by each bioinspired algorithm are used to train three back propagation neural networks (BPNN) independently using the conjugate gradient algorithm (CGA). Classifier testing is performed by using the testing set on each trained classifier, and the diagnostic results obtained are used to evaluate the performance of each classifier. The classification results obtained for each instance of the testing set of the three classifiers and the class label associated with each instance of the testing set will be the candidate instances for training and testing the super learner. The training set comprises of 80% of the instances, and the testing set comprises of 20% of the instances. Experimentation has been carried out using seven clinical datasets from the University of California Irvine (UCI) machine learning repository. The super learner has achieved a classification accuracy of 96.83% for Wisconsin diagnostic breast cancer dataset (WDBC), 86.36% for Statlog heart disease dataset (SHD), 94.74% for hepatocellular carcinoma dataset (HCC), 90.48% for hepatitis dataset (HD), 81.82% for vertebral column dataset (VCD), 84% for Cleveland heart disease dataset (CHD), and 70% for Indian liver patient dataset (ILP).

A fuzzy gaussian rank aggregation ensemble feature selection method for microarray data

2021 ◽  
Vol 24 (4) ◽  
pp. 289-301
Author(s):  
B. Venkatesh ◽  
J. Anuradha
Keyword(s):  
Feature Selection ◽  
Microarray Data ◽  
Classification Accuracy ◽  
Performance Metrics ◽  
Feature Selection Method ◽  
Selection Method ◽  
Support Vector ◽  
Svm Classifier ◽  
Binary Particle Swarm Optimization ◽  
Selection Methods

In Microarray Data, it is complicated to achieve more classification accuracy due to the presence of high dimensions, irrelevant and noisy data. And also It had more gene expression data and fewer samples. To increase the classification accuracy and the processing speed of the model, an optimal number of features need to extract, this can be achieved by applying the feature selection method. In this paper, we propose a hybrid ensemble feature selection method. The proposed method has two phases, filter and wrapper phase in filter phase ensemble technique is used for aggregating the feature ranks of the Relief, minimum redundancy Maximum Relevance (mRMR), and Feature Correlation (FC) filter feature selection methods. This paper uses the Fuzzy Gaussian membership function ordering for aggregating the ranks. In wrapper phase, Improved Binary Particle Swarm Optimization (IBPSO) is used for selecting the optimal features, and the RBF Kernel-based Support Vector Machine (SVM) classifier is used as an evaluator. The performance of the proposed model are compared with state of art feature selection methods using five benchmark datasets. For evaluation various performance metrics such as Accuracy, Recall, Precision, and F1-Score are used. Furthermore, the experimental results show that the performance of the proposed method outperforms the other feature selection methods.

Feature Selection Method Based on Mutual Information and Support Vector Machine

2021 ◽  
pp. 2150021
Author(s):  
Gang Liu ◽  
Chunlei Yang ◽  
Sen Liu ◽  
Chunbao Xiao ◽  
Bin Song
Keyword(s):  
Support Vector Machine ◽  
Feature Selection ◽  
Mutual Information ◽  
Classification Accuracy ◽  
Feature Selection Method ◽  
Selection Method ◽  
Support Vector ◽  
Svm Classifier ◽  
Standard Data ◽  
Feature Dimension

A feature selection method based on mutual information and support vector machine (SVM) is proposed in order to eliminate redundant feature and improve classification accuracy. First, local correlation between features and overall correlation is calculated by mutual information. The correlation reflects the information inclusion relationship between features, so the features are evaluated and redundant features are eliminated with analyzing the correlation. Subsequently, the concept of mean impact value (MIV) is defined and the influence degree of input variables on output variables for SVM network based on MIV is calculated. The importance weights of the features described with MIV are sorted by descending order. Finally, the SVM classifier is used to implement feature selection according to the classification accuracy of feature combination which takes MIV order of feature as a reference. The simulation experiments are carried out with three standard data sets of UCI, and the results show that this method can not only effectively reduce the feature dimension and high classification accuracy, but also ensure good robustness.

scholarly journals Identification of Bio-Markers for Breast Cancer Detection through Data Mining Methods

2019 ◽  
Vol 8 (2S3) ◽  
pp. 763-769
Keyword(s):  
Breast Cancer ◽  
Support Vector Machine ◽  
Logistic Regression ◽  
Feature Selection ◽  
Discriminant Analysis ◽  
Classification Tree ◽  
Partial Least Square ◽  
Diagnostic Methods ◽  
Support Vector ◽  
Breast Cancer Dataset

Worldwide, breast cancer is the leading type of cancer in women accounting for 25% of all cases. Survival rates in the developed countries are comparatively higher with that of developing countries. This had led to the importance of computer aided diagnostic methods for early detection of breast cancer disease. This eventually reduces the death rate. This paper intents the scope of the biomarker that can be used to predict the breast cancer from the anthropometric data. This experimental study aims at computing and comparing various classification models (Binary Logistic Regression, Ball Vector Machine (BVM), C4.5, Partial Least Square (PLS) for Classification, Classification Tree, Cost sensitive Classification Tree, Cost sensitive Decision Tree, Support Vector Machine for Classification, Core Vector Machine, ID3, K-Nearest Neighbor, Linear Discriminant Analysis (LDA), Log-Reg TRIRLS, Multi Layer Perceptron (MLP), Multinomial Logistic Regression (MLR), Naïve Bayes (NB), PLS for Discriminant Analysis, PLS for LDA, Random Tree (RT), Support Vector Machine SVM) for the UCI Coimbra breast cancer dataset. The feature selection algorithms (Backward Logit, Fisher Filtering, Forward Logit, ReleifF, Step disc) are worked out to find out the minimum attributes that can achieve a better accuracy. To ascertain the accuracy results, the Jack-knife cross validation method for the algorithms is conducted and validated. The Core vector machine classification algorithm outperforms the other nineteen algorithms with an accuracy of 82.76%, sensitivity of 76.92% and specificity of 87.50% for the selected three attributes, Age, Glucose and Resistin using ReleifF feature selection algorithm.

HIOC: a hybrid imputation method to predict missing values in medical datasets

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Pooja Rani ◽  
Rajneesh Kumar ◽  
Anurag Jain
Keyword(s):  
Breast Cancer ◽  
Heart Disease ◽  
Missing Values ◽  
Imputation Method ◽  
Support Vector ◽  
Correct Prediction ◽  
Breast Cancer Dataset ◽  
Cancer Dataset ◽  
Content Type ◽  
Imputation Methods

PurposeDecision support systems developed using machine learning classifiers have become a valuable tool in predicting various diseases. However, the performance of these systems is adversely affected by the missing values in medical datasets. Imputation methods are used to predict these missing values. In this paper, a new imputation method called hybrid imputation optimized by the classifier (HIOC) is proposed to predict missing values efficiently.Design/methodology/approachThe proposed HIOC is developed by using a classifier to combine multivariate imputation by chained equations (MICE), K nearest neighbor (KNN), mean and mode imputation methods in an optimum way. Performance of HIOC has been compared to MICE, KNN, and mean and mode methods. Four classifiers support vector machine (SVM), naive Bayes (NB), random forest (RF) and decision tree (DT) have been used to evaluate the performance of imputation methods.FindingsThe results show that HIOC performed efficiently even with a high rate of missing values. It had reduced root mean square error (RMSE) up to 17.32% in the heart disease dataset and 34.73% in the breast cancer dataset. Correct prediction of missing values improved the accuracy of the classifiers in predicting diseases. It increased classification accuracy up to 18.61% in the heart disease dataset and 6.20% in the breast cancer dataset.Originality/valueThe proposed HIOC is a new hybrid imputation method that can efficiently predict missing values in any medical dataset.

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 Predicting the DPP-IV Inhibitory ActivitypIC50Based on Their Physicochemical Properties

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Tianhong Gu ◽  
Xiaoyan Yang ◽  
Minjie Li ◽  
Milin Wu ◽  
Qiang Su ◽  
...  
Keyword(s):  
Feature Selection ◽  
Physicochemical Properties ◽  
Inhibitory Activity ◽  
Molecular Descriptors ◽  
Feature Selection Method ◽  
Development Program ◽  
Support Vector ◽  
Training Set ◽  
Second Development ◽  
Dpp Iv

The second development program developed in this work was introduced to obtain physicochemical properties of DPP-IV inhibitors. Based on the computation of molecular descriptors, a two-stage feature selection method called mRMR-BFS (minimum redundancy maximum relevance-backward feature selection) was adopted. Then, the support vector regression (SVR) was used in the establishment of the model to map DPP-IV inhibitors to their corresponding inhibitory activity possible. The squared correlation coefficient for the training set of LOOCV and the test set are 0.815 and 0.884, respectively. An online server for predicting inhibitory activity pIC50of the DPP-IV inhibitors as described in this paper has been given in the introduction.

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 Feature Selection using Hybrid Dragonfly Algorithm in a Heart Disease Predication System

2019 ◽  
Vol 8 (6) ◽  
pp. 2862-2867
Keyword(s):  
Support Vector Machine ◽  
Feature Selection ◽  
Heart Disease ◽  
Mutual Information ◽  
Multilayer Perceptron ◽  
Time Algorithm ◽  
Support Vector ◽  
Ordinary People ◽  
Fatal Disease ◽  
Dragonfly Algorithm

The heart disease considers as one of the fatal disease in many countries. The main reason is due to the approved methods of diagnostic are not available to the ordinary people. Many studies have been done to handle this case with the use of both methods of soft computing and machine learning. In this study, a hybrid binary dragonfly algorithm and mutual information proposed for feature selection, support vector machine and multilayer perceptron employed for classification. The Statlog dataset used for experiments. Out of a total of 270 instances of patient data, 216 employees for the purpose of practicing, 54 of them used for the purpose of examining. Maximum classification accuracy of 94.44% achieved with support vector machine and 92.59% with multilayer perceptron on features selected with binary dragonfly algorithm, whereas with features obtained from mutual information combined with binary dragonfly (MI_BDA) algorithm support vector machine and multilayer perceptron attained an accuracy of 96.29%. The time algorithm takes reduced from 15.4 with binary dragonfly algorithm to 6.95 seconds with MI_BDA.

scholarly journals Preoperative prediction of complicated appendicitis using machine learning method

2020 ◽  
Author(s):  
Chunbo Kang ◽  
Xubin Li ◽  
Xiaoqian Chi ◽  
Yabin Yang ◽  
Haifeng Shan ◽  
...  
Keyword(s):  
Machine Learning ◽  
Clinical Symptoms ◽  
Laboratory Data ◽  
Learning Model ◽  
Complicated Appendicitis ◽  
Support Vector ◽  
Training Set ◽  
Preoperative Prediction ◽  
Machine Learning Model ◽  
Testing Set

Abstract BACKGROUND Accurate preoperative prediction of complicated appendicitis (CA) could help selecting optimal treatment and reducing risks of postoperative complications. The study aimed to develop a machine learning model based on clinical symptoms and laboratory data for preoperatively predicting CA.METHODS 136 patients with clinicopathological diagnosis of acute appendicitis were retrospectively included in the study. The dataset was randomly divided (94: 42) into training and testing set. Predictive models using individual and combined selected clinical and laboratory data features were built separately. Three combined models were constructed using logistic regression (LR), support vector machine (SVM) and random forest (RF) algorithms. The CA prediction performance was evaluated with Receiver Operating Characteristic (ROC) analysis, using the area under the curve (AUC), sensitivity, specificity and accuracy factors.RESULTS The features of the abdominal pain time, nausea and vomiting, the highest temperature, high sensitivity-CRP (hs-CRP) and procalcitonin (PCT) had significant differences in the CA prediction (P<0.001). The ability to predict CA by individual feature was low (AUC<0.8). The prediction by combined features was significantly improved. The AUC of the three models (LR, SVM and RF) in the training set and the testing set were 0.805, 0.888, 0.908 and 0.794, 0.895, 0.761, respectively. The SVM-based model showed a better performance for CA prediction. RF had a higher AUC in the training set, but its poor efficiency in the testing set indicated a poor generalization ability.CONCLUSIONS The SVM machine learning model applying clinical and laboratory data can well predict CA preoperatively which could assist diagnosis in resource limited settings.

scholarly journals Feature Selection on Maximum Information Coefficient for Underwater Target Recognition

2020 ◽  
Vol 38 (3) ◽  
pp. 471-477
Author(s):  
Muhang Zhang ◽  
Xiaohong Shen ◽  
Lei He ◽  
Haiyan Wang
Keyword(s):  
Feature Selection ◽  
Classification Accuracy ◽  
Feature Selection Method ◽  
Support Vector ◽  
Feature Subset ◽  
Acoustic Features ◽  
Maximum Information ◽  
Underwater Acoustic Channels ◽  
Information Coefficient ◽  
Underwater Target

Feature selection is an essential process in the identification task because the irrelevant and redundant features contained in the unselected feature set can reduce both the performance and efficiency of recognition. However, when identifying the underwater targets based on their radiated noise, the diversity of targets, and the complexity of underwater acoustic channels introduce various complex relationships among the extracted acoustic features. For this problem, this paper employs the normalized maximum information coefficient (NMIC) to measure the correlations between features and categories and the redundancy among different features and further proposes an NMIC based feature selection method (NMIC-FS). Then, on the real-world dataset, the average classification accuracy estimated by models such as random forest and support vector machine is used to evaluate the performance of the NMIC-FS. The analysis results show that the feature subset obtained by NMIC-FS can achieve higher classification accuracy in a shorter time than that without selection. Compared with correlation-based feature selection, laplacian score, and lasso methods, the NMIC-FS improves the classification accuracy faster in the process of feature selection and requires the least acoustic features to obtain classification accuracy comparable to that of the full feature set.

Sign in / Sign up

Export Citation Format

Share Document