SlideShare a Scribd company logo
CLUSTER ANALYSIS
CASE STUDY OF TIBETIAN SKULLS
A.W.D. UDAYA SHALIKA
158888L
Overview
• What is cluster analysis?
• Why Cluster Analysis
• Clustering Methods
• Analysis
Background of Data
Objectives
Hierarchical Clustering
K mean Clustering
Validation
What is cluster analysis?
• What this means?
When plotted geometrically,
objects within clusters should be
very close together and clusters
will be far apart.
• Clusters should exhibit high
internal homogeneity and high
external heterogeneity
Cluster analysis is a multivariate data mining technique whose goal is to
groups objects based on a set of user selected characteristics
Why Cluster Analysis
Cluster analysis is a major tool in a number of applications in many fields
of Business, Engineering & etc.(The odoridis and Koutroubas, 1999):
• Data reduction.
• Hypothesis generation.
• Hypothesis testing.
• Prediction based on groups.
Cluster Analysis – Classification
Clustering
Hierarchical clustering
Divisive
Agglomerative
Partitional clustering
K-means
Fuzzy K-means
Isodata
Density based
clustering
Denclust
CLUPOT
SVC
Parzen-
Watershed
Grid based clustering
STING
CLIQUE
Background Story
• These data, collected by Colonel L.A. Waddel, were
first reported in Morant (1923) . The data consist of
five measurements on each of 32 skulls found in the
southwestern and eastern districts ofTibet.
• The first comprises skulls 1 to 17 found in graves in
Sikkim and the neighboring area of Tibet (Type A
skulls). The remaining 15 skulls (Type B skulls) were
picked up on a battlefield in the Lhasa district and
are believed to be those of native soldiers from the
eastern province of Khams.
Objective
Hypothesis test:
Tibetans from Khams might be survivors of a particular human type,
unrelated to the Mongolian and Indian types that surrounded them.
• Greatest length of skull (Length)
• Greatest horizontal breadth of skull (Breadth)
• Height of skull (Height)
• Upper face length (Fheight)
• Face breadth between outermost points of cheekbones (Fbreadth)
Matrix Plot
Preliminary graphical display of the data
might be useful and here we will display
them as a scatter plot matrix in which
group membership is indicated. While this
diagram only allows us to asses the group
separation in two dimensions, it seems to
suggest that face breadth between outer-
most points of cheek bones (Fbreadth),
greatest length of skull (Length), and
upper face length (Fheight) provide the
greatest discrimination between the two
skull types
Descriptive / Correlations
Highest mean is 179.94 in Length of skull which
varying in between 200 (max) and 162.5(min).
lowest mean is 72.94 in Fheight which varying in
between 82.5 to 62.
As per the correlation matrix there are high
correlation among Length and
Fheight(0.755,p=0.00). Other than that Fheight
and Fbreadth (0.617,0.00), Length and
Fbreadth(0.567,0.01), Breadth and
Fbreadth(0.549,0.01) are significant
Number of clusters
The correct choice of number of clusters is often ambiguous, with interpretations
depending on the shape and scale of the distribution of points in a data set and the
desired clustering resolution of the user
• The rules of thumb is k=(n/2)^1/2 : where k is the number of clusters
• Plotting % of variance vs number of clusters
• In our case number of clusters is 2
Hierarchical Clustering
• Agglomerative (Bottom-up):
Principle: compute the Distance-Matrix between all objects (initially
one object = one cluster). Find the two clusters with the closest
distance and put those two clusters into one. Compute the new
Distance-Matrix
Hierarchical Clustering contd.
• data were analyzed under different linkage measurements vs squared
Euclidian distance methods
SUMMARYTABLE
Linkage Distance Cluster 1 Cluster 2 Cluster 1 Cluster 2
A B A B
Average Squared Euclidian A-6 A-11, B-15 35% 0% 65% 100%
Centroid Squared Euclidian A-6 A-11, B-15 35% 0% 65% 100%
Complete Squared Euclidian A-14, B-5 A-3, B-10 82% 33% 18% 67%
Single Squared Euclidian A-17, B-14 B-1 100% 93% 0% 7%
Ward Squared Euclidian A-16, B-5 A-1, B-10 94% 33% 6% 67%
Hierarchical Clustering Contd.
Complete Linkage Squared Euclidean Ward Linkage Squared Euclidean
Complete Linkage Squared Euclidean Ward Linkage Squared Euclidean
The Dendrogram displays the information in the amalgamation table in the form of a tree
diagram. The first table summarizes each cluster by the number of observations, the within
cluster sum of squares, In general, a cluster with a small sum of squares is more compact than
one with a large sum of squares. The centroid is the vector of variable means for the
observations in that cluster and is used as a cluster midpoint. The second table displays the
centroids for the individual clusters while the third table gives distances between cluster
centroids.
Partitional Clustering
• K-mean
Case Number Type Cluster Case Number Type Cluster
1 A 1 17 A 2
2 A 2 18 B 1
3 A 2 19 B 2
4 A 2 20 B 1
5 A 2 21 B 1
6 A 2 22 B 1
7 A 2 23 B 2
8 A 2 24 B 1
9 A 2 25 B 1
10 A 2 26 B 1
11 A 2 27 B 1
12 A 2 28 B 1
13 A 2 29 B 2
14 A 1 30 B 1
15 A 2 31 B 1
16 A 2 32 B 2
K Mean Contd. Cluster Membership
K Mean Clustering Contd.
Out of 17 of A-type skulls 15 skulls present in one cluster(88.2%).
Out of 15 skulls 11 B-type skulls present in another cluster (77.3%).
The output of K-mean clustering quite better than the out put of
ward and complete in hierarchical clustering.
Cluster Validation
• Fisher’s Linear Discriminant Analysis
• Use discriminant analysis to classify observations into two or more
groups if you have a sample with known groups. Discriminant
analysis can also used to investigate how variables contribute to
group separation.
• For two groups, the null hypothesis is that the means of the two
groups on the discriminant function-the centroids, are equal.
• Centroids are the mean discriminant score for each group. Wilk’s
lambda is used to test for significant differences between groups
Cluster Validation contd.
The canonical relation is a correlation between
the discriminant scores and the levels of the
dependent variable. A high correlation (0.825)
indicates a function that discriminates well.
Wilks’ Lambda is the ratio of within-groups sums
of squares to the total sums of squares. Wilks'
lambda is a measure of how well each function
separates cases into groups. Smaller values of
Wilks' lambda indicate greater discriminatory
ability of the function. The associated
significance value indicate whether the
difference is significant. Here, the Lambda of
0.319 and significant p= 0.00)thus, the group
means appear to significantly different from
each other
Cluster Validation contd.
This table is used to assess how well the
discriminant function works, and if it works equally
well for each group of the dependent variable.
Here cross validated accuracy is about 87.5% and
this is quite good result
Summary
• Out of 17 of A-type skulls 16 skulls present in one cluster(94%). Out of
15 skulls 10 B-type skulls present in another cluster (67%) according to
Ward linkage hierarchical clustering
• Out of 17 of A-type skulls 15 skulls present in one cluster(88.2%). Out
of 15 skulls 11 B-type skulls present in another cluster (77.3%)
according to K-mean clustering
• Group means appear to significantly different from each other
according to discriminant analysis
• Thus Tibetans from Khams district significantly different from
generalTibetans according to the skull measurements
References
• Joseph F. Hair Jr.,Willim C. Black, Barry J. Babin, Rolph E. Anderson –
“Multivariate Data Analysis – a global perspective”
• Brian S. Everitt ,Sabine Landau “Cluster Analysis” 5th edition
• Mo'oamin M. R. El-Hanjouri , Bashar S. Hamad “Using Cluster Analysis
and Discriminant Analysis Methods in Classification with Application on
Standard of Living Family in Palestinian Areas” International Journal of
Statistics and Applications,2015
Appendix
THANKYOU
19/3/2017
A.W.D Udaya Shalika
158888L

More Related Content

ODP
Machine Learning with Decision trees
PPTX
Database ,14 Parallel DBMS
PPT
Clustering
PPT
Data mining :Concepts and Techniques Chapter 2, data
PPTX
Distributed DBMS - Unit 5 - Semantic Data Control
PPT
OLAP technology
PPTX
CART – Classification & Regression Trees
PPTX
Machine Learning with Decision trees
Database ,14 Parallel DBMS
Clustering
Data mining :Concepts and Techniques Chapter 2, data
Distributed DBMS - Unit 5 - Semantic Data Control
OLAP technology
CART – Classification & Regression Trees

What's hot (20)

PPTX
Models of Distributed System
PDF
NOSQL- Presentation on NoSQL
PPTX
Cluster Analysis
PPTX
Singular Value Decomposition (SVD).pptx
PPTX
Big data architecture
PPT
K mean-clustering algorithm
PDF
Introduction to Recurrent Neural Network
PPT
4.2 spatial data mining
PPSX
Parallel Database
PPTX
Deep Learning - RNN and CNN
PPT
Cluster analysis
PPTX
Data mining Measuring similarity and desimilarity
PPTX
IoT Enabling Technologies
PPTX
Data cubes
PPT
PPTX
Introduction to Distributed System
PDF
Hierarchical clustering
PDF
Deep Learning Frameworks slides
PPTX
Machine learning clustering
PPTX
Indexing structure for files
Models of Distributed System
NOSQL- Presentation on NoSQL
Cluster Analysis
Singular Value Decomposition (SVD).pptx
Big data architecture
K mean-clustering algorithm
Introduction to Recurrent Neural Network
4.2 spatial data mining
Parallel Database
Deep Learning - RNN and CNN
Cluster analysis
Data mining Measuring similarity and desimilarity
IoT Enabling Technologies
Data cubes
Introduction to Distributed System
Hierarchical clustering
Deep Learning Frameworks slides
Machine learning clustering
Indexing structure for files
Ad

Similar to Cluster Validation (20)

PPTX
Cluster analysis
PPTX
Pm m23 & pmnm06 week 3 lectures 2015
PPTX
PPTX
Cluster Analysis
PPTX
Microarray and its application
PPTX
Cluster analysis
PPTX
Clusteranalysis 121206234137-phpapp01
PPTX
Clusteranalysis
PPTX
Read first few slides cluster analysis
PDF
Ch 4 Cluster Analysis.pdf
PPTX
datamining-lect8a-amachinelearningapproach.pptx
PPTX
MODULE 4_ CLUSTERING.pptx
PPTX
Data Mining Lecture_8(a).pptx
PPTX
TYPES OF CLUSTERING.pptx
PDF
Statistics.pdf
PPTX
Unsupervised Learning-Clustering Algorithms.pptx
PPTX
Cluster analysis
PPT
ClustIII.ppt
PPTX
Automatic Visualization
Cluster analysis
Pm m23 & pmnm06 week 3 lectures 2015
Cluster Analysis
Microarray and its application
Cluster analysis
Clusteranalysis 121206234137-phpapp01
Clusteranalysis
Read first few slides cluster analysis
Ch 4 Cluster Analysis.pdf
datamining-lect8a-amachinelearningapproach.pptx
MODULE 4_ CLUSTERING.pptx
Data Mining Lecture_8(a).pptx
TYPES OF CLUSTERING.pptx
Statistics.pdf
Unsupervised Learning-Clustering Algorithms.pptx
Cluster analysis
ClustIII.ppt
Automatic Visualization
Ad

Recently uploaded (20)

PPTX
IB Computer Science - Internal Assessment.pptx
PPTX
MODULE 8 - DISASTER risk PREPAREDNESS.pptx
PPTX
mbdjdhjjodule 5-1 rhfhhfjtjjhafbrhfnfbbfnb
PDF
Lecture1 pattern recognition............
PPTX
DISORDERS OF THE LIVER, GALLBLADDER AND PANCREASE (1).pptx
PPTX
1_Introduction to advance data techniques.pptx
PDF
.pdf is not working space design for the following data for the following dat...
PDF
annual-report-2024-2025 original latest.
PPTX
Introduction-to-Cloud-ComputingFinal.pptx
PPTX
climate analysis of Dhaka ,Banglades.pptx
PPT
Quality review (1)_presentation of this 21
PDF
Mega Projects Data Mega Projects Data
PPTX
Microsoft-Fabric-Unifying-Analytics-for-the-Modern-Enterprise Solution.pptx
PPTX
Introduction to Basics of Ethical Hacking and Penetration Testing -Unit No. 1...
PPTX
The THESIS FINAL-DEFENSE-PRESENTATION.pptx
PPT
ISS -ESG Data flows What is ESG and HowHow
PPTX
01_intro xxxxxxxxxxfffffffffffaaaaaaaaaaafg
PDF
BF and FI - Blockchain, fintech and Financial Innovation Lesson 2.pdf
PDF
Clinical guidelines as a resource for EBP(1).pdf
IB Computer Science - Internal Assessment.pptx
MODULE 8 - DISASTER risk PREPAREDNESS.pptx
mbdjdhjjodule 5-1 rhfhhfjtjjhafbrhfnfbbfnb
Lecture1 pattern recognition............
DISORDERS OF THE LIVER, GALLBLADDER AND PANCREASE (1).pptx
1_Introduction to advance data techniques.pptx
.pdf is not working space design for the following data for the following dat...
annual-report-2024-2025 original latest.
Introduction-to-Cloud-ComputingFinal.pptx
climate analysis of Dhaka ,Banglades.pptx
Quality review (1)_presentation of this 21
Mega Projects Data Mega Projects Data
Microsoft-Fabric-Unifying-Analytics-for-the-Modern-Enterprise Solution.pptx
Introduction to Basics of Ethical Hacking and Penetration Testing -Unit No. 1...
The THESIS FINAL-DEFENSE-PRESENTATION.pptx
ISS -ESG Data flows What is ESG and HowHow
01_intro xxxxxxxxxxfffffffffffaaaaaaaaaaafg
BF and FI - Blockchain, fintech and Financial Innovation Lesson 2.pdf
Clinical guidelines as a resource for EBP(1).pdf

Cluster Validation

  • 1. CLUSTER ANALYSIS CASE STUDY OF TIBETIAN SKULLS A.W.D. UDAYA SHALIKA 158888L
  • 2. Overview • What is cluster analysis? • Why Cluster Analysis • Clustering Methods • Analysis Background of Data Objectives Hierarchical Clustering K mean Clustering Validation
  • 3. What is cluster analysis? • What this means? When plotted geometrically, objects within clusters should be very close together and clusters will be far apart. • Clusters should exhibit high internal homogeneity and high external heterogeneity Cluster analysis is a multivariate data mining technique whose goal is to groups objects based on a set of user selected characteristics
  • 4. Why Cluster Analysis Cluster analysis is a major tool in a number of applications in many fields of Business, Engineering & etc.(The odoridis and Koutroubas, 1999): • Data reduction. • Hypothesis generation. • Hypothesis testing. • Prediction based on groups.
  • 5. Cluster Analysis – Classification Clustering Hierarchical clustering Divisive Agglomerative Partitional clustering K-means Fuzzy K-means Isodata Density based clustering Denclust CLUPOT SVC Parzen- Watershed Grid based clustering STING CLIQUE
  • 6. Background Story • These data, collected by Colonel L.A. Waddel, were first reported in Morant (1923) . The data consist of five measurements on each of 32 skulls found in the southwestern and eastern districts ofTibet. • The first comprises skulls 1 to 17 found in graves in Sikkim and the neighboring area of Tibet (Type A skulls). The remaining 15 skulls (Type B skulls) were picked up on a battlefield in the Lhasa district and are believed to be those of native soldiers from the eastern province of Khams.
  • 7. Objective Hypothesis test: Tibetans from Khams might be survivors of a particular human type, unrelated to the Mongolian and Indian types that surrounded them. • Greatest length of skull (Length) • Greatest horizontal breadth of skull (Breadth) • Height of skull (Height) • Upper face length (Fheight) • Face breadth between outermost points of cheekbones (Fbreadth)
  • 8. Matrix Plot Preliminary graphical display of the data might be useful and here we will display them as a scatter plot matrix in which group membership is indicated. While this diagram only allows us to asses the group separation in two dimensions, it seems to suggest that face breadth between outer- most points of cheek bones (Fbreadth), greatest length of skull (Length), and upper face length (Fheight) provide the greatest discrimination between the two skull types
  • 9. Descriptive / Correlations Highest mean is 179.94 in Length of skull which varying in between 200 (max) and 162.5(min). lowest mean is 72.94 in Fheight which varying in between 82.5 to 62. As per the correlation matrix there are high correlation among Length and Fheight(0.755,p=0.00). Other than that Fheight and Fbreadth (0.617,0.00), Length and Fbreadth(0.567,0.01), Breadth and Fbreadth(0.549,0.01) are significant
  • 10. Number of clusters The correct choice of number of clusters is often ambiguous, with interpretations depending on the shape and scale of the distribution of points in a data set and the desired clustering resolution of the user • The rules of thumb is k=(n/2)^1/2 : where k is the number of clusters • Plotting % of variance vs number of clusters • In our case number of clusters is 2
  • 11. Hierarchical Clustering • Agglomerative (Bottom-up): Principle: compute the Distance-Matrix between all objects (initially one object = one cluster). Find the two clusters with the closest distance and put those two clusters into one. Compute the new Distance-Matrix
  • 12. Hierarchical Clustering contd. • data were analyzed under different linkage measurements vs squared Euclidian distance methods SUMMARYTABLE Linkage Distance Cluster 1 Cluster 2 Cluster 1 Cluster 2 A B A B Average Squared Euclidian A-6 A-11, B-15 35% 0% 65% 100% Centroid Squared Euclidian A-6 A-11, B-15 35% 0% 65% 100% Complete Squared Euclidian A-14, B-5 A-3, B-10 82% 33% 18% 67% Single Squared Euclidian A-17, B-14 B-1 100% 93% 0% 7% Ward Squared Euclidian A-16, B-5 A-1, B-10 94% 33% 6% 67%
  • 13. Hierarchical Clustering Contd. Complete Linkage Squared Euclidean Ward Linkage Squared Euclidean
  • 14. Complete Linkage Squared Euclidean Ward Linkage Squared Euclidean The Dendrogram displays the information in the amalgamation table in the form of a tree diagram. The first table summarizes each cluster by the number of observations, the within cluster sum of squares, In general, a cluster with a small sum of squares is more compact than one with a large sum of squares. The centroid is the vector of variable means for the observations in that cluster and is used as a cluster midpoint. The second table displays the centroids for the individual clusters while the third table gives distances between cluster centroids.
  • 16. Case Number Type Cluster Case Number Type Cluster 1 A 1 17 A 2 2 A 2 18 B 1 3 A 2 19 B 2 4 A 2 20 B 1 5 A 2 21 B 1 6 A 2 22 B 1 7 A 2 23 B 2 8 A 2 24 B 1 9 A 2 25 B 1 10 A 2 26 B 1 11 A 2 27 B 1 12 A 2 28 B 1 13 A 2 29 B 2 14 A 1 30 B 1 15 A 2 31 B 1 16 A 2 32 B 2 K Mean Contd. Cluster Membership
  • 17. K Mean Clustering Contd. Out of 17 of A-type skulls 15 skulls present in one cluster(88.2%). Out of 15 skulls 11 B-type skulls present in another cluster (77.3%). The output of K-mean clustering quite better than the out put of ward and complete in hierarchical clustering.
  • 18. Cluster Validation • Fisher’s Linear Discriminant Analysis • Use discriminant analysis to classify observations into two or more groups if you have a sample with known groups. Discriminant analysis can also used to investigate how variables contribute to group separation. • For two groups, the null hypothesis is that the means of the two groups on the discriminant function-the centroids, are equal. • Centroids are the mean discriminant score for each group. Wilk’s lambda is used to test for significant differences between groups
  • 19. Cluster Validation contd. The canonical relation is a correlation between the discriminant scores and the levels of the dependent variable. A high correlation (0.825) indicates a function that discriminates well. Wilks’ Lambda is the ratio of within-groups sums of squares to the total sums of squares. Wilks' lambda is a measure of how well each function separates cases into groups. Smaller values of Wilks' lambda indicate greater discriminatory ability of the function. The associated significance value indicate whether the difference is significant. Here, the Lambda of 0.319 and significant p= 0.00)thus, the group means appear to significantly different from each other
  • 20. Cluster Validation contd. This table is used to assess how well the discriminant function works, and if it works equally well for each group of the dependent variable. Here cross validated accuracy is about 87.5% and this is quite good result
  • 21. Summary • Out of 17 of A-type skulls 16 skulls present in one cluster(94%). Out of 15 skulls 10 B-type skulls present in another cluster (67%) according to Ward linkage hierarchical clustering • Out of 17 of A-type skulls 15 skulls present in one cluster(88.2%). Out of 15 skulls 11 B-type skulls present in another cluster (77.3%) according to K-mean clustering • Group means appear to significantly different from each other according to discriminant analysis • Thus Tibetans from Khams district significantly different from generalTibetans according to the skull measurements
  • 22. References • Joseph F. Hair Jr.,Willim C. Black, Barry J. Babin, Rolph E. Anderson – “Multivariate Data Analysis – a global perspective” • Brian S. Everitt ,Sabine Landau “Cluster Analysis” 5th edition • Mo'oamin M. R. El-Hanjouri , Bashar S. Hamad “Using Cluster Analysis and Discriminant Analysis Methods in Classification with Application on Standard of Living Family in Palestinian Areas” International Journal of Statistics and Applications,2015

Editor's Notes

  • #5: Hypothesis generation. Cluster analysis is used here in order to infer some hypotheses concerning the data. For instance we may find in a retail database that there are two significant groups of customers based on their age and the time of purchases. Then, we may infer some hypotheses for the data, that it, “young people go shopping in the evening”, “old people go shopping in the morning”. Hypothesis testing. In this case, the cluster analysis is used for the verification of the validity of a specific hypothesis. For example, we consider the following hypothesis: “Young people go shopping in the evening”. One way to verify whether this is true is to apply cluster analysis to a representative set of stores. Suppose that each store is represented by its customer’s details (age, job etc) and the time of transactions. If, after applying cluster analysis, a cluster that corresponds to “young people buy in the evening” is formed, then the hypothesis is supported by cluster analysis.