Classification with Decision trees

Now that we have a decision tree constructed, we can use it for classification problems. 
The classification method is a recursive one which parses the dictionary and halts (& returns) when a leaf node is encountered.
In such problems, the vast chunk of processing time goes into building the decision tree.
It would be very inconvenient if the decision tree is to re-built every time we classify a problem.
It makes a lot of sense to serialise the tree, and we use the Python pickle module to do so.
The code is available via Bitbucket

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: