K-Means Clustering for a Supervised Problem

My friend Ed Bullen took a really interesting approach to this analysis here — haven’t fully gone through the code, but an interesting example of using k-means for a supervised problem, which I haven’t seen before.


One clap, two clap, three clap, forty?

By clapping more or less, you can signal to us which stories really stand out.