2024
DOI: 10.1016/j.asoc.2023.111045
|View full text |Cite
|
Sign up to set email alerts
|

Efficient evolution of decision trees via fully matrix-based fitness evaluation

Vinícius G. Costa,
Sancho Salcedo-Sanz,
Carlos E. Pedreira
Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 38 publications
0
1
0
Order By: Relevance
“…Decision trees (DTs) 37 are widely used machine learning classifiers known for their simplicity and efficiency across various fields. Random forest (RF) algorithms 38 build upon DTs, employing multiple trees for training and sample prediction.…”
Section: Methodsmentioning
confidence: 99%
“…Decision trees (DTs) 37 are widely used machine learning classifiers known for their simplicity and efficiency across various fields. Random forest (RF) algorithms 38 build upon DTs, employing multiple trees for training and sample prediction.…”
Section: Methodsmentioning
confidence: 99%
“…In the inference step, an observation follows a path from the root to one of the leaves, determined by the results of each logical test applied to the tested observation. These tests (often called "splits") can be univariate or multivariate [31].…”
mentioning
confidence: 99%