Ungraded quiz Unit 8.

Slides:



Advertisements
Similar presentations
Aaker, Kumar, Day Seventh Edition Instructor’s Presentation Slides
Advertisements

Clustering Basic Concepts and Algorithms
PARTITIONAL CLUSTERING
 Small finger is 6, index finger is 7 middle finger 8, next 9 and up to thumb which is 10  Open palms facing you. Touch the fingers of two numbers you.
Matching Experiment Class Results. Experiment Analyzed 114 subjects after removal of subjects who completed fewer than 4 problems 8 problems 2.
Cluster Analysis.  What is Cluster Analysis?  Types of Data in Cluster Analysis  A Categorization of Major Clustering Methods  Partitioning Methods.
Discriminant Analysis Similar to Regression, except that criterion (or dependent variable) is categorical rather than continuous. -used to identify boundaries.
Cluster Validation.
What is Cluster Analysis?
Clustering. What is clustering? Grouping similar objects together and keeping dissimilar objects apart. In Information Retrieval, the cluster hypothesis.
© University of Minnesota Data Mining CSCI 8980 (Fall 2002) 1 CSci 8980: Data Mining (Fall 2002) Vipin Kumar Army High Performance Computing Research Center.
© 2013 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
Lecture 20: Cluster Validation
Clustering Algorithms k-means Hierarchic Agglomerative Clustering (HAC) …. BIRCH Association Rule Hypergraph Partitioning (ARHP) Categorical clustering.
Dimension reduction : PCA and Clustering Slides by Agnieszka Juncker and Chris Workman modified by Hanne Jarmer.
Unsupervised learning introduction
Data Science and Big Data Analytics Chap 4: Advanced Analytical Theory and Methods: Clustering Charles Tappert Seidenberg School of CSIS, Pace University.
David Corne, and Nick Taylor, Heriot-Watt University - These slides and related resources:
DATA MINING: CLUSTER ANALYSIS (3) Instructor: Dr. Chun Yu School of Statistics Jiangxi University of Finance and Economics Fall 2015.
Clustering (2) Center-based algorithms Fuzzy k-means Density-based algorithms ( DBSCAN as an example ) Evaluation of clustering results Figures and equations.
Unsupervised Learning
Survey research: Ungraded review questions
Cluster analysis Chong Ho Yu
Exploring Microarray data
Data Mining K-means Algorithm
Keyboarding True or false
Cluster analysis Chong Ho Yu
Clustering Evaluation The EM Algorithm
Ungraded quiz Unit 6.
Ungraded quiz Unit 3.
CSE 4705 Artificial Intelligence
John Nicholas Owen Sarah Smith
Ungraded quiz Unit 1.
Ungraded quiz Unit 1.
Step-By-Step Instructions for Miniproject 2
Ungraded quiz Unit 7.
Ungraded quiz Unit 5.
Clustering and Multidimensional Scaling
Ungraded quiz Unit 4.
Multivariate Statistical Methods
Using statistics to evaluate your test Gerard Seinhorst
Cluster Validity For supervised classification we have a variety of measures to evaluate how good our model is Accuracy, precision, recall For cluster.
Dimension reduction : PCA and Clustering
AP Statistics Warm-up: Problem 5.26.
Unit 4 Quiz: Review questions
Ungraded quiz Unit 8.
Ungraded quiz Unit 2.
Ungraded quiz Unit 7.
Ungraded quiz Unit 4.
Ungraded quiz Unit 3.
Ungraded quiz Unit 6.
Ungraded quiz Unit 6.
Ungraded quiz Unit 7.
Ungraded quiz Unit 1.
Cluster analysis Chong Ho Yu
Ungraded quiz Unit 5.
Ungraded quiz Unit 3.
Ungraded quiz Unit 10.
Ungraded quiz Unit 1.
Ungraded quiz Unit 4.
Ungraded quiz Unit 9.
Ungraded quiz Unit 6.
Ungraded quiz Unit 11.
Ungraded quiz Unit 1.
Unsupervised Learning
Ungraded quiz Unit 2.
Ungraded quiz Unit 3.
Ungraded quiz Unit 9.
Presentation transcript:

Ungraded quiz Unit 8

Show me your fingers Do not shout out the answer, or your classmates will follow what you said. Use your fingers One finger (the right finger) = A Two fingers = B Three fingers = C Four fingers = D No finger = I don’t know. I didn’t study

What is the difference between discriminant analysis (DA) and cluster analysis (CA)? In DA the analyst needs to assign the number of clusters in advance while CA is entirely exploratory.. DA aims to assign observations into existing groups while CA is intended to discover new grouping patterns. DA starts with a centroid but CA can start anywhere. All of the above.

Which of the following statements is true? In normal mixtures the data must be categorical. In latent class analysis the data must be continuous. In K-mean clustering the data can be continuous and categorical. Two-step clustering accepts both continuous and categorical data.

Which of the following about DBSCAN is untrue? DBSCAN is available in SAS. K-mean clustering might fail to detect a string-like clustering pattern but DBSCAN can detect any shape of clustering. DBSCAN separates concentrated data from sparse data. DBSCAN uses the elbow method to find the optimal K.

Which of the following about the elbow method is untrue? The elbow method is available in Python. The elbow plot in cluster analysis is similar to the scree plot in factor analysis. The elbow method uses the raw distances to find the optimal k.. All of the above.

Which of the following about hierarchical clustering (HC) is true? HC can be top-down or bottom-up. HC and MDS can work hand in hand if the row items and the column items are the same in a symmetrical data matrix (e.g. R1 = C1, R2 = C2…etc.). Besides grouping observations into a few clusters for data reduction, HC can also be used for matching two individuals into a pair. All of the above

Which of the following about two-step clustering is true? In two-step clustering a pre-cluster is created in step 1. In two-step clustering if the model quality index is less than 0.5, then it is considered a poor model. Two-step clustering tends to create asymmetrical clusters. All of the above.