2023
DOI: 10.1016/j.aej.2022.07.011
|View full text |Cite
|
Sign up to set email alerts
|

Forecasting and classification of new cases of COVID 19 before vaccination using decision trees and Gaussian mixture model

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0
3

Year Published

2023
2023
2024
2024

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 15 publications
(8 citation statements)
references
References 18 publications
0
5
0
3
Order By: Relevance
“…Os resultados obtidos com o modelo proposto são comparados com os obtidos por modelos clássicos e relevantes apresentados na literatura: i) modelos estatísticos (ARIMA [30], LINREG [30], REGTREE [43] e SVR [44]), ii) modelos de rede neural (MLP [35], RBF [36], CNN [37]), e iii) modelos dinâmicos (NARX [31] e LSTM [32]).…”
Section: Simulac ¸õEs E Resultados Experimentaisunclassified
“…Os resultados obtidos com o modelo proposto são comparados com os obtidos por modelos clássicos e relevantes apresentados na literatura: i) modelos estatísticos (ARIMA [30], LINREG [30], REGTREE [43] e SVR [44]), ii) modelos de rede neural (MLP [35], RBF [36], CNN [37]), e iii) modelos dinâmicos (NARX [31] e LSTM [32]).…”
Section: Simulac ¸õEs E Resultados Experimentaisunclassified
“…ID3, short for Iterative Dichotomize 3, is a type of decision tree that works on discrete classes and cannot be used on missing data. [17]. ID3 is the basic algorithm that has been developed on the C4.5 and CART methods.…”
Section: Data Modelling (Id3 C45 Cart)mentioning
confidence: 99%
“…Meanwhile, if the target is categorical, the resulting tree is a classification tree [21]. The advantage of CART compared to ID3 and C4.5 is the construction of a tree with only two children per node [17]. Establishing a CART tree is done through the process of collecting datasets at the root node of the tree with each node divided into two child nodes with a separation variable which is one of the predictor variables [22].…”
Section: Data Modelling (Id3 C45 Cart)mentioning
confidence: 99%
“…Decision Tree (D-Tree) is a supervised machine learning algorithm that can perform modeling for both classification, regression, data mining, and statistical problems [20]. When the D-Tree algorithm performs classification, it creates decision nodes based on features and goals, and from these nodes, it also creates leaf nodes and carries out the classification process.…”
Section: ) Decision Treementioning
confidence: 99%