Solving the Computationally Impossible With Heuristics

from pathlib import Path

DATA_DIR = Path("/kaggle/input")
if (DATA_DIR / "ucfai-core-fa18-heuristics").exists():
    DATA_DIR /= "ucfai-core-fa18-heuristics"
    # You'll need to download the data from Kaggle and place it in the `data/`
    #   directory beside this notebook.
    # The data should be here:
    DATA_DIR = Path("data")

Other Meetings in this Series

Read more

We're filling this out!

Read more

Sometimes the algorithms we use to predict the future can be difficult to interpret and trust. A Decision Tree is a learning algorithm that does a half decent job at prediction, but, more importantly, is very easy to understand and interpret. No black boxes here... until we start talking about Random Forests.

Contributing Authors