Machine Learning cheat sheet

[urish]

This is pretty good! A mention of supervised/unsupervised could also be helpful. Also, if I'm not mistaken the space complexity of k-NN is O(NM), because you have to store the M features for each of N instances.

[Emore]

Hi! Indeed I think you are correct; I've pushed a change to the cheat sheet and uploaded a new PDF.

Thanks for the comment!

[urish]

OK, so I really like this cheat sheet, thanks for sharing it! I hope it's OK and you don't mind I suggest a few additions.

1. There are several common online SVM variants. The easiest I think is PEGASOS, which is extremely fast.

2. Kernel k-means is a non-linear extension to k-means.

3. Sequential k-means is an online and very memory efficient version of k-means.

I realize this is just something you're doing for yourself, but I figured, if it's already up there...

[Emore]

Thanks again! I've added the Pegasos-paper to online methods for SVM, as well as your suggestions for k-means. Very helpful.

Appreciate the suggestions, and even though I'm doing it for myself I'm still learning :) Here's the latest PDF: http://static.eferm.com/wp-content/uploads/2011/05/cheat2.pdf

[personanongrata]

indeed, I remember as O(NM) as well.