Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revision | Next revisionBoth sides next revision | ||
| courses:cs211:winter2011:journals:wendy:chapter4 [2011/03/01 00:45] – shangw | courses:cs211:winter2011:journals:wendy:chapter4 [2011/03/01 00:50] – [Section 7: Clustering] shangw | ||
|---|---|---|---|
| Line 77: | Line 77: | ||
| ===== Section 7: Clustering ===== | ===== Section 7: Clustering ===== | ||
| - | This section talks about another problem-Clustering-and how to solve it with greedy algorithm. Clustering (of maximum spacing) can be precisely described as | + | This section talks about another problem-Clustering-and how to solve it with greedy algorithm. Clustering (of maximum spacing) can be precisely described as partitioning a collection of objects U such that the maximum possible spacing s achieved (That is, the minimum distance between any pair of points lying in different clusters is minimized). |
| + | |||
| + | The alogrithm is exactly the Kruskal' | ||
