Skip to content

2015.09.24: random forest

Ben Best edited this page Sep 30, 2015 · 8 revisions

2015-09-24: Random Forest

Steven gave an overview of Julia. Ben played Andrew Ng's introduction to machine learning lecture video from his course on Coursera.

A computer program is said to learn from experience E with respect to some task T and some performance measure P, if its performance on T, as measured by P, improves with experience E.

We then discussed different ideas in machine learning.

Ben showed another video on linear regression but should've showed this more specific follow-on video about a very high level overview of random forests.

Then Haroldur and Steven explained how support vector machines are basically linear classifiers that add additional dimensions to the data to create complex classification boundaries in the original, lower dimensional space. They also warned how they are notoriously bad at overfitting.

Next we split into groups and learned about random forests (an advanced, over-fitting resistant form of decision trees).

Great resources for BOOSTING your learning about decision trees

Aside on Natural Language Processing

Links based on some of Morgan's work, and Ben's googling:

Ideas for next time

  1. Haroldur suggested Statistics for hackers

https://speakerdeck.com/jakevdp/statistics-for-hackers

  1. Both Steven and Haroldur expressed interest in discussin Bayesian methods. Haruldur mentioned Probalistic Programming and Bayesian Methods for Hackers which is a book made up of ipython notebooks.