13 07 9 separate 11 and 12 12 09 cluster

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: nents: Removing Edges Cluster 1 0.9 5 0.8 0.9 7 •  Require that a candidate is part of the cluster of the closest center 8 Cluster 2 1.  Sort the edges of the duplicate pair graph in descending order of their similarity. 13 0.7 9 Separate 11 and 12! 12 0.9 Cluster 3 Cluster 4 Sangmi Lee Pallickara 2.  Scan the sorted set of edges and a candidate c that occurs first becomes a center. 13 CS480 Principles of Data Management Spring 2013 Make all candidates as part of a cluster with a center Cluster 1 Cluster 1 3 1 0.9 5 0.8 0.9 11 6 0.9 0.7 Cluster 2 0.8 10 12 0.9 13 0.7 9 Cluster 4 Sangmi Lee Pallickara CS480 Principles of Data Management Sangmi Lee Pallickara CS480 Principles of Data Management Cluster 3 (11,10) (10,9) (11,9) (10,12) (9,12) 3 0.9 11 0.8 6 0.9 (1,2) 7 0.9 0.7 8...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online