决策树回归
对数据进行非线性划分
决策树回归 是 CoddyKit 上的免费 Data Science Academy 课时。 这是第 3 节课，共 4 节。 你可以在下方免费阅读本课时的完整内容 — 然后在浏览器中使用内置代码编辑器和全天候 AI 导师进行实践。 这是 Data Science Academy 学习路径的一部分，你的进度在网页和 CoddyKit 应用中同步。 Data Science Academy 课程共包含 4 节课。
本课时的部分内容尚未翻译，以英文显示。
Beyond Straight Lines
A decision tree predicts numbers by asking yes-or-no questions about your features, splitting the data step by step. No straight line required. 🌳
Splits Are the Questions
Each branch is a split, like is size above 80? The tree keeps asking, narrowing rows into smaller and smaller groups.
Leaves Hold the Answer
At the bottom sit the leaves. Each leaf predicts one number: the average target of all training rows that landed there.
Choosing the Best Split
The tree tries many split points and keeps the one that most reduces prediction error in the resulting groups. Greedy, one step at a time.
Train One in Two Lines
The familiar fit-predict contract holds. Create a DecisionTreeRegressor, fit it, and predict just like any other estimator.
from sklearn.tree import DecisionTreeRegressor
model = DecisionTreeRegressor().fit(X, y)Predictions Look Like Steps
Because each leaf gives one flat value, a tree's predictions form a staircase, not a smooth curve. That is fine for many real patterns.
Trees Catch Non-Linear Shapes
Splits can bend any direction, so a tree captures non-linear relationships that a line would completely miss. That is its real strength.
Deep Trees Overfit
Left unchecked, a tree grows until each leaf holds one row, memorizing noise. That deep tree overfits and fails on new data.
Limit the Depth
Control growth with max_depth. A shallower tree stays general and is far easier to read and trust.
DecisionTreeRegressor(max_depth=4)More Pruning Knobs
You can also set min_samples_leaf so leaves keep enough rows. This stops the tree from carving out tiny, noisy groups.
DecisionTreeRegressor(min_samples_leaf=10)No Scaling Needed
Trees split on thresholds, so feature units do not matter. You can skip scaling, a nice contrast to Ridge and Lasso.
Quick Check
Think about how a tree turns rows into a prediction.
Recap
A decision tree splits data with questions, predicts a leaf average, and bends to non-linear shapes. Cap its depth so it generalizes. 🎯
常见问题解答
「决策树回归」课时是免费的吗？
是的 — 「决策树回归」的完整文本可在网页上免费阅读。要进行交互式练习（内置代码编辑器和全天候 AI 导师）并解锁 Data Science Academy 课程的其余内容，请升级到 CoddyKit PRO。 Data Science Academy 课程共包含 4 节课。
「决策树回归」这节课中我会学到什么？
对数据进行非线性划分 你通过在浏览器中直接运行的动手代码来练习 Data Science Academy，全天候 AI 导师会在你学习这节课的过程中回答你的问题。
学习 Data Science Academy 需要有经验吗？
无需任何先前经验。CoddyKit 上的 Data Science Academy 课程适合初学者到高级学习者，你可以从这里开始或从头开始，按照自己的节奏学习。 这是第 3 节课，共 4 节。
「决策树回归」课时需要多长时间？
大多数 CoddyKit 课程大约需要 5–10 分钟。每节课都很精短且互动，所以你能稳步进步，并在网页和应用中从离开的地方继续。
我能在这节 Data Science Academy 课中编写并运行代码吗？
能。每节 Data Science Academy 课都包含内置代码编辑器，你可以在浏览器中直接编写并运行真实代码，并获得即时 AI 反馈 — 无需本地设置。