Hendrik/xgboost
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

fix VisibleDeprecationWarning

Browse Source
This commit is contained in:
Shayne Kang 2016-05-08 01:44:04 +09:00
parent 840481d215
commit bf24d6ae98
2 changed files with 3 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
python-package/xgboost/core.py
View File

@ -904,7 +904,8 @@ class Booster(object):
preds = preds.astype(np.int32) preds = preds.astype(np.int32)
nrow = data.num_row() nrow = data.num_row()
if preds.size != nrow and preds.size % nrow == 0: if preds.size != nrow and preds.size % nrow == 0:
preds = preds.reshape(nrow, preds.size / nrow) ncol = int(preds.size / nrow)
preds = preds.reshape(nrow, ncol)
return preds return preds
def save_model(self, fname): def save_model(self, fname):

2
python-package/xgboost/training.py
View File

@ -269,7 +269,7 @@ def mknfold(dall, nfold, param, seed, evals=(), fpreproc=None, stratified=False,
if stratified is False and folds is None: if stratified is False and folds is None:
randidx = np.random.permutation(dall.num_row()) randidx = np.random.permutation(dall.num_row())
kstep = len(randidx) / nfold kstep = int(len(randidx) / nfold)
idset = [randidx[(i * kstep): min(len(randidx), (i + 1) * kstep)] for i in range(nfold)] idset = [randidx[(i * kstep): min(len(randidx), (i + 1) * kstep)] for i in range(nfold)]
elif folds is not None: elif folds is not None:
idset = [x[1] for x in folds] idset = [x[1] for x in folds]