2014
DOI: 10.1063/1.4903661
|View full text |Cite
|
Sign up to set email alerts
|

Winsorised gini impurity: A resistant to outliers splitting metric for classification tree

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 2 publications
0
1
0
Order By: Relevance
“…A decision tree is a tree-structured classifier where core nodes represent the characteristics of a dataset, branches represent the decision rules, and leaf nodes represent the outcomes (Ch'ng & Mahat, 2014;Hong et al, 2023). Classification and regression tree algorithm (CART) is a type of classification algorithm that uses Gini's impurity index to build a decision tree model (Breiman et al, 1984).…”
Section: Classification and Regression Treementioning
confidence: 99%
“…A decision tree is a tree-structured classifier where core nodes represent the characteristics of a dataset, branches represent the decision rules, and leaf nodes represent the outcomes (Ch'ng & Mahat, 2014;Hong et al, 2023). Classification and regression tree algorithm (CART) is a type of classification algorithm that uses Gini's impurity index to build a decision tree model (Breiman et al, 1984).…”
Section: Classification and Regression Treementioning
confidence: 99%