2021
DOI: 10.1088/1742-6596/1995/1/012017
|View full text |Cite
|
Sign up to set email alerts
|

A Prediction Method Based on Extreme Gradient Boosting Tree Model and its Application

Abstract: Improving the accuracy of financing risk prediction is of great significance to the healthy development of grid enterprises. Taking a provincial-level power grid company as the research object, the financing risk index system is constructed by considering multiple dimensions, and the monthly financing risk index RI of power grid enterprises from 2015-2018 is determined based on entropy weight and comprehensive index method, while the financing risk prediction model is constructed with the help of extreme gradi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
2
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 12 publications
0
2
0
Order By: Relevance
“…This study used XGB. The algorithm is a type of gradient-boosting algorithm that uses decision trees as base learners [19]. It works by iteratively adding decision trees to the model, with each tree attempting to correct the errors made by the previous tree [20].…”
Section: Extreme Gradient Boosting Decision Tree Modelmentioning
confidence: 99%
“…This study used XGB. The algorithm is a type of gradient-boosting algorithm that uses decision trees as base learners [19]. It works by iteratively adding decision trees to the model, with each tree attempting to correct the errors made by the previous tree [20].…”
Section: Extreme Gradient Boosting Decision Tree Modelmentioning
confidence: 99%
“…Compared with ordinary ID3 and C4.5, the main feature of CART tree is that it is a binary tree, and the feature value of each node is "yes" and "no". Such a decision tree recursively divides each feature and determines a unique output in each partition of the input space [11].…”
Section: Prediction Modulementioning
confidence: 99%
“…Gradient boosting tree (GBT) is based on the boosting idea in ensemble learning and runs in serial mode [19][20][21]. In each iteration, a weak learner (decision tree T 1 ∼T m ) is selected, and a new decision tree is established in the gradient direction of reducing the residual (F 0 ∼F m ).…”
Section: Gradient Boosting Treementioning
confidence: 99%