CME 250 Homework 4 Part 1
Sign in to Google to save your progress. Learn more
Email *
SUNetID *
K-means Clustering
True or false: Two runs of k-means will always produce the same clusters and assignments.
1 point
Clear selection
Select all that apply. K-means clustering will NOT work well on recovering clusters that:
1 point
Hierarchical Clustering
Which of the following could result in producing different dendrograms on the same dataset? Assume we are using a bottom-up (agglomerative) algorithm.
1 point
Select the dendrogram built using complete-linkage on the following 1-dimensional dataset.
1 point
Captionless Image
Clear selection
What is the most appropriate number of clusters for the dataset represented by the following dendrogram?
1 point
Captionless Image
Clear selection
Dimensionality Reduction
Which of the following is true about PCA?
1 point
Consider 3 data points in 2D space: (-1, -1), (0, 0), (1, 1). What is the first principal component of the data?
1 point
Clear selection
Decision Trees
What is the minimum number of recursive binary splits needed to classify the following dataset of 6 samples with 100% accuracy?
1 point
Captionless Image
Compared to a decision tree, random forests:
1 point
Clear selection
You have a dataset of 1000 observations and 300 features. You train a random forest to perform binary classification and observe a training accuracy of 1.00 and a validation accuracy of 0.63. Which of the following would be a reasonable next step to improve the model?
1 point
Overall Homework Feedback
How satisfied are you with Part 1 (multiple choice) of the homeworks?
Not at all satisfied
Very satisfied
Clear selection
How satisfied are you with Parts 2+3 (coding) of the homeworks?
Not at all satisfied
Very satisfied
Clear selection
Any additional feedback is welcome. Thanks!
Submit
Clear form
Never submit passwords through Google Forms.
This form was created inside of Stanford University. Report Abuse