Skip to content
master
Switch branches/tags
Code

Latest commit

 

Git stats

Files

Permalink
Failed to load latest commit information.
Type
Name
Latest commit message
Commit time
Feb 18, 2019
Dec 30, 2020
Dec 30, 2020
Dec 30, 2020
Feb 18, 2019
Feb 18, 2019
Feb 18, 2019

Leaf-wise Induction of Decision Tree with Presorted Deque

This is the proof-of-concept demo code for reproducing experiments in the arXiv note "A Faster Drop-in Implementation for Leaf-wise Exact Greedy Induction of Decision Tree Using Pre-sorted Deque" (https://arxiv.org/abs/1712.06989).

Prepare sample data

  • download data from HIGGS and uncompress gz file.
  • create training data head -1000000 HIGGS.csv > higgs-train-1m.csv
  • create testing data tail -50000 HIGGS.csv > higgs-test.csv

Compile and test

$ make
$ OMP_NUM_THREADS=28 ./build/test_dt higgs-train-1m.csv higgs-test.csv
tree induction time: 1.217055 seconds
training time: 2.237200 seconds
nleafs: 2216 
test accuracy: 0.710

Other tests on synthetic data

$ OMP_NUM_THREADS=8 ./build/test_dt
tree induction time: 2.715179 seconds
training time: 4.514815 seconds
nleafs: 33
test accuracy: 0.973

All rights reserved. Jianbo Ye

About

C++ code for "A Faster Drop-in Implementation for Leaf-wise Exact Greedy Induction of Decision Tree Using Pre-sorted Deque"

Topics

Resources

Releases

No releases published

Packages

No packages published