PSO-ELM with Modified Acceleration Coefficients for Classifying the Active Compound

2021 ◽  
Vol 16 ◽  
Author(s):  
Dian Eka Ratnawati ◽  
Marjono Marjono ◽  
Nashi Widodo
Keyword(s):  
Machine Learning ◽  
Active Compound ◽  
Learning Algorithm ◽  
Area Under The Curve ◽  
Support Vector ◽  
Active Compounds ◽  
Acceleration Coefficient ◽  
Learning Machine ◽  
Hidden Neurons ◽  
Mlp Classifier

Background: The classification of active compounds based on their function using machine learning is essential for predicting the function of new active compounds quickly. These classification results are beneficial and accelerate the work of laboratory assistants in identifying the function of active compounds. In this study, an active compound is represented by the simplified molecular-input line-entry system (SMILES) code. Objective: This paper proposes a modified acceleration coefficient to improve the PSO-ELM performance for predicting the function of the SMILES code. Method: The research uses a machine-learning algorithm that is a combination of the Particle Swarm Optimization and Extreme Learning Machine (PSO-ELM). ELM is used to classify the SMILES code, while PSO is used to optimize ELM parameters, i.e., weight, bias, and the number of hidden neurons. The important parameters that significantly influence the PSO performance are acceleration coefficients. The acceleration coefficients, that is, modified sigmoid-based acceleration coefficient (SBAC), are introduced and compared with seven other acceleration coefficients. Results: The experimental results show that the sensitivity, specificity, accuracy, and the area under the curve (AUC) of the proposed acceleration coefficients outperforms all other acceleration coefficients. The increased accuracy of the proposed paper can reach up to 2.64%, 5.84%, 7.93%, 8.44%, and 16.29% for Support Vector Machine (SVM), decision tree, AdaBoost, MLP Classifier, and Gaussian Naïve Bayes algorithms, respectively. Conclusion: The acceleration coefficients affect the prediction accuracy of the SMILES code classification. The proposed acceleration coefficients improve the performance of the PSO-ELM for predicting the function of the SMILES code.

scholarly journals Early Prediction of Seven-Day Mortality in Intensive Care Unit Using a Machine Learning Model: Results from the SPIN-UTI Project

2021 ◽  
Vol 10 (5) ◽  
pp. 992
Author(s):  
Martina Barchitta ◽  
Andrea Maugeri ◽  
Giuliana Favara ◽  
Paolo Marco Riela ◽  
Giovanni Gallo ◽  
...  
Keyword(s):  
Machine Learning ◽  
Intensive Care ◽  
Intensive Care Units ◽  
Learning Algorithm ◽  
Area Under The Curve ◽  
Support Vector ◽  
Icu Admission ◽  
Risk Of Death ◽  
Saps Ii ◽  
Svm Algorithm

Patients in intensive care units (ICUs) were at higher risk of worsen prognosis and mortality. Here, we aimed to evaluate the ability of the Simplified Acute Physiology Score (SAPS II) to predict the risk of 7-day mortality, and to test a machine learning algorithm which combines the SAPS II with additional patients’ characteristics at ICU admission. We used data from the “Italian Nosocomial Infections Surveillance in Intensive Care Units” network. Support Vector Machines (SVM) algorithm was used to classify 3782 patients according to sex, patient’s origin, type of ICU admission, non-surgical treatment for acute coronary disease, surgical intervention, SAPS II, presence of invasive devices, trauma, impaired immunity, antibiotic therapy and onset of HAI. The accuracy of SAPS II for predicting patients who died from those who did not was 69.3%, with an Area Under the Curve (AUC) of 0.678. Using the SVM algorithm, instead, we achieved an accuracy of 83.5% and AUC of 0.896. Notably, SAPS II was the variable that weighted more on the model and its removal resulted in an AUC of 0.653 and an accuracy of 68.4%. Overall, these findings suggest the present SVM model as a useful tool to early predict patients at higher risk of death at ICU admission.

scholarly journals Predicting the Grade of Prostate Cancer Based on a Biparametric MRI Radiomics Signature

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Li Zhang ◽  
Xia Zhe ◽  
Min Tang ◽  
Jing Zhang ◽  
Jialiang Ren ◽  
...  
Keyword(s):  
Prostate Cancer ◽  
Machine Learning ◽  
Logistic Regression ◽  
Learning Algorithm ◽  
Area Under The Curve ◽  
Machine Learning Algorithms ◽  
Support Vector ◽  
Low Grade ◽  
High Grade ◽  
Random Forest Tree

Purpose. This study aimed to investigate the value of biparametric magnetic resonance imaging (bp-MRI)-based radiomics signatures for the preoperative prediction of prostate cancer (PCa) grade compared with visual assessments by radiologists based on the Prostate Imaging Reporting and Data System Version 2.1 (PI-RADS V2.1) scores of multiparametric MRI (mp-MRI). Methods. This retrospective study included 142 consecutive patients with histologically confirmed PCa who were undergoing mp-MRI before surgery. MRI images were scored and evaluated by two independent radiologists using PI-RADS V2.1. The radiomics workflow was divided into five steps: (a) image selection and segmentation, (b) feature extraction, (c) feature selection, (d) model establishment, and (e) model evaluation. Three machine learning algorithms (random forest tree (RF), logistic regression, and support vector machine (SVM)) were constructed to differentiate high-grade from low-grade PCa. Receiver operating characteristic (ROC) analysis was used to compare the machine learning-based analysis of bp-MRI radiomics models with PI-RADS V2.1. Results. In all, 8 stable radiomics features out of 804 extracted features based on T2-weighted imaging (T2WI) and ADC sequences were selected. Radiomics signatures successfully categorized high-grade and low-grade PCa cases ( P < 0.05 ) in both the training and test datasets. The radiomics model-based RF method (area under the curve, AUC: 0.982; 0.918), logistic regression (AUC: 0.886; 0.886), and SVM (AUC: 0.943; 0.913) in both the training and test cohorts had better diagnostic performance than PI-RADS V2.1 (AUC: 0.767; 0.813) when predicting PCa grade. Conclusions. The results of this clinical study indicate that machine learning-based analysis of bp-MRI radiomic models may be helpful for distinguishing high-grade and low-grade PCa that outperformed the PI-RADS V2.1 scores based on mp-MRI. The machine learning algorithm RF model was slightly better.

scholarly journals Prediction of Protein–ATP Binding Residues Based on Ensemble of Deep Convolutional Neural Networks and LightGBM Algorithm

2021 ◽  
Vol 22 (2) ◽  
pp. 939
Author(s):  
Jiazhi Song ◽  
Guixia Liu ◽  
Jingqing Jiang ◽  
Ping Zhang ◽  
Yanchun Liang
Keyword(s):  
Machine Learning ◽  
Protein Function ◽  
Learning Algorithm ◽  
Area Under The Curve ◽  
Machine Learning Algorithms ◽  
Machine Learning Techniques ◽  
Support Vector ◽  
Atp Binding ◽  
Deep Convolutional Neural Networks ◽  
Binding Residues

Accurately identifying protein–ATP binding residues is important for protein function annotation and drug design. Previous studies have used classic machine-learning algorithms like support vector machine (SVM) and random forest to predict protein–ATP binding residues; however, as new machine-learning techniques are being developed, the prediction performance could be further improved. In this paper, an ensemble predictor that combines deep convolutional neural network and LightGBM with ensemble learning algorithm is proposed. Three subclassifiers have been developed, including a multi-incepResNet-based predictor, a multi-Xception-based predictor, and a LightGBM predictor. The final prediction result is the combination of outputs from three subclassifiers with optimized weight distribution. We examined the performance of our proposed predictor using two datasets: a classic ATP-binding benchmark dataset and a newly proposed ATP-binding dataset. Our predictor achieved area under the curve (AUC) values of 0.925 and 0.902 and Matthews Correlation Coefficient (MCC) values of 0.639 and 0.642, respectively, which are both better than other state-of-art prediction methods.

HYPER-PARAMETER OPTIMIZATION AND EVALUATION ON SELECTED MACHINE LEARNING ALGORITHM USING HEPATITIS DATASET

2021 ◽  
Vol 5 (2) ◽  
pp. 447-455
Author(s):  
Aminat Yusuf ◽  
Oyelola Akande
Keyword(s):  
Machine Learning ◽  
Expert Knowledge ◽  
Learning Algorithm ◽  
Area Under The Curve ◽  
Machine Learning Techniques ◽  
Support Vector ◽  
Grid Search ◽  
Classification Problems ◽  
Comparative Performance ◽  
Learning Techniques

Despite the popularity and utility of most machine learning techniques, expert knowledge is required in guiding choices about the suitable technique and settings that are good for solving a specific problem. The lack of expert information renders the procedures vulnerable to poor parameter settings. Several of these machine learning techniques configurations are offered under default settings. However, since different classification problems required suitable machine learning techniques, selecting the appropriate technique and tuning its settings are vital works that will rightly improve predictions in terms of reliability and accuracy. This study aims to perform grid search parameters tuning on 5-selected machine learning techniques on hepatitis disease. Comparative performance is drawn side-by-side with the default settings. The experimental results of the five tuning techniques show that using the configurations suggested in our work yield predictions of a greatly sophisticated quality than choice under its default settings. The result proves that tuning parameters of Support Vector Machine via grid search yields the best accuracy outcomes of 90% and has a competitive performance relative towards criteria of precision, recall, accuracy and Area Under the Curve. Present combinations of parameter settings for each of the techniques by identifying ranges of values for each setting that give good Hepatitis disease outcomes

SMART IDENTIFICATION OF POWER QUALITY EVENTS USING NEW STOCKWELL TRANSFORM AND MACHINE LEARNING ALGORITHM

2019 ◽  
Vol XVI (4) ◽  
pp. 95-113
Author(s):  
Muhammad Tariq ◽  
Tahir Mehmood
Keyword(s):  
Machine Learning ◽  
Power Quality ◽  
Learning Algorithm ◽  
Machine Learning Algorithm ◽  
Noisy Environments ◽  
Satisfactory Performance ◽  
Feature Values ◽  
Learning Machine ◽  
Stockwell Transform ◽  
Electrical Utilities

Accurate detection, classification and mitigation of power quality (PQ) distortive events are of utmost importance for electrical utilities and corporations. An integrated mechanism is proposed in this paper for the identification of PQ distortive events. The proposed features are extracted from the waveforms of the distortive events using modified form of Stockwell’s transform. The categories of the distortive events were determined based on these feature values by applying extreme learning machine as an intelligent classifier. The proposed methodology was tested under the influence of both the noisy and noiseless environments on a database of seven thousand five hundred simulated waveforms of distortive events which classify fifteen types of PQ events such as impulses, interruptions, sags and swells, notches, oscillatory transients, harmonics, and flickering as single stage events with their possible integrations. The results of the analysis indicated satisfactory performance of the proposed method in terms of accuracy in classifying the events in addition to its reduced sensitivity under various noisy environments.

scholarly journals Predictive Modelling of Employee Turnover in Indian IT Industry Using Machine Learning Techniques

2019 ◽  
Vol 23 (1) ◽  
pp. 12-21 ◽  
Author(s):  
Shikha N. Khera ◽  
Divya
Keyword(s):  
Machine Learning ◽  
Learning Algorithm ◽  
Confusion Matrix ◽  
Predictive Modelling ◽  
Supervised Machine Learning ◽  
Machine Learning Techniques ◽  
Support Vector ◽  
It Industry ◽  
Knowledge Based ◽  
Employee Attrition

Information technology (IT) industry in India has been facing a systemic issue of high attrition in the past few years, resulting in monetary and knowledge-based loses to the companies. The aim of this research is to develop a model to predict employee attrition and provide the organizations opportunities to address any issue and improve retention. Predictive model was developed based on supervised machine learning algorithm, support vector machine (SVM). Archival employee data (consisting of 22 input features) were collected from Human Resource databases of three IT companies in India, including their employment status (response variable) at the time of collection. Accuracy results from the confusion matrix for the SVM model showed that the model has an accuracy of 85 per cent. Also, results show that the model performs better in predicting who will leave the firm as compared to predicting who will not leave the company.

scholarly journals Machine learning-based ability to classify psychosis and early stages of disease through parenting and attachment-related variables is associated with social cognition

2021 ◽  
Vol 9 (1) ◽  
Author(s):  
Linda A. Antonucci ◽  
Alessandra Raio ◽  
Giulio Pergola ◽  
Barbara Gelao ◽  
Marco Papalino ◽  
...  
Keyword(s):  
Machine Learning ◽  
Social Cognition ◽  
Attachment Style ◽  
Learning Algorithm ◽  
Early Recognition ◽  
Emotion Perception ◽  
First Episode ◽  
Support Vector ◽  
Significant Group ◽  
Early Stages

Abstract Background Recent views posited that negative parenting and attachment insecurity can be considered as general environmental factors of vulnerability for psychosis, specifically for individuals diagnosed with psychosis (PSY). Furthermore, evidence highlighted a tight relationship between attachment style and social cognition abilities, a key PSY behavioral phenotype. The aim of this study is to generate a machine learning algorithm based on the perceived quality of parenting and attachment style-related features to discriminate between PSY and healthy controls (HC) and to investigate its ability to track PSY early stages and risk conditions, as well as its association with social cognition performance. Methods Perceived maternal and paternal parenting, as well as attachment anxiety and avoidance scores, were trained to separate 71 HC from 34 PSY (20 individuals diagnosed with schizophrenia + 14 diagnosed with bipolar disorder with psychotic manifestations) using support vector classification and repeated nested cross-validation. We then validated this model on independent datasets including individuals at the early stages of disease (ESD, i.e. first episode of psychosis or depression, or at-risk mental state for psychosis) and with familial high risk for PSY (FHR, i.e. having a first-degree relative suffering from psychosis). Then, we performed factorial analyses to test the group x classification rate interaction on emotion perception, social inference and managing of emotions abilities. Results The perceived parenting and attachment-based machine learning model discriminated PSY from HC with a Balanced Accuracy (BAC) of 72.2%. Slightly lower classification performance was measured in the ESD sample (HC-ESD BAC = 63.5%), while the model could not discriminate between FHR and HC (BAC = 44.2%). We observed a significant group x classification interaction in PSY and HC from the discovery sample on emotion perception and on the ability to manage emotions (both p = 0.02). The interaction on managing of emotion abilities was replicated in the ESD and HC validation sample (p = 0.03). Conclusion Our results suggest that parenting and attachment-related variables bear significant classification power when applied to both PSY and its early stages and are associated with variability in emotion processing. These variables could therefore be useful in psychosis early recognition programs aimed at softening the psychosis-associated disability.

Efficient detection of hacker community based on twitter data using complex networks and machine learning algorithm

2021 ◽  
pp. 1-17
Author(s):  
Ahmed Al-Tarawneh ◽  
Ja’afer Al-Saraireh
Keyword(s):  
Machine Learning ◽  
Complex Networks ◽  
Nearest Neighbor ◽  
Learning Algorithm ◽  
Machine Learning Algorithms ◽  
Machine Learning Techniques ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
Efficient Detection ◽  
Suggested Keywords

Twitter is one of the most popular platforms used to share and post ideas. Hackers and anonymous attackers use these platforms maliciously, and their behavior can be used to predict the risk of future attacks, by gathering and classifying hackers’ tweets using machine-learning techniques. Previous approaches for detecting infected tweets are based on human efforts or text analysis, thus they are limited to capturing the hidden text between tweet lines. The main aim of this research paper is to enhance the efficiency of hacker detection for the Twitter platform using the complex networks technique with adapted machine learning algorithms. This work presents a methodology that collects a list of users with their followers who are sharing their posts that have similar interests from a hackers’ community on Twitter. The list is built based on a set of suggested keywords that are the commonly used terms by hackers in their tweets. After that, a complex network is generated for all users to find relations among them in terms of network centrality, closeness, and betweenness. After extracting these values, a dataset of the most influential users in the hacker community is assembled. Subsequently, tweets belonging to users in the extracted dataset are gathered and classified into positive and negative classes. The output of this process is utilized with a machine learning process by applying different algorithms. This research build and investigate an accurate dataset containing real users who belong to a hackers’ community. Correctly, classified instances were measured for accuracy using the average values of K-nearest neighbor, Naive Bayes, Random Tree, and the support vector machine techniques, demonstrating about 90% and 88% accuracy for cross-validation and percentage split respectively. Consequently, the proposed network cyber Twitter model is able to detect hackers, and determine if tweets pose a risk to future institutions and individuals to provide early warning of possible attacks.

scholarly journals CAFD: Context-Aware Fault Diagnostic Scheme towards Sensor Faults Utilizing Machine Learning

Sensors ◽  
2021 ◽  
Vol 21 (2) ◽  
pp. 617
Author(s):  
Umer Saeed ◽  
Young-Doo Lee ◽  
Sana Ullah Jan ◽  
Insoo Koo
Keyword(s):  
Machine Learning ◽  
Learning Algorithm ◽  
Diagnostic System ◽  
Machine Learning Algorithms ◽  
Support Vector ◽  
Context Aware ◽  
Sensor Faults ◽  
Training Time ◽  
Low Intensity ◽  
Fault Diagnostic

Sensors’ existence as a key component of Cyber-Physical Systems makes it susceptible to failures due to complex environments, low-quality production, and aging. When defective, sensors either stop communicating or convey incorrect information. These unsteady situations threaten the safety, economy, and reliability of a system. The objective of this study is to construct a lightweight machine learning-based fault detection and diagnostic system within the limited energy resources, memory, and computation of a Wireless Sensor Network (WSN). In this paper, a Context-Aware Fault Diagnostic (CAFD) scheme is proposed based on an ensemble learning algorithm called Extra-Trees. To evaluate the performance of the proposed scheme, a realistic WSN scenario composed of humidity and temperature sensor observations is replicated with extreme low-intensity faults. Six commonly occurring types of sensor fault are considered: drift, hard-over/bias, spike, erratic/precision degradation, stuck, and data-loss. The proposed CAFD scheme reveals the ability to accurately detect and diagnose low-intensity sensor faults in a timely manner. Moreover, the efficiency of the Extra-Trees algorithm in terms of diagnostic accuracy, F1-score, ROC-AUC, and training time is demonstrated by comparison with cutting-edge machine learning algorithms: a Support Vector Machine and a Neural Network.

scholarly journals Value of radiomics in differential diagnosis of chromophobe renal cell carcinoma and renal oncocytoma

2019 ◽  
Vol 45 (10) ◽  
pp. 3193-3201 ◽  
Author(s):  
Yajuan Li ◽  
Xialing Huang ◽  
Yuwei Xia ◽  
Liling Long
Keyword(s):  
Machine Learning ◽  
Differential Diagnosis ◽  
Cell Carcinoma ◽  
Area Under The Curve ◽  
Image Features ◽  
Renal Tumors ◽  
Support Vector ◽  
Svm Classifier ◽  
Renal Oncocytoma ◽  
Lasso Regression

Abstract Purpose To explore the value of CT-enhanced quantitative features combined with machine learning for differential diagnosis of renal chromophobe cell carcinoma (chRCC) and renal oncocytoma (RO). Methods Sixty-one cases of renal tumors (chRCC = 44; RO = 17) that were pathologically confirmed at our hospital between 2008 and 2018 were retrospectively analyzed. All patients had undergone preoperative enhanced CT scans including the corticomedullary (CMP), nephrographic (NP), and excretory phases (EP) of contrast enhancement. Volumes of interest (VOIs), including lesions on the images, were manually delineated using the RadCloud platform. A LASSO regression algorithm was used to screen the image features extracted from all VOIs. Five machine learning classifications were trained to distinguish chRCC from RO by using a fivefold cross-validation strategy. The performance of the classifier was mainly evaluated by areas under the receiver operating characteristic (ROC) curve and accuracy. Results In total, 1029 features were extracted from CMP, NP, and EP. The LASSO regression algorithm was used to screen out the four, four, and six best features, respectively, and eight features were selected when CMP and NP were combined. All five classifiers had good diagnostic performance, with area under the curve (AUC) values greater than 0.850, and support vector machine (SVM) classifier showed a diagnostic accuracy of 0.945 (AUC 0.964 ± 0.054; sensitivity 0.999; specificity 0.800), showing the best performance. Conclusions Accurate preoperative differential diagnosis of chRCC and RO can be facilitated by a combination of CT-enhanced quantitative features and machine learning.

Sign in / Sign up

Export Citation Format

Share Document