2018
DOI: 10.1049/iet-its.2018.5281
|View full text |Cite
|
Sign up to set email alerts
|

Prediction of ship collision risk based on CART

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
9
1

Relationship

0
10

Authors

Journals

citations
Cited by 24 publications
(8 citation statements)
references
References 12 publications
0
8
0
Order By: Relevance
“…, n is the number of samples and m is the number of features. According to the CART tree algorithm as the base classifier [34,35], the model function can be defined by Equation 2as follows:…”
Section: Xgboost Classification Machine Learning Algorithmmentioning
confidence: 99%
“…, n is the number of samples and m is the number of features. According to the CART tree algorithm as the base classifier [34,35], the model function can be defined by Equation 2as follows:…”
Section: Xgboost Classification Machine Learning Algorithmmentioning
confidence: 99%
“…In our previous work [27,28], we applied the DT algorithm in anomaly intrusion detection and found it to have excellent classification performance. The DT has the advantages of intuitive expression and convenient operation and is widely used in research [29][30][31][32][33][34][35][36]. It consists of a root node, a child node, and a leaf node.…”
Section: A Brief Description Of the Decision Tree Algorithmmentioning
confidence: 99%
“…Random Forest belongs to an integrated algorithm, which is based on the Bagging algorithm, and the Classification and Regression Tree (CART) algorithm [17]. The Bagging algorithm is short for Bootstrap Aggregating, and it is based on Bootstrap sampling [18].…”
Section: Random Forest Algorithm Flowmentioning
confidence: 99%