2022
DOI: 10.1016/j.matpr.2021.11.635
|View full text |Cite
|
Sign up to set email alerts
|

Comparative study of regressor and classifier with decision tree using modern tools

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
16
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
4

Relationship

0
10

Authors

Journals

citations
Cited by 44 publications
(22 citation statements)
references
References 3 publications
0
16
0
Order By: Relevance
“…This approach will be more developed till a leaf node is identified. The decision tree's output can be the terminal node 19,28,29 . Some of the well-known decision tree induction algorithms such as CART 19 , CHAID 25 , C4.5, and C5.0 27,30 .…”
Section: Methodsmentioning
confidence: 99%
“…This approach will be more developed till a leaf node is identified. The decision tree's output can be the terminal node 19,28,29 . Some of the well-known decision tree induction algorithms such as CART 19 , CHAID 25 , C4.5, and C5.0 27,30 .…”
Section: Methodsmentioning
confidence: 99%
“…Until a terminal node is found, this strategy will be tweaked and refined. The DT's forecast or outcome would be the terminal node 18 , 27 , 28 . The most useful algorithms for decision tree induction are CART 28 , CHAID 25 , C4.5, and C5.0 29 .…”
Section: Methodsmentioning
confidence: 99%
“…The Gini Index has a range of 0 to 1, with 0 denoting classification purity and 1 denoting random distribution of elements over different classes. In (Kushwah et al, 2021) this is applied to construct a decision tree using CART algorithm. The CART method generates a decision tree with the use of a binary split by using the Gini Index.…”
Section: C) Gain Ratiomentioning
confidence: 99%