ML之DT：基于簡單回歸問題訓(xùn)練決策樹(DIY數(shù)據(jù)集+七種{1~7}深度的決策樹{依次進(jìn)行10交叉驗證})

?

?

目錄

輸出結(jié)果

設(shè)計思路

核心代碼

---

?

?

?

?

輸出結(jié)果

設(shè)計思路

?

核心代碼

for iDepth in depthList:for ixval in range(nxval):idxTest = [a for a in range(nrow) if a%nxval == ixval%nxval]idxTrain = [a for a in range(nrow) if a%nxval != ixval%nxval]xTrain = [x[r] for r in idxTrain]xTest = [x[r] for r in idxTest]yTrain = [y[r] for r in idxTrain]yTest = [y[r] for r in idxTest]treeModel = DecisionTreeRegressor(max_depth=iDepth)treeModel.fit(xTrain, yTrain)treePrediction = treeModel.predict(xTest)error = [yTest[r] - treePrediction[r] for r in range(len(yTest))]if ixval == 0:oosErrors = sum([e * e for e in error])else:oosErrors += sum([e * e for e in error])mse = oosErrors/nrowxvalMSE.append(mse)

?

?

?

總結(jié)

以上是生活随笔為你收集整理的ML之DT：基于简单回归问题训练决策树(DIY数据集+七种{1~7}深度的决策树{依次进行10交叉验证})的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。