All edges including the candidate connected to c

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: Cluster 2 0.8 10 0.9 9 Spring 2013 5 4 0.9 15 Spring 2013 0.7 0.8 2 Cluster 2 (6,7) (6,5) (3,4) (5,8) (3,5) 14 Make all candidates as part of a cluster with a center Cluster 1 1 Cluster 4 13 Cluster 3 3.  All edges including the candidate connected to c becomes part of the cluster. Cluster 1 (1,2) 7 0.9 8 4 2 0.8 0.7 Spring 2013 •  Determine centers within a connected component 0.8 10 11 0.9 CS480 Principles of Data Management Partitioning duplicate clusters based on the center 0.9 4 2 0.8 6 3 1 Spring 2013 12 0.7 Cluster 3 13 Cluster 3 (11,10) (10,11)? (10,9) (11,9) (10,12) (9,12) Cluster 2 (6,7) (6,5) (3,4) (5,8) (3,5) Cluster 4 13 Cluster 4 Sangmi Lee Pallickara CS480 Principles of Data Management 16 Spring 2013 Merging clusters (threshold = 0.7) Cluster 1 3 1 0.9 6 0.9 7 0.9 0.7 8 4 0.9 0.8 5 0.8 2 11 0.7 Evaluating Detection Success Cluster 2 0.8 10 0.9 9 12 0.7 Cluster 3...
View Full Document

This note was uploaded on 02/11/2014 for the course CS 480 taught by Professor Staff during the Spring '08 term at Colorado State.

Ask a homework question - tutors are online