NPTEL Introduction To Machine Learning IITKGP ASSIGNMENT 8
These are solutions for NPTEL Introduction To Machine Learning IITKGP ASSIGNMENT 8 Week 8
Course Name: Introduction To Machine Learning IITKGP
Link to Enroll: Click Here
1) For two runs of K-Mean clustering is it expected to get same clustering results?
A. Yes
B. No
Answer: A
2) Which of the following can act as possible termination conditions in K-Means?
I. For a fixed number of iterations.
II Assignment of observations to clusters does not change between iterations. Except for cases with a bad local minimum.
III Centroids do not change between successive iterations.
IV. Terminate when RSS falls below a threshold
A) I, III and IV
B) I, II and III
C) I, II and IV
D) All of the above
Answer: D) All of the above
These are solutions for NPTEL Introduction To Machine Learning IITKGP ASSIGNMENT 8 Week 8
3) After performing K-Means Clustering analysis on a dataset, you observed the following dendrogram. Which of the following conclusion can be drawn from the dendrogram?
A) There were 28 data points in clustering analysis.
B) The best no. of clusters for the analysed data points is 4.
C) The proximity function used is Average-link clustering.
D) The above dendrogram interpretation is not possible for K-Means clustering analysis.
Answer: D) The above dendrogram interpretation is not possible for K-Means clustering analysis.
4) What should be the best choice of no. of clusters based on the following results :
A. 1
B. 2
C. 3
D. 4
Answer: C. 3
These are solutions for NPTEL Introduction To Machine Learning IITKGP ASSIGNMENT 8 Week 8
5) Given, six points with the following attributes :
Which of the following clustering representations and dendrogram depicts the use of MIN or Single link proximity function in hierarchical clustering :
Answer: A
6) Is it possible that assignment of observations to clusters does not change between successive iterations of K-means?
A) Yes
B) No
C) Can’t say
D) None of these
Answer: A) Yes
7) What is the possible reason(s) for producing two different dendograms using agglomerative clustering for the same data set?
A) Proximity function
B) No. of data points
C) Variables used
D) All of these
Answer: D) All of these
These are solutions for NPTEL Introduction To Machine Learning IITKGP ASSIGNMENT 8 Week 8
8) Which of the following algorithms suffer from the problem of convergence at local optima?
I) K-means clustering
II) Agglomerative clustering
III) Expectation-minimization clustering
IV) Divisive clustering
A) I and II
B) II and III
C) III nad IV
D) I and III
Answer: D) I and III
9) Which of the following is/are valid iterative strategy before performing clustering analysis for treating missing values?
A) Imputation with mean
B) Nearest neighbour assignment
C) Imputation with expectation-maximization algorithm
D) None of these
Answer: C) Imputation with expectation-maximization algorithm
10) If two variables V1 and V2 are used for clustering, which of the following is/are true with K means clustering algorithm for K=3?
I) If V1 and V2 have a correlation of 1, cluster centroid will be in a straight line.
II) If V1 and V2 have a correlation of 0, cluster centroid will be in a straight line.
A) I only
B) II only
C) I and II
D) None of these
Answer: A) I only
These are solutions for NPTEL Introduction To Machine Learning IITKGP ASSIGNMENT 8 Week 8
More weeks solution of this course: https://progies.in/answers/nptel/introduction-to-machine-learning
More NPTEL Solutions: https://progies.in/answers/nptel
| The content uploaded on this website is for reference purposes only. Please do it yourself first. |
