Skip to content

Instantly share code, notes, and snippets.

@vishalmehta1991

vishalmehta1991/pseudo_code

Created October 30, 2019 19:59
Show Gist options
  • Save vishalmehta1991/7edff60e6e08ecda3523ca9a7961b8fc to your computer and use it in GitHub Desktop.
Save vishalmehta1991/7edff60e6e08ecda3523ca9a7961b8fc to your computer and use it in GitHub Desktop.
Download ZIP

Revisions

  1. vishalmehta1991 created this gist Oct 30, 2019.
    7 changes: 7 additions & 0 deletions pseudo_code
    View file
    Original file line number Diff line number Diff line change
    @@ -0,0 +1,7 @@
    (A) Initialize a bit mask indicating which samples are contained in each node
    (B) Initialize a “node map” indicating which nodes are present at each level
    (C) ForEach(tree_level)
    1. Find the node id of all data samples, using the bit mask
    2. Compute the possible splits for all bins, all columns and all nodes
    3. Find the best split for each node
    4. Update the bit mask and sparse node map to feed the next level