This was my final project for CS 671D (Theory and Algorithms of Machine Learning). I did some data visualizations to compare a subset of the Rashomon set to the full Rashomon set of sparse decision trees for two datasets, which you can find in the file check_greedy.ipynb in the treefarms folder (most of the other files are from the original repo). The original repository is here: https://github.com/ubc-systopia/treeFarms
-
Notifications
You must be signed in to change notification settings - Fork 0
STA 671D Final Project: Finding the subset of trees in the Rashomon set that are greedy past a certain depth and doing some analysis with them.
License
tracysun27/treeFarms
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
STA 671D Final Project: Finding the subset of trees in the Rashomon set that are greedy past a certain depth and doing some analysis with them.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published