Presentation is loading. Please wait.

Presentation is loading. Please wait.

February 27, 2007Stanford1 Generalized Single Linkage Clustering Werner Stuetzle Rebecca Nugent Department of Statistics University of Washington.

Published by Modified over 8 years ago

Similar presentations

Presentation on theme: "February 27, 2007Stanford1 Generalized Single Linkage Clustering Werner Stuetzle Rebecca Nugent Department of Statistics University of Washington."— Presentation transcript:

1 February 27, 2007Stanford1 Generalized Single Linkage Clustering Werner Stuetzle Rebecca Nugent Department of Statistics University of Washington

2 February 27, 2007Stanford2

3 February 27, 2007Stanford3

4 February 27, 2007Stanford4 Groups K-means with k = 2

5 February 27, 2007Stanford5

6 February 27, 2007Stanford6 Detect that there are 5 or 6 distinct groups. Assign group labels to observations.

7 February 27, 2007Stanford7

8 February 27, 2007Stanford8

9 February 27, 2007Stanford9

10 February 27, 2007Stanford10

11 February 27, 2007Stanford11

12 February 27, 2007Stanford12

13 February 27, 2007Stanford13

14 February 27, 2007Stanford14

15 February 27, 2007Stanford15

16 February 27, 2007Stanford16

17 February 27, 2007Stanford17

18 February 27, 2007Stanford18

19 February 27, 2007Stanford19

20 February 27, 2007Stanford20

21 February 27, 2007Stanford21

22 February 27, 2007Stanford22

23 February 27, 2007Stanford23

24 February 27, 2007Stanford24

25 February 27, 2007Stanford25

26 February 27, 2007Stanford26

27 February 27, 2007Stanford27

28 February 27, 2007Stanford28

29 February 27, 2007Stanford29

30 February 27, 2007Stanford30

31 February 27, 2007Stanford31 leaf.code group.id 4 6 14 15 20 21 23 44 45 1 24 0 0 0 0 0 0 0 1 2 0 0 0 0 0 0 47 0 9 3 0 0 0 0 0 0 4 78 124 4 5 0 0 1 0 0 17 0 13 5 0 0 0 0 4 61 0 0 0 6 0 0 0 0 28 5 0 0 0 7 0 3 33 14 0 0 0 0 0 8 0 0 0 48 0 1 1 0 0 9 0 51 0 0 0 0 0 0 0

32 February 27, 2007Stanford32

33 February 27, 2007Stanford33

Download ppt "February 27, 2007Stanford1 Generalized Single Linkage Clustering Werner Stuetzle Rebecca Nugent Department of Statistics University of Washington."

Similar presentations

Large Scale Water Conservation System for Multi-Unit Housing H 2 Opti ns.

Large Scale Water Conservation System for Multi-Unit Housing H 2 Opti ns.
June 11, 2005Interface / CSNA Meeting St. Louis1 Estimating the Cluster Tree of a Density Werner Stuetzle Rebecca Nugent Department of Statistics University.

June 11, 2005Interface / CSNA Meeting St. Louis1 Estimating the Cluster Tree of a Density Werner Stuetzle Rebecca Nugent Department of Statistics University.
Genetic Statistics Lectures （５） Multiple testing correction and population structure correction.

Genetic Statistics Lectures （５） Multiple testing correction and population structure correction.
Cluster Analysis Measuring latent groups. Cluster Analysis - Discussion Definition Vocabulary Simple Procedure SPSS example ICPSR and hands on.

Cluster Analysis Measuring latent groups. Cluster Analysis - Discussion Definition Vocabulary Simple Procedure SPSS example ICPSR and hands on.
Medical Imaging Mohammad Dawood Department of Computer Science University of Münster Germany.

Medical Imaging Mohammad Dawood Department of Computer Science University of Münster Germany.
Medical Imaging Mohammad Dawood Department of Computer Science University of Münster Germany.

Medical Imaging Mohammad Dawood Department of Computer Science University of Münster Germany.
Microarray Data Preprocessing and Clustering Analysis

Microarray Data Preprocessing and Clustering Analysis
Unsupervised Learning: Clustering Rong Jin Outline  Unsupervised learning  K means for clustering  Expectation Maximization algorithm for clustering.

Unsupervised Learning: Clustering Rong Jin Outline  Unsupervised learning  K means for clustering  Expectation Maximization algorithm for clustering.
Visualization of Clusters with a Density-Based Similarity Measure Rebecca Nugent Department of Statistics, Carnegie Mellon University Joint with: Werner.

Visualization of Clusters with a Density-Based Similarity Measure Rebecca Nugent Department of Statistics, Carnegie Mellon University Joint with: Werner.
1 Unsupervised Learning: Estimating the Cluster Tree of a Density by Analyzing the Minimal Spanning Tree of a Sample Werner Stuetzle Professor and Chair,

1 Unsupervised Learning: Estimating the Cluster Tree of a Density by Analyzing the Minimal Spanning Tree of a Sample Werner Stuetzle Professor and Chair,
Statistics 350 Lecture 11. Today Last Day: Start Chapter 3 Today: Section 3.8 Mid-Term Friday…..Sections 1.1-1.8; 2.1-2.7; 3.1-3.3 (READ)

Statistics 350 Lecture 11. Today Last Day: Start Chapter 3 Today: Section 3.8 Mid-Term Friday…..Sections ; ; (READ)
POSTER TEMPLATE BY: www.PosterPresentations.com Note: in high dimensions, the data are sphered prior to distance matrix calculation. Three Groups Example;

POSTER TEMPLATE BY: Note: in high dimensions, the data are sphered prior to distance matrix calculation. Three Groups Example;
An Interval MST Procedure Rebecca Nugent w/ Werner Stuetzle November 16, 2004.

An Interval MST Procedure Rebecca Nugent w/ Werner Stuetzle November 16, 2004.
Jeremy Tantrum, Department of Statistics, University of Washington joint work with Alejandro Murua & Werner Stuetzle Insightful Corporation University.

Jeremy Tantrum, Department of Statistics, University of Washington joint work with Alejandro Murua & Werner Stuetzle Insightful Corporation University.
Visualization of Clusters with a Density-Based Similarity Measure Rebecca Nugent Department of Statistics, Carnegie Mellon University June 9, 2007 Joint.

Visualization of Clusters with a Density-Based Similarity Measure Rebecca Nugent Department of Statistics, Carnegie Mellon University June 9, 2007 Joint.
APPLICATION OF K-MEANS CLUSTERING The Matlab function “kmeans()” was used for clustering The parameters to the function were : 1. The matrix of entire.

APPLICATION OF K-MEANS CLUSTERING The Matlab function “kmeans()” was used for clustering The parameters to the function were : 1. The matrix of entire.
ML ALGORITHMS. Algorithm Types Classification (supervised) Given -> A set of classified examples “instances” Produce -> A way of classifying new examples.

ML ALGORITHMS. Algorithm Types Classification (supervised) Given -> A set of classified examples “instances” Produce -> A way of classifying new examples.
August 6, 2006JSM Seattle1 Generalized Single Linkage Clustering Werner Stuetzle Rebecca Nugent Department of Statistics University of Washington.

August 6, 2006JSM Seattle1 Generalized Single Linkage Clustering Werner Stuetzle Rebecca Nugent Department of Statistics University of Washington.
Team 22 Rami Alghamdi & Ritika Jhangiani.  Baltimore County Police  Hot Spot Analysis (Frequent Crime locations)  K-Means Clustering Crime Location.

Team 22 Rami Alghamdi & Ritika Jhangiani.  Baltimore County Police  Hot Spot Analysis (Frequent Crime locations)  K-Means Clustering Crime Location.
 T/F: Correlation = causation.  T/F: In naturalistic observation, the subject is aware they are being observed.  T/F: Longitudinal studies are quicker.

 T/F: Correlation = causation.  T/F: In naturalistic observation, the subject is aware they are being observed.  T/F: Longitudinal studies are quicker.

Similar presentations

Ads by Google