পদ্ধতির তুলনা করুন

	অ্যাক্টিভ লার্নিং ডিসিশন ট্রি	আধা-পর্যবেক্ষিত সিদ্ধান্ত বৃক্ষ
ক্ষেত্র	যন্ত্র শিখন	যন্ত্র শিখন
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	1984–2010	2000s
প্রবর্তক	Settles, B. (active learning framework); Breiman et al. (decision tree base)	Various (Levin & Shapiro; Zhu & Goldberg lineage)
ধরন	Active learning with decision tree base learner	Semi-supervised classifier / regressor
মৌলিক উৎস	Settles, B. (2010). Active Learning Literature Survey. Computer Sciences Technical Report 1648, University of Wisconsin-Madison.	Levin, E. & Shapiro, E. (2000). Learning Decision Trees from Semi-labeled Examples. Proceedings of the ICML Workshop on Attribute-Value and Relational Learning.
অপর নাম	AL-DT, active decision tree, query-based decision tree learning, uncertainty-sampling decision tree	SSDT, semi-supervised tree induction, self-training decision tree, label-propagation tree
সম্পর্কিত	5	4
সারসংক্ষেপ	Active learning with a decision tree combines the interpretable structure of a CART-style tree with a query strategy that selects the most informative unlabeled instances for human annotation. The model iteratively requests labels only for examples it is most uncertain about, minimising labeling cost while maximising classification accuracy on tabular data.	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.