Skip to content
Top 1 submission in 2018 CS5785 Machine Learning final kaggle competition.
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.
.ipynb_checkpoints
lifei
luffy/PLSR
ranji
.gitattributes
.gitignore
README.md
Report.pdf

README.md

Overview

The competition is hosted at Kaggle.

We finally achieve score of 0.47029 at the public leaderboard, ranked at 1st place at both public and private leaderboard.

This repo hosts most of our scripts and our final paper report. Hope it helps~

Useful Tips

For supervised learning in continuous outcome problems (e.g., this kaggle problem), following techniques are really helpful:

  • linear regression, ridge regression, lasso, elastic net
  • partial least squares regression(PLSR), principal component regression(PCR)
  • decision trees (CART, CHAID, C5.0)
  • multiple adaptive regression splines
  • random forests
  • gradient boosted machines
  • support vector machine regression
  • neural networks (and deep learning)

We are pretty sure that by combining PLSR, ridge regression with other smaller models, you can achieve at least 0.50 at LB. Good luck!

You can’t perform that action at this time.
You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session.