Presentation is loading. Please wait.

Presentation is loading. Please wait.

Cluster Analysis Hierarchical and k-means. Expression data Expression data are typically analyzed in matrix form with each row representing a gene and.

Similar presentations


Presentation on theme: "Cluster Analysis Hierarchical and k-means. Expression data Expression data are typically analyzed in matrix form with each row representing a gene and."— Presentation transcript:

1 Cluster Analysis Hierarchical and k-means

2 Expression data Expression data are typically analyzed in matrix form with each row representing a gene and each column representing a chip or sample.

3 Expression data We represent the data matrix by the symbol X and denote the data as follows:

4 Clustering on transposition of X

5 Filtering The first step in analyzing microarray data is to filter out genes that are not expressed or do not show variation across sample types. –always remove from the analyses the rows corresponding to genes that were not expressed on any of the chips. –For example, if gene chips are used to analyze tumor and normal tissues, the two groups can be compared using t-statistics calculated for each gene.

6 Normalization for Clustering Normalizing a gene across samples is accomplished by subtracting from each expression level the mean of the expression levels for that gene and then dividing by the standard deviation of that gene. Calculate the mean and standard deviation of the gene of interest:

7 Normalized expression values

8 Distance Measures

9 Distance Matrix

10 Hierarchical Clustering Average Linkage Algorithm (unweighted centroid clustering)

11 Example: A distance matrix of 4 genes the first step merges genes A and B whose distance is 1.58. The distances are updated as follows: –Replace the two genes A and B by the midpoint (AB) between them and recalculate the distance of gene C to this midpoint (d(AB, C) = 2.85) and gene D to this midpoint (d(AB, D) = 4.81). Note that d(C, D) = 2.7 is unchanged.

12

13 Differences between clustering methods For example, in Figure 3A the first merging clustered genes A and B and the distance of this new cluster to gene D was d(AB, D) = 4.81. For single linkage, the distance would be d(AB, D) = 4.74 and for complete linkage the distance would be d(AB, D) = 5.

14 Heat Maps The heat map presents a grid of colored points where each color represents a gene expression value in the sample.

15 Heat Map Example The grid coordinates correspond to the sample by gene combinations. In this case, the columns (samples) are tumors, some from patients who have relapsed and some from patients who have not relapsed. The rows represent 348 genes found to distinguish the patients according to their relapse status. Ordering determined by hierarchical clustering

16 Software for Clustering and HeatMaps Eisen first has developed a powerful clustering and visualization tool for microarray data You can download it from the following website http://rana.lbl.gov/EisenSoftware.htm

17 Cluster Clusters filtered microarray datasets using different methods. Need to upload data (rows, genes; columns conditions; gene expression values)

18 Cluster

19 Adjust Data

20 Cluster Data

21 TreeView To visualize the clustering result as a heatmap. Load the.cdt file created by Cluster package and visualize coexpressed genes (red upregulated and green down regulated in the condition of interest; median centered dataset)


Download ppt "Cluster Analysis Hierarchical and k-means. Expression data Expression data are typically analyzed in matrix form with each row representing a gene and."

Similar presentations


Ads by Google