2015
DOI: 10.14445/22312803/ijctt-v27p105
|View full text |Cite
|
Sign up to set email alerts
|

The Comparison of Gini and Twoing Algorithms in Terms of Predictive Ability and Misclassification Cost in Data Mining: An Empirical Study

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 30 publications
0
4
0
Order By: Relevance
“…While the LDT leaf size was directly optimized (∼200), because a larger number of node (or splits) in the tree implies a larger memory occupation (data latency is not an issue, being proportional simply to the logarithm of the tree size), the maximum number of splits was set equal to the minimum value that allowed accuracy optimization within 1% from the absolute optimum, (∼3×10 4 ). Twoing rule [58] was selected as splitting criterion for both GDT and LDTs.…”
Section: Decision Trees: Experimental Resultsmentioning
confidence: 99%
“…While the LDT leaf size was directly optimized (∼200), because a larger number of node (or splits) in the tree implies a larger memory occupation (data latency is not an issue, being proportional simply to the logarithm of the tree size), the maximum number of splits was set equal to the minimum value that allowed accuracy optimization within 1% from the absolute optimum, (∼3×10 4 ). Twoing rule [58] was selected as splitting criterion for both GDT and LDTs.…”
Section: Decision Trees: Experimental Resultsmentioning
confidence: 99%
“…Table 2 contains training model details, along with visualizations for evaluating performance. A separate study was conducted to test the Optimizable Tree method for maximum deviance reduction [38], Towing Rule [39], and Gini's Diversity Index [40]. It was tried to examine how many splits there are from 1 to 560.…”
Section: Pathological Data-based Machine Learning Model Developmentmentioning
confidence: 99%
“…In case of regression, C&RT looks for splits that minimize the prediction squared error (the least squared deviation). The prediction in each leaf is based on the weighted mean for node [10,33,51,62, 64].…”
Section: Brief Description Of the Statistical Model Structuresmentioning
confidence: 99%