Rekodi ya ushahidi wa mbinu

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

Rekodi ya chanzo

Nukuu zimehamishwa kwa uhalisi kutoka kwa rekodi ya chanzo cha mbinu. Hakuna uthibitisho wa kiwango cha dai unaodokezwa kutoka kwao.

Semi-supervised Decision Tree Learning

Rekodi ya mbinu ya kiajenda · 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

Fungua mbinu kamili

Madai yaliyotunzwa

Madai yamehifadhiwa katika daftari la ushahidi, kila moja ikiwa na tathmini yake.

Hakuna madai yaliyotunzwa bado

Mwonekano huu haubuni tathmini ya dai wakati daftari haina yoyote.

Mbinu zinazohusiana

Zilizotengenezwa kutoka kwa grafu ya mbinu na kuonyeshwa kama uhusiano uliopendekezwa na mashine — hakuna dai la ushahidi linalodokezwa.

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.