Presentation is loading. Please wait.

Presentation is loading. Please wait.

Interface / CSNA Meeting St. Louis

Published bySusanti Budiaman Modified over 6 years ago

Similar presentations

Presentation on theme: "Interface / CSNA Meeting St. Louis"— Presentation transcript:

1 Interface / CSNA Meeting St. Louis
Estimating the Cluster Tree of a Density Werner Stuetzle Rebecca Nugent Department of Statistics University of Washington June 11, 2005 Interface / CSNA Meeting St. Louis

2 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

3 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

4 Interface / CSNA Meeting St. Louis
Groups K-means with k = 2 June 11, 2005 Interface / CSNA Meeting St. Louis

5 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

6 Interface / CSNA Meeting St. Louis
Detect that there are 5 or 6 distinct groups. Assign group labels to observations. June 11, 2005 Interface / CSNA Meeting St. Louis

7 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

8 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

9 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

10 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

11 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

12 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

13 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

14 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

15 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

16 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

17 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

18 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

19 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

20 Interface / CSNA Meeting St. Louis
rs = 1 rs = 5 rs = 2 June 11, 2005 Interface / CSNA Meeting St. Louis

21 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

22 Interface / CSNA Meeting St. Louis
Note large tree fragments in bottom left panel June 11, 2005 Interface / CSNA Meeting St. Louis

23 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

24 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

25 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

26 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

27 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

28 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

29 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

30 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

31 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

32 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

33 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

34 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

35 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

36 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

37 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

38 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

39 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

40 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

41 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

42 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

43 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

44 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

45 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

46 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

47 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

48 Interface / CSNA Meeting St. Louis
rs = 1 rs = 5 rs = 2 June 11, 2005 Interface / CSNA Meeting St. Louis

49 Interface / CSNA Meeting St. Louis
Runt Pruning algorithm: generate_cluster_tree_node (mst, runt_size_threshold) { node = new_cluster_tree_node node.leftson = node.rightson = NULL node.obs = leaves (mst) cut_edge = longest_edge_with_large_runt_size (mst, runt_size_threshold) if (cut_edge) { node.leftson = generate_cluster_tree_node (left_subtree (cut_edge), runt_size_threshold) node.rightson = generate_cluster_tree_node (right_subtree (cut_edge), runt_size_threshold) } return (node) } rs = 1 rs = 5 rs = 2 June 11, 2005 Interface / CSNA Meeting St. Louis

50 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

51 Interface / CSNA Meeting St. Louis
Note large tree fragments in bottom left panel June 11, 2005 Interface / CSNA Meeting St. Louis

52 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

53 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

54 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

55 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

56 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

57 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

58 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

59 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

60 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

61 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

62 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

63 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

64 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

65 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

66 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

67 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

68 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

69 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

70 Interface / CSNA Meeting St. Louis
June 11, 2005 Interface / CSNA Meeting St. Louis

71 Interface / CSNA Meeting St. Louis
Runt Pruning algorithm: generate_cluster_tree_node (mst, runt_size_threshold) { node = new_cluster_tree_node node.leftson = node.rightson = NULL node.obs = leaves (mst) cut_edge = longest_edge_with_large_runt_size (mst, runt_size_threshold) if (cut_edge) { node.leftson = generate_cluster_tree_node (left_subtree (cut_edge), runt_size_threshold) node.rightson = generate_cluster_tree_node (right_subtree (cut_edge), runt_size_threshold) } return (node) } rs = 1 rs = 5 rs = 2 June 11, 2005 Interface / CSNA Meeting St. Louis

Download ppt "Interface / CSNA Meeting St. Louis"

Similar presentations

Chapter 5: Tree Constructions

Chapter 5: Tree Constructions
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.
18-Dec-14 Pruning. 2 Exponential growth How many leaves are there in a complete binary tree of depth N? This is easy to demonstrate: Count “going left”

18-Dec-14 Pruning. 2 Exponential growth How many leaves are there in a complete binary tree of depth N? This is easy to demonstrate: Count “going left”
Top left is avg Ch for 09Z during June 2002. Top right is same but using MYJSFC from WRFv3.0 Bottom left is same but using MYJSFC from WRFv3.1 Bottom right.

Top left is avg Ch for 09Z during June Top right is same but using MYJSFC from WRFv3.0 Bottom left is same but using MYJSFC from WRFv3.1 Bottom right.
A Separate Analysis Approach to the Reconstruction of Phylogenetic Networks Luay Nakhleh Department of Computer Sciences UT Austin.

A Separate Analysis Approach to the Reconstruction of Phylogenetic Networks Luay Nakhleh Department of Computer Sciences UT Austin.
O(N 1.5 ) divide-and-conquer technique for Minimum Spanning Tree problem Step 1: Divide the graph into  N sub-graph by clustering. Step 2: Solve each.

O(N 1.5 ) divide-and-conquer technique for Minimum Spanning Tree problem Step 1: Divide the graph into  N sub-graph by clustering. Step 2: Solve each.
CS 112 - Fall 2012, Lab 08 Haohan Zhu. Boston University Slideshow Title Goes Here CS 112 - Fall 2012, Lab 08 2 4/17/2015 Tree - Data Structure  Basic.

CS Fall 2012, Lab 08 Haohan Zhu. Boston University Slideshow Title Goes Here CS Fall 2012, Lab /17/2015 Tree - Data Structure  Basic.
Detecting Malicious Flux Service Networks through Passive Analysis of Recursive DNS Traces Roberto Perdisci, Igino Corona, David Dagon, Wenke Lee ACSAC.

Detecting Malicious Flux Service Networks through Passive Analysis of Recursive DNS Traces Roberto Perdisci, Igino Corona, David Dagon, Wenke Lee ACSAC.
1 abstract containers hierarchical (1 to many) graph (many to many) first ith last sequence/linear (1 to 1) set.

1 abstract containers hierarchical (1 to many) graph (many to many) first ith last sequence/linear (1 to 1) set.
Speech Recognition Training Continuous Density HMMs Lecture Based on:

Speech Recognition Training Continuous Density HMMs Lecture Based on:
Department of Computer Science University of Maryland, College Park

Department of Computer Science University of Maryland, College Park
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.
1 Trees. 2 Outline –Tree Structures –Tree Node Level and Path Length –Binary Tree Definition –Binary Tree Nodes –Binary Search Trees.

1 Trees. 2 Outline –Tree Structures –Tree Node Level and Path Length –Binary Tree Definition –Binary Tree Nodes –Binary Search Trees.
233-234233-234 Sedgewick & Wayne (2004); Chazelle (2005) Sedgewick & Wayne (2004); Chazelle (2005)

Sedgewick & Wayne (2004); Chazelle (2005) Sedgewick & Wayne (2004); Chazelle (2005)
Insert 2000 0 1 1 0 0 1 0 0 0 A tree starts with the dummy node D 0 0 0 0 0 0 0 0 0 0 D 200 D 7 Insert 1000 0 0 1 1 0 0 1 0 0 100 D 6 200 7.

Insert A tree starts with the dummy node D D 200 D 7 Insert D
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,
24-Jun-15 Pruning. 2 Exponential growth How many leaves are there in a complete binary tree of depth N? This is easy to demonstrate: Count “going left”

24-Jun-15 Pruning. 2 Exponential growth How many leaves are there in a complete binary tree of depth N? This is easy to demonstrate: Count “going left”
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;
4/17/2017 Section 9.3 Tree Traversal ch9.3.

4/17/2017 Section 9.3 Tree Traversal ch9.3.

Similar presentations

Ads by Google