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

Prediction performance of improved decision tree-based algorithms: a review

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
64
0
6

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 127 publications
(70 citation statements)
references
References 13 publications
0
64
0
6
Order By: Relevance
“…It is important to underline that the decision tree uses the same number of random features of the training sample to create a random forest consisting of different decision trees. The decision tree is based on CART, ID3, and C4.5 algorithms [21]. Training is performed in order to get two the most homogeneous subsamples for each root.…”
Section: The Algorithm Of Random Forestmentioning
confidence: 99%
“…It is important to underline that the decision tree uses the same number of random features of the training sample to create a random forest consisting of different decision trees. The decision tree is based on CART, ID3, and C4.5 algorithms [21]. Training is performed in order to get two the most homogeneous subsamples for each root.…”
Section: The Algorithm Of Random Forestmentioning
confidence: 99%
“…It is one of the techniques of Machine Learning the construction of which is aiming at, the sequential split of a set of observations into subsets. It is easily apprehended by people because it applies simple representations for the classification of examples, and it is often used in the mining data sector [16]. The basic purpose of the Decision Trees is the prediction of the variable value that is trained by data created by other independent variables [17].…”
Section: Decision Treesmentioning
confidence: 99%
“…Pohon keputusan algoritma C4.5 digunakan untuk penalaran tegas manajemen tanggap darurat [5], kontruksi kendala otomatis untuk model Mixed-Integer Linear Programming (MILP) dari data [6] dan pengembangan pohon keputusan [7]. Algoritma ini juga digunakan oleh [8] untuk penilaian stabilitas tegangan online dan hasilnya bisa membantu operator sistem menilai status stabilitas tegangan secara real-time.…”
Section: Pendahuluanunclassified
“…Pohon keputusan memiliki fungsi untuk menyelidiki data, mencari hubungan tersembunyi antara calon variabel target dengan variabel input yang akan digunakan. Perpaduan antara pemodelan dan eksplorasi data pada pohon keputusan sangat direkomendasikan sebagai langkah awal pemodelan serta model akhir dari beberapa teknik lain [7]. Simpul node dari decission tree pohon dibedakan menjadi tiga [11], yaitu : a. Simpul akar (root node) yang letaknya berada pada bagian teratas serta tidak memiliki inputan namun terkadang memiliki output lebih dari satu atau tidak sama sekali.…”
Section: Splitinfo(sa)unclassified