This is it, the last set of notes.

Here’s the PDF of the 2015/03/27 notes.

Here’s PDF of the 2015/03/20 notes.

Here’s PDF of the 2015/03/16 notes.

Here’s PDF of the 2015/03/11 notes.

Here’s the PDF of the 2015/03/02 notes.

Here’s the PDF of the 2015/02/23 notes.

Here’s PDF of the 2015/02/11 notes.

A final handout to prove optimality of our greedy algorithm.

NOTE: Problem 2 should ask about a bound on a solution produced by the greedy algorithm in terms of the last intra-category edge across which it merged. (You can answer the question as it stands, and it remains an interesting question.. just not useful for the rest of the worksheet!)

We have a new set of notes that builds on our greedy clustering problem.