1 / 18

Clustering

Clustering. Introduction K-means clustering Hierarchical clustering: COBWEB. Outline. Classification vs. Clustering. Classification: Supervised learning: Learns a method for predicting the instance class from pre-labeled (classified) instances. Clustering. Unsupervised learning:

britanni-fields
Download Presentation

Clustering

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Clustering

  2. Introduction K-means clustering Hierarchical clustering: COBWEB Outline

  3. Classification vs. Clustering Classification: Supervised learning: Learns a method for predicting the instance class from pre-labeled (classified) instances

  4. Clustering Unsupervisedlearning: Finds “natural” grouping of instances given un-labeled data

  5. Clustering Methods • Many different method and algorithms: • For numeric and/or symbolic data • Deterministic vs. probabilistic • Exclusive vs. overlapping • Hierarchical vs. flat • Top-down vs. bottom-up

  6. d e a c j h k b f i g Clusters: exclusive vs. overlapping Simple 2-Drepresentation Non-overlapping Venn diagram Overlapping

  7. Clustering Evaluation • Manual inspection • Benchmarking on existing labels • Cluster quality measures • distance measures • high similarity within a cluster, low across clusters

  8. Simple Clustering: K-means Works with numeric data only • Pick a number (K) of cluster centers (at random) • Assign every item to its nearest cluster center (e.g. using Euclidean distance) • Move each cluster center to the mean of its assigned items • Repeat steps 2,3 until convergence (change in cluster assignments less than a threshold)

  9. Y k1 k2 k3 X K-means example, step 1 Pick 3 initial cluster centers (randomly)

  10. Y k1 k2 k3 X K-means example, step 2 Assign each point to the closest cluster center

  11. Y k1 k2 k2 k1 k3 k3 X K-means example, step3 Move each cluster center to the mean of each cluster

  12. Y k1 k2 k3 X K-means example, step 4 Reassign points closest to a different new cluster center Q: Which points are reassigned?

  13. Y k1 k3 k2 X K-means example, step 4 … A: three points with animation

  14. Y k1 k3 k2 X K-means example, step 4b re-compute cluster means

  15. Y k2 k1 k3 X K-means example, step 5 move cluster centers to cluster means

  16. initial cluster centers instances Discussion • Result can vary significantly depending on initial choice of seeds • Can get trapped in local minimum • Example: • To increase chance of finding global optimum: restart with different random seeds

  17. Advantages Simple, understandable items automatically assigned to clusters Disadvantages Must pick number of clusters before hand All items forced into a cluster Too sensitive to outliers K-means clustering summary

  18. K-means variations • K-medoids – instead of mean, use medians of each cluster • Mean of 1, 3, 5, 7, 9 is • Mean of 1, 3, 5, 7, 1009 is • Median of 1, 3, 5, 7, 1009 is • Median advantage: not affected by extreme values • For large databases, use sampling 5 205 5

More Related