scholarly journals An Improved Brain MRI Classification Methodology Based on Statistical Features and Machine Learning Algorithms

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Muhammad Fayaz ◽  
Muhammad Shuaib Qureshi ◽  
Karlygash Kussainova ◽  
Bermet Burkanova ◽  
Ayman Aljarbouh ◽  
...  
Keyword(s):  
Machine Learning ◽  
Feature Extraction ◽  
Decision Tree ◽  
Median Filter ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
Statistical Features ◽  
Statistical Measures ◽  
Rgb Images ◽  
Extraction Stage

In this paper, we have proposed a novel methodology based on statistical features and different machine learning algorithms. The proposed model can be divided into three main stages, namely, preprocessing, feature extraction, and classification. In the preprocessing stage, the median filter has been used in order to remove salt-and-pepper noise because MRI images are normally affected by this type of noise, the grayscale images are also converted to RGB images in this stage. In the preprocessing stage, the histogram equalization has also been used to enhance the quality of each RGB channel. In the feature extraction stage, the three channels, namely, red, green, and blue, are extracted from the RGB images and statistical measures, namely, mean, variance, skewness, kurtosis, entropy, energy, contrast, homogeneity, and correlation, are calculated for each channel; hence, a total of 27 features, 9 for each channel, are extracted from an RGB image. After the feature extraction stage, different machine learning algorithms, such as artificial neural network, k -nearest neighbors’ algorithm, decision tree, and Naïve Bayes classifiers, have been applied in the classification stage on the features extracted in the feature extraction stage. We recorded the results with all these algorithms and found that the decision tree results are better as compared to the other classification algorithms which are applied on these features. Hence, we have considered decision tree for further processing. We have also compared the results of the proposed method with some well-known algorithms in terms of simplicity and accuracy; it was noted that the proposed method outshines the existing methods.

scholarly journals Performance Improvement of Decision Tree: A Robust Classifier Using Tabu Search Algorithm

2021 ◽  
Vol 11 (15) ◽  
pp. 6728
Author(s):  
Muhammad Asfand Hafeez ◽  
Muhammad Rashid ◽  
Hassan Tariq ◽  
Zain Ul Abideen ◽  
Saud S. Alotaibi ◽  
...  
Keyword(s):  
Machine Learning ◽  
Tabu Search ◽  
Decision Tree ◽  
Decision Trees ◽  
Search Algorithm ◽  
Learning Algorithms ◽  
Performance Comparison ◽  
Machine Learning Algorithms ◽  
Supervised Machine Learning ◽  
Tabu Search Algorithm

Classification and regression are the major applications of machine learning algorithms which are widely used to solve problems in numerous domains of engineering and computer science. Different classifiers based on the optimization of the decision tree have been proposed, however, it is still evolving over time. This paper presents a novel and robust classifier based on a decision tree and tabu search algorithms, respectively. In the aim of improving performance, our proposed algorithm constructs multiple decision trees while employing a tabu search algorithm to consistently monitor the leaf and decision nodes in the corresponding decision trees. Additionally, the used tabu search algorithm is responsible to balance the entropy of the corresponding decision trees. For training the model, we used the clinical data of COVID-19 patients to predict whether a patient is suffering. The experimental results were obtained using our proposed classifier based on the built-in sci-kit learn library in Python. The extensive analysis for the performance comparison was presented using Big O and statistical analysis for conventional supervised machine learning algorithms. Moreover, the performance comparison to optimized state-of-the-art classifiers is also presented. The achieved accuracy of 98%, the required execution time of 55.6 ms and the area under receiver operating characteristic (AUROC) for proposed method of 0.95 reveals that the proposed classifier algorithm is convenient for large datasets.

scholarly journals 174 A comparison of machine learning algorithms in the classification of beef steers finished in feedlot

2020 ◽  
Vol 98 (Supplement_4) ◽  
pp. 126-127
Author(s):  
Lucas S Lopes ◽  
Christine F Baes ◽  
Dan Tulpan ◽  
Luis Artur Loyola Chardulo ◽  
Otavio Machado Neto ◽  
...  
Keyword(s):  
Machine Learning ◽  
Decision Tree ◽  
Learning Algorithms ◽  
Machine Learning Algorithms ◽  
Final Decision ◽  
Relevant Parameter ◽  
Good Prediction ◽  
Quality Traits ◽  
C4.5 Decision Tree

Abstract The aim of this project is to compare some of the state-of-the-art machine learning algorithms on the classification of steers finished in feedlots based on performance, carcass and meat quality traits. The precise classification of animals allows for fast, real-time decision making in animal food industry, such as culling or retention of herd animals. Beef production presents high variability in its numerous carcass and beef quality traits. Machine learning algorithms and software provide an opportunity to evaluate the interactions between traits to better classify animals. Four different treatment levels of wet distiller’s grain were applied to 97 Angus-Nellore animals and used as features for the classification problem. The C4.5 decision tree, Naïve Bayes (NB), Random Forest (RF) and Multilayer Perceptron (MLP) Artificial Neural Network algorithms were used to predict and classify the animals based on recorded traits measurements, which include initial and final weights, sheer force and meat color. The top performing classifier was the C4.5 decision tree algorithm with a classification accuracy of 96.90%, while the RF, the MLP and NB classifiers had accuracies of 55.67%, 39.17% and 29.89% respectively. We observed that the final decision tree model constructed with C4.5 selected only the dry matter intake (DMI) feature as a differentiator. When DMI was removed, no other feature or combination of features was sufficiently strong to provide good prediction accuracies for any of the classifiers. We plan to investigate in a follow-up study on a significantly larger sample size, the reasons behind DMI being a more relevant parameter than the other measurements.

scholarly journals Amino Acid k-mer Feature Extraction for Quantitative Antimicrobial Resistance (AMR) Prediction by Machine Learning and Model Interpretation for Biological Insights

Biology ◽  
2020 ◽  
Vol 9 (11) ◽  
pp. 365
Author(s):  
Taha ValizadehAslani ◽  
Zhengqiao Zhao ◽  
Bahrad A. Sokhansanj ◽  
Gail L. Rosen
Keyword(s):  
Machine Learning ◽  
Feature Extraction ◽  
Amino Acid ◽  
Computational Complexity ◽  
Antimicrobial Resistance ◽  
Learning Algorithms ◽  
Extraction Methods ◽  
Machine Learning Algorithms ◽  
Model Interpretation ◽  
New Feature

Machine learning algorithms can learn mechanisms of antimicrobial resistance from the data of DNA sequence without any a priori information. Interpreting a trained machine learning algorithm can be exploited for validating the model and obtaining new information about resistance mechanisms. Different feature extraction methods, such as SNP calling and counting nucleotide k-mers have been proposed for presenting DNA sequences to the model. However, there are trade-offs between interpretability, computational complexity and accuracy for different feature extraction methods. In this study, we have proposed a new feature extraction method, counting amino acid k-mers or oligopeptides, which provides easier model interpretation compared to counting nucleotide k-mers and reaches the same or even better accuracy in comparison with different methods. Additionally, we have trained machine learning algorithms using different feature extraction methods and compared the results in terms of accuracy, model interpretability and computational complexity. We have built a new feature selection pipeline for extraction of important features so that new AMR determinants can be discovered by analyzing these features. This pipeline allows the construction of models that only use a small number of features and can predict resistance accurately.

scholarly journals Encrypted DNP3 Traffic Classification Using Supervised Machine Learning Algorithms

2019 ◽  
Vol 1 (1) ◽  
pp. 384-399 ◽  
Author(s):  
Thais de Toledo ◽  
Nunzio Torrisi
Keyword(s):  
Machine Learning ◽  
Support Vector Machine ◽  
Decision Tree ◽  
Smart Grids ◽  
Learning Algorithms ◽  
Electric Utility ◽  
Machine Learning Algorithms ◽  
Supervised Machine Learning ◽  
Support Vector ◽  
Communication Link

The Distributed Network Protocol (DNP3) is predominately used by the electric utility industry and, consequently, in smart grids. The Peekaboo attack was created to compromise DNP3 traffic, in which a man-in-the-middle on a communication link can capture and drop selected encrypted DNP3 messages by using support vector machine learning algorithms. The communication networks of smart grids are a important part of their infrastructure, so it is of critical importance to keep this communication secure and reliable. The main contribution of this paper is to compare the use of machine learning techniques to classify messages of the same protocol exchanged in encrypted tunnels. The study considers four simulated cases of encrypted DNP3 traffic scenarios and four different supervised machine learning algorithms: Decision tree, nearest-neighbor, support vector machine, and naive Bayes. The results obtained show that it is possible to extend a Peekaboo attack over multiple substations, using a decision tree learning algorithm, and to gather significant information from a system that communicates using encrypted DNP3 traffic.

Sign in / Sign up

Export Citation Format

Share Document