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

modify desc

Browse Source
This commit is contained in:
hetong007 2015-07-31 21:33:54 +00:00
parent 2a01c5c865
commit 3a091fa302
1 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
R-package/DESCRIPTION
View File

@ -1,16 +1,16 @@
Package: xgboost Package: xgboost
Type: Package Type: Package
Title: eXtreme Gradient Boosting Title: Extreme Gradient Boosting
Version: 0.4-0 Version: 0.4-1
Date: 2015-05-11 Date: 2015-05-11
Author: Tianqi Chen <tianqi.tchen@gmail.com>, Tong He <hetong007@gmail.com>, Michael Benesty <michael@benesty.fr> Author: Tianqi Chen <tianqi.tchen@gmail.com>, Tong He <hetong007@gmail.com>, Michael Benesty <michael@benesty.fr>
Maintainer: Tong He <hetong007@gmail.com> Maintainer: Tong He <hetong007@gmail.com>
Description: eXtreme Gradient Boosting, which is an Description: Extreme Gradient Boosting, which is an
efficient and scalable implementation of gradient boosting framework. efficient implementation of gradient boosting framework.
This package is an R wrapper of xgboost. The package includes efficient This package is its R interface. The package includes efficient
linear model solver and tree learning algorithms. The package can automatically linear model solver and tree learning algorithms. The package can automatically
do parallel computation with OpenMP, and it can be more than 10 times faster do parallel computation on a single machine which could be more than 10 times faster
than existing gradient boosting packages such as gbm. It supports various than existing gradient boosting packages. It supports various
objective functions, including regression, classification and ranking. The objective functions, including regression, classification and ranking. The
package is made to be extensible, so that users are also allowed to define package is made to be extensible, so that users are also allowed to define
their own objectives easily. their own objectives easily.