Rekod bukti kaedah

Semi-supervised Decision Tree

A Semi-supervised Decision Tree extends standard decision tree induction — such as CART or C4.5 — to exploit unlabeled observations alongside the labeled training set. By iteratively assigning tentative labels to unlabeled data and incorporating them into the growing or splitting process, the algorithm can achieve better accuracy than a fully supervised tree trained on the labeled subset alone, which is especially valuable when labeling is expensive or time-consuming.

Sources recorded, not reviewed

Rekod sumber

Petikan disalin secara verbatim daripada rekod sumber kaedah. Tiada pengesahan peringkat tuntutan disimpulkan daripadanya.

Semi-supervised Decision Tree Learning

Rekod kaedah taksonomik · ml-model / machine-learning

Levin, E. & Shapiro, E. (2000). Learning Decision Trees from Semi-labeled Examples. Proceedings of the ICML Workshop on Attribute-Value and Relational Learning. · URL
Zhu, X. & Goldberg, A. B. (2009). Introduction to Semi-Supervised Learning. Morgan & Claypool Publishers. · ISBN 978-1-598-29548-9

Buka kaedah penuh

Tuntutan yang dikurasi

Tuntutan disimpan dalam lejar bukti, setiap satu dengan penilaiannya sendiri.

Tiada tuntutan terkurasi lagi

Pandangan ini tidak mencipta penilaian tuntutan apabila lejar tiada.

Kaedah berkaitan

Dijana daripada graf kaedah dan ditunjukkan sebagai perhubungan yang dicadangkan mesin — tiada tuntutan bukti disimpulkan.

Same method familyDecision Treemachine-suggested · Relational suggestion, not evidence.Same method familyGradient Boostingmachine-suggested · Relational suggestion, not evidence.Same method familyLabel Propagationmachine-suggested · Relational suggestion, not evidence.Same method familyRandom Forestmachine-suggested · Relational suggestion, not evidence.