Skip to content
An attempt to use an entropy-based decision tree to solve the Kaggle Titanic challenge
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
resources
src/kaggle_titanic
test/kaggle_titanic
.gitignore
LICENSE
README.md
project.clj

README.md

kaggle-titanic

This is an attempt to use an entropy-based decision tree to solve the Titanic challenge at Kaggle.com.

The implementation is a pretty standard one, with one exception: it uses a columnar dataset. The CSV is lazily loaded into colums instead of reading it simply as a set of vectors. This makes entropy computation pretty fast.

Refer to src/kaggle_titanic/example.clj for an overview of how to use the thing.

License

Copyright © 2014 Daniel Kvasnicka

Distributed under the Eclipse Public License either version 1.0 or (at your option) any later version.

You can’t perform that action at this time.