Skip to content

Commit 288b612

Browse files
更新Github信息和 树回归的注释
1 parent d4838f3 commit 288b612

2 files changed

Lines changed: 7 additions & 4 deletions

File tree

src/python/5.Logistic/logistic.py

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -4,8 +4,8 @@
44
Created on Oct 27, 2010
55
Update on 2017-05-18
66
Logistic Regression Working Module
7-
@author: Peter Harrington/羊三/小瑶
8-
《机器学习实战》更新地址:https://github.com/apachecn/MachineLearning
7+
Author: Peter Harrington/羊三/小瑶
8+
GitHub: https://github.com/apachecn/MachineLearning
99
'''
1010
from numpy import *
1111
import matplotlib.pyplot as plt

src/python/9.RegTrees/regTrees.py

Lines changed: 5 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -4,8 +4,8 @@
44
Created on Feb 4, 2011
55
Update on 2017-12-20
66
Tree-Based Regression Methods Source Code for Machine Learning in Action Ch. 9
7-
@author: Peter Harrington/片刻/小瑶/zh0ng
8-
《机器学习实战》更新地址:https://github.com/apachecn/MachineLearning
7+
Author: Peter Harrington/片刻/小瑶/zh0ng
8+
GitHub: https://github.com/apachecn/MachineLearning
99
'''
1010
print(__doc__)
1111
from numpy import *
@@ -155,6 +155,9 @@ def createTree(dataSet, leafType=regLeaf, errType=regErr, ops=(1, 4)):
155155
feat, val = chooseBestSplit(dataSet, leafType, errType, ops)
156156
# if the splitting hit a stop condition return val
157157
# 如果 splitting 达到一个停止条件,那么返回 val
158+
'''
159+
*** 最后的返回结果是最后剩下的 val,也就是len小于topN的集合
160+
'''
158161
if feat is None:
159162
return val
160163
retTree = {}

0 commit comments

Comments
 (0)