Scribd
Upload
29 views1 page

Week 8

The document outlines the course structure for a clustering algorithms unit, detailing weekly lectures and assignments related to K-Means and hierarchical clustering. It includes questions and answers regarding the sensitivity of K-Means to initialization and outliers, as well as clustering algorithm characteristics. Several questions indicate incorrect answers, suggesting a focus on understanding clustering techniques and their applications.

Uploaded by

KANNAN MANI
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
29 views1 page

Week 8

The document outlines the course structure for a clustering algorithms unit, detailing weekly lectures and assignments related to K-Means and hierarchical clustering. It includes questions and answers regarding the sensitivity of K-Means to initialization and outliers, as well as clustering algorithm characteristics. Several questions indicate incorrect answers, suggesting a focus on understanding clustering techniques and their applications.

Uploaded by

KANNAN MANI
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 1
Tar mee reviewer3@npteL.itim.ac.in Unit 10 - Week 8 Course outline How to access the portal ‘Wook o Assignment 0 Wook 2 weak 2 week 3 Week 4 Week 5 Week 6 Week? Week & Lscure a: Irodction ‘cusienng Lecue 42: kmeans ‘Clustering Lect 43: Agglomerane Hierarchical ‘clusienng Lecue 44: Pynon Exereise on Kmeans ‘cuusieng eo Tucrials Week8-Lecture ows: (Qua: Assignment a Feedback For Week a [Assignment Solution Downioad Videos Live Session Assignment 8 ‘The due date for submiting this assignment has passed. Due on 2019-09-25, 23:59 IST. [As per our records you have nat submitted this assignment. 3) What is true about k Mean Clustering? 2 points 1. Kemeans is extremely sensitive to cluster center 2. Bad initialization can lead to Poor convergence speed 3. Bad initialization can lead to bad overall clustering Land? land 3 All of the above 2and3 No, tne ansuer is incoeet. Sere 0 Accepted Answers: 2)_In which of the following cases will K-Means clustering fail to give good results? (Choose all 2 points the correct answers} Data points with outliers Data points with round shapes Data points with non-convex shapes Data points with different densities . ‘ No, tne answer isincoeet. Score: 0 ‘Accepted Answers: S soe ‘Which of the following clustering algorithms suffers from the problem of convergence at 2points local optima?? (Choose all the correct answers) 1. K- Means clustering algorithm. 2. gglomerative clustering algorithm. 3. Expectation-Maximization clustering algorithm 4. Diverse clustering algorithm 1 2 3 No, the answer isincomeet Scare 0 ‘Accepted Answers 4 2 4) Inthe figure below, if you draw 3 horizontal line on y-axis for y=2. What will be the 2 points number of clusters formed? o No the answer is incoect. Sere: 0 ‘Accopted Answers: > '5) Assume, you want to cluster 7 observations into 3 clusters using K-Means clustering 2 points algorithm. After first iteration the clusters: C1, C2, C3 has the following observations: 4: (1,1), (4,4), (7,7)} 22: {(0,4), (4.0)} (5,5), (9.9) ‘What will be the cluster centroids if you want to proceed for second iteration? 2: (44), C2: (2.2), C2: (7.7), Ci: (2.2), €2: (0.0), C3: (5,5) C4: (66), C2: (4,4), C3: (9,9) None of these o Np, the answer is incomes Sere: 0 ‘Accepted Answers: 6) Following Question 5, what will be the Manhattan distance for observation (9, 9) from 2 points cluster centroid Clin the second iteration? a. 10 bs « 6 47 o No, tne answer isincoeet. Score’ 0 ‘Accepted Answers: 7) Iftwo variables V1 and V2 are used for clustering. Which of the following are trueforK- 2 polnts 2 means clustering with k. 1. IFV1 and V2 has a correlation of 1, the cluster centroids will be in a straight line 2. IFV1 and V2 has a correlation of 0, the cluster centroids will be in straight line Choose the correct anewer? Only 20nly Both Land 2 None of the above . ‘ No, the answer isincomeet Score’ 0 Accepted Anawers: 8) Which of the following is not a clustering approach? 2 points Hierarchical Partitioning Bagging Density-Based . ‘ No, tne answer is ncoect. Secie:0 Accepted Answers 9% 2 points Given six points with the following attributes: pout [x woordinate | y coordinate pi_[ 0-405 0.5006 2 02uas O3851 3 0.3457. 0.3156 pt _| 02652 O85 ps] 00780 0.139 vo | oss 0.3022 Table : X-¥ coorinates of six points. |e | Pe pi | 0.0000 | 0.2357 | 0.2218 02317 p2 | 0.2357 | 0.0000 | 0.1483 0.2540 3 (0.1483 [0.0000 0.1100 pt 02092 [0.1513 0.2216 PB 0.1988 | 0.2843 Pé 0.1100 Which of the following clustering representations and dendrogram dey use of MIN or Single link proximity function in hierarchical clustering: _ —— >. . ’ No, the answer is inooeet. Scie 0 Accepted Answers: 10) Which of the following clustering algorithms is the most sensitive to outliers? 2 points 2. _K-means clustering algorithm b. K-medians clustering algorithm c. K-modes clustering algorithm d. None of the above o Np, the answer is incomes Sere: 0 ‘Accepted Answers:

You might also like