Unverified50% confidenceFactExact time
A Decision Stump is a decision tree of depth 1 that sets a single threshold on one feature to split samples into two groups, and is the most common form of weak learner in AdaBoost.
1
Sources
50%
Confidence
Long-term
Relevance
10/4/2026
First Seen
Sources
Related Entities
Related Claims
Unverified决策树的分裂准则（信息增益、基尼不纯度、均方误差）本质上是排序统计量的函数，只关心阈值两侧的类别比例而非样本间距离71% similarUnverifiedCommon techniques for limiting decision tree overfitting include restricting the maximum tree depth (max_depth), requiring nodes to contain at least N samples before splitting (min_samples_split), and post-pruning.66% similarUnverifiedWhen dozens to hundreds of decision stumps are combined with weighted aggregation, the overall classifier's accuracy can significantly surpass that of a single deep decision tree.65% similarUnverifiedFor agents that make continuous autonomous decisions in multi-step tasks, erroneous behaviors have more opportunities to accumulate and amplify than in single-pass text generation, and the window for error correction is narrower.64% similarUnverifiedThe time complexity of brute-force searching for the optimal split point in a decision tree is O(n·m·log n), where n is the number of samples and m is the number of features, and this is the main bottleneck in decision tree training speed.64% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/973920API
curl https://kongchang.com/api/v1/knowledge/claims/973920MCP
get_claim(id=973920)