Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up

License

NotificationsYou must be signed in to change notification settings

qiyiping/gbdt

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Quick Start

  • Download the code:git clone https://github.com/qiyiping/gbdt.git
  • Runmake to compile
  • Run the demo script in `test`:./demo.sh

Data Format

[InitalGuess] Label Weight Index0:Value0 Index1:Value1 ..

Each line contains an instance and is ended by a ‘\n’ character. Inital guess is optional. For two-class classification, Label is -1 or 1. For regression, Label is the target value, which can be any real number. Feature Index starts from 0. Feature Value can be any real number.

Training Configuration

classConfigure {public:size_tnumber_of_feature;// number of featuressize_tmax_depth;// max depth for each treesize_titerations;// number of trees in gbdtdoubleshrinkage;// shrinkage parameterdoublefeature_sample_ratio;// portion of features to be spliteddoubledata_sample_ratio;// portion of data to be fitted in each iterationsize_tmin_leaf_size;// min number of nodes in leafLossloss;// loss typebooldebug;// show debug info?double*feature_costs;// mannually set feature costs in order to tune the modelboolenable_feature_tunning;// when set true, `feature_costs' is used to tune the modelboolenable_initial_guess;...};

Reference

  • Friedman, J. H. “Greedy Function Approximation: A Gradient Boosting Machine.” (February 1999)
  • Friedman, J. H. “Stochastic Gradient Boosting.” (March 1999)
  • Jerry Ye, et al. (2009). Stochastic gradient boosted distributed decision trees. (Distributed implementation)

[8]ページ先頭

©2009-2025 Movatter.jp