[[courses:cs211:winter2014:journals:fred:4.7_clustering]]
Trace:
Show page
AdminRecent ChangesSitemap

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
courses:cs211:winter2014:journals:fred:4.7_clustering [2014/03/04 23:18] – gisafcourses:cs211:winter2014:journals:fred:4.7_clustering [2014/03/04 23:20] (current) – gisaf
Line 10: Line 10:
 What is the connection to MST's? Our procedure is precisely applying Kruskal's MST Algorithm. We stop when we obtain k connected components. This is similar to taking a full MST , and deleting k-1 most expensive edges, and defining the k-clustering to be the resulting connected components. What is the connection to MST's? Our procedure is precisely applying Kruskal's MST Algorithm. We stop when we obtain k connected components. This is similar to taking a full MST , and deleting k-1 most expensive edges, and defining the k-clustering to be the resulting connected components.
 **Analyzing the Algorithm**. **Analyzing the Algorithm**.
-We claim that the components formed by deleting k-1 most expensive edges of the MST constitute a k-clustering of maximum spacing.+We claim that the components formed by deleting k-1 most expensive edges of the MST constitute a k-clustering of maximum spacing, proof on //page 160-161//. What is the running time of finding k-clusters?? It will take the running time Kruskal's Algorithm would take. 
 + 
 +This section was easy to read through but required some attention, its scale is 8.5/10.
courses/cs211/winter2014/journals/fred/4.7_clustering.1393975091.txt.gz · Last modified: 2014/03/04 23:18 by gisaf
Show pageOld revisions
Media ManagerBack to top
CC Attribution-Noncommercial-Share Alike 4.0 International
Driven by DokuWiki Recent changes RSS feed Valid CSS Valid XHTML 1.0