2019
DOI: 10.1016/j.eswa.2019.07.012
|View full text |Cite
|
Sign up to set email alerts
|

Measuring the Shattering coefficient of Decision Tree models

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 11 publications
(5 citation statements)
references
References 17 publications
0
5
0
Order By: Relevance
“…Compared with other types of machine learning algorithms such as logistic regression (LR), artificial neural networks (ANN), etc, the CART does not need to establish a nonlinear model, and can intuitively make the decision for classification and extract knowledge rules based on decision tree graph. 31…”
Section: Cartmentioning
confidence: 99%
“…Compared with other types of machine learning algorithms such as logistic regression (LR), artificial neural networks (ANN), etc, the CART does not need to establish a nonlinear model, and can intuitively make the decision for classification and extract knowledge rules based on decision tree graph. 31…”
Section: Cartmentioning
confidence: 99%
“…The process of classifying relies on a top-down recursive system. These internal nodes branch out to leaf nodes according to the results of the attribute test, which are the final classifiers [22]. DTC structure is shown in Fig.…”
Section: Machine Learning Modelsmentioning
confidence: 99%
“…Decision Trees are a natural starting point for the study of extending inductive strategies to streaming scenarios; their simplicity allows us to compute model complexity [36], and they are highly interpretable. Concept Learning System (CLS) [29] was one of the first decision tree algorithms, published in 1966.…”
Section: Decision Trees For Batch Learningmentioning
confidence: 99%