This is a little write up of a very small project I did, inspired by Coding Garden with CJ on youtube & twitch *(specifically this video)*, and Net Ninja express tutorials:

A URL-shortener that uses a sequence of emojis to encode each URL.

The code is available on github, and you can try it out at emoj.yt.

This is Part 3 of my decision trees series. This time around we are going to code a decision tree in Python. So I’m going to try to make this code as understandable as possible, but if you are not familiar with Object Oriented Programming (OOP) or recursion you might have a tougher time.

If you haven’t read my post on linear regression I invite you to do so here, but basically it is a method for modelling the relationship between variables \(X_i\) and a target feature \(y\) in a linear model. This modelling is done through learning weights \(\theta_i\) for each \(X_i\) supposing that our model looks something like this: