scholarly journals Semantic Based Greedy Levy Gradient Boosting Algorithm for Phishing Detection

2022 ◽  
Vol 41 (2) ◽  
pp. 525-538
Author(s):  
R. Sakunthala Jenni ◽  
S. Shankar
Keyword(s):  
Gradient Boosting ◽  
Boosting Algorithm ◽  
Phishing Detection

scholarly journals Machine learning augmented predictive and generative model for rupture life in ferritic and austenitic steels

2021 ◽  
Vol 5 (1) ◽  
Author(s):  
Osman Mamun ◽  
Madison Wenzlick ◽  
Arun Sathanur ◽  
Jeffrey Hawk ◽  
Ram Devanathan
Keyword(s):  
Pearson Correlation ◽  
Rupture Life ◽  
Model Performance ◽  
Austenitic Stainless Steels ◽  
Generative Model ◽  
Austenitic Steels ◽  
Gradient Boosting ◽  
Variational Autoencoder ◽  
Feature Importance ◽  
Boosting Algorithm

AbstractThe Larson–Miller parameter (LMP) offers an efficient and fast scheme to estimate the creep rupture life of alloy materials for high-temperature applications; however, poor generalizability and dependence on the constant C often result in sub-optimal performance. In this work, we show that the direct rupture life parameterization without intermediate LMP parameterization, using a gradient boosting algorithm, can be used to train ML models for very accurate prediction of rupture life in a variety of alloys (Pearson correlation coefficient >0.9 for 9–12% Cr and >0.8 for austenitic stainless steels). In addition, the Shapley value was used to quantify feature importance, making the model interpretable by identifying the effect of various features on the model performance. Finally, a variational autoencoder-based generative model was built by conditioning on the experimental dataset to sample hypothetical synthetic candidate alloys from the learnt joint distribution not existing in both 9–12% Cr ferritic–martensitic alloys and austenitic stainless steel datasets.

An intelligent evolutionary extreme gradient boosting algorithm development for modeling scour depths under submerged weir

2021 ◽  
Author(s):  
Hai Tao ◽  
Maria Habib ◽  
Ibrahim Aljarah ◽  
Hossam Faris ◽  
Haitham Abdulmohsin Afan ◽  
...  
Keyword(s):  
Gradient Boosting ◽  
Algorithm Development ◽  
Extreme Gradient Boosting ◽  
Boosting Algorithm

scholarly journals Gradient boosting for linear mixed models

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Colin Griesbach ◽  
Benjamin Säfken ◽  
Elisabeth Waldmann
Keyword(s):  
Random Effects ◽  
Mixed Models ◽  
Selection Procedure ◽  
Classification Theory ◽  
Gradient Boosting ◽  
Random Structure ◽  
Boosting Algorithm ◽  
The One ◽  
Biased Estimates ◽  
Selection Of

Abstract Gradient boosting from the field of statistical learning is widely known as a powerful framework for estimation and selection of predictor effects in various regression models by adapting concepts from classification theory. Current boosting approaches also offer methods accounting for random effects and thus enable prediction of mixed models for longitudinal and clustered data. However, these approaches include several flaws resulting in unbalanced effect selection with falsely induced shrinkage and a low convergence rate on the one hand and biased estimates of the random effects on the other hand. We therefore propose a new boosting algorithm which explicitly accounts for the random structure by excluding it from the selection procedure, properly correcting the random effects estimates and in addition providing likelihood-based estimation of the random effects variance structure. The new algorithm offers an organic and unbiased fitting approach, which is shown via simulations and data examples.

Significant of Gradient Boosting Algorithm in Data Management System

2021 ◽  
Vol 9 (2) ◽  
pp. 85-100
Author(s):  
Md Saikat Hosen ◽  
Ruhul Amin
Keyword(s):  
Data Management ◽  
Text Classification ◽  
Learning Process ◽  
Learning Algorithm ◽  
Error Function ◽  
Data Management System ◽  
Gradient Boosting ◽  
Response Parameter ◽  
Boosting Algorithms ◽  
Boosting Algorithm

Gradient boosting machines, the learning process successively fits fresh prototypes to offer a more precise approximation of the response parameter. The principle notion associated with this algorithm is that a fresh base-learner construct to be extremely correlated with the “negative gradient of the loss function” related to the entire ensemble. The loss function's usefulness can be random, nonetheless, for a clearer understanding of this subject, if the “error function is the model squared-error loss”, then the learning process would end up in sequential error-fitting. This study is aimed at delineating the significance of the gradient boosting algorithm in data management systems. The article will dwell much the significance of gradient boosting algorithm in text classification as well as the limitations of this model. The basic methodology as well as the basic-learning algorithm of the gradient boosting algorithms originally formulated by Friedman, is presented in this study. This may serve as an introduction to gradient boosting algorithms. This article has displayed the approach of gradient boosting algorithms. Both the hypothetical system and the plan choices were depicted and outlined. We have examined all the basic stages of planning a specific demonstration for one’s experimental needs. Elucidation issues have been tended to and displayed as a basic portion of the investigation. The capabilities of the gradient boosting algorithms were examined on a set of real-world down-to-earth applications such as text classification.

scholarly journals Fido-SNP: the first webserver for scoring the impact of single nucleotide variants in the dog genome

2019 ◽  
Vol 47 (W1) ◽  
pp. W136-W141 ◽  
Author(s):  
Emidio Capriotti ◽  
Ludovica Montanucci ◽  
Giuseppe Profiti ◽  
Ivan Rossi ◽  
Diana Giannuzzi ◽  
...  
Keyword(s):  
Matthews Correlation Coefficient ◽  
Genomic Variation ◽  
Gradient Boosting ◽  
Binary Classifier ◽  
Single Nucleotide Variants ◽  
Single Nucleotide ◽  
Coding Regions ◽  
Variation Data ◽  
Boosting Algorithm ◽  
The Impact

Abstract As the amount of genomic variation data increases, tools that are able to score the functional impact of single nucleotide variants become more and more necessary. While there are several prediction servers available for interpreting the effects of variants in the human genome, only few have been developed for other species, and none were specifically designed for species of veterinary interest such as the dog. Here, we present Fido-SNP the first predictor able to discriminate between Pathogenic and Benign single-nucleotide variants in the dog genome. Fido-SNP is a binary classifier based on the Gradient Boosting algorithm. It is able to classify and score the impact of variants in both coding and non-coding regions based on sequence features within seconds. When validated on a previously unseen set of annotated variants from the OMIA database, Fido-SNP reaches 88% overall accuracy, 0.77 Matthews correlation coefficient and 0.91 Area Under the ROC Curve.

scholarly journals An Anomaly Mitigation Framework for IoT Using Fog Computing

Electronics ◽  
2020 ◽  
Vol 9 (10) ◽  
pp. 1565
Author(s):  
Muhammad Aminu Lawal ◽  
Riaz Ahmed Shaikh ◽  
Syed Raheel Hassan
Keyword(s):  
Smart Cities ◽  
Fog Computing ◽  
Multiclass Classification ◽  
Attack Detection ◽  
Gradient Boosting ◽  
Ip Address ◽  
Computing Paradigm ◽  
Security Challenges ◽  
Extreme Gradient Boosting ◽  
Boosting Algorithm

The advancement in IoT has prompted its application in areas such as smart homes, smart cities, etc., and this has aided its exponential growth. However, alongside this development, IoT networks are experiencing a rise in security challenges such as botnet attacks, which often appear as network anomalies. Similarly, providing security solutions has been challenging due to the low resources that characterize the devices in IoT networks. To overcome these challenges, the fog computing paradigm has provided an enabling environment that offers additional resources for deploying security solutions such as anomaly mitigation schemes. In this paper, we propose a hybrid anomaly mitigation framework for IoT using fog computing to ensure faster and accurate anomaly detection. The framework employs signature- and anomaly-based detection methodologies for its two modules, respectively. The signature-based module utilizes a database of attack sources (blacklisted IP addresses) to ensure faster detection when attacks are executed from the blacklisted IP address, while the anomaly-based module uses an extreme gradient boosting algorithm for accurate classification of network traffic flow into normal or abnormal. We evaluated the performance of both modules using an IoT-based dataset in terms response time for the signature-based module and accuracy in binary and multiclass classification for the anomaly-based module. The results show that the signature-based module achieves a fast attack detection of at least six times faster than the anomaly-based module in each number of instances evaluated. The anomaly-based module using the XGBoost classifier detects attacks with an accuracy of 99% and at least 97% for average recall, average precision, and average F1 score for binary and multiclass classification. Additionally, it recorded 0.05 in terms of false-positive rates.

scholarly journals T4SE-XGB: Interpretable Sequence-Based Prediction of Type IV Secreted Effectors Using eXtreme Gradient Boosting Algorithm

2020 ◽  
Vol 11 ◽  
Author(s):  
Tianhang Chen ◽  
Xiangeng Wang ◽  
Yanyi Chu ◽  
Yanjing Wang ◽  
Mingming Jiang ◽  
...  
Keyword(s):  
Gradient Boosting ◽  
Type Iv ◽  
Extreme Gradient Boosting ◽  
Boosting Algorithm
Sign in / Sign up

Export Citation Format

Share Document