Join 📚 Kevin's Highlights

A batch of the best highlights from what Kevin's read, .

• Finding and Understanding the Data • Cleaning the Data and Feature Engineering • Tuning and Evaluating • Using the Model and Presenting Results

The Machine Learning Process

Codecademy

Starting Hand Standards A reasonable set of opening requirements at most tables would be as follows: **Early position**: Ten high or better badugis; Smooth 7 high tris or better **Hijack**: Jack high or better badugis, Smooth 8 high tris or better **Cut-off**:  All badugis, 8 high tris or better, A2 and A3 **Button**: All badugis, 9 high tris or better, A2, A3, 23, A4

Badugi Rules and Basic Strategy

countingouts.com

If you’re mathematically inclined, then you could use the [pigeonhole principle](https://en.wikipedia.org/wiki/Pigeonhole_principle) to describe hash collisions more formally: > Given *m* items and *n* containers, > if *m* > *n*, > then there’s at least one container > with more than one item. In this context, items are a potentially infinite number of values that you feed into the hash function, while containers are their hash values assigned from a finite pool.

Build a Hash Table in Python With TDD

Bartosz Zaczyński

...catch up on these, and many more highlights