Data Mining Week-7 | NPTEL
- Get link
- X
- Other Apps
ANSWERS
1. a
2. d
3. a
4. d
5. a
6. b
7. d
8. a
9. b
10. c
Week 7 : Assignment 7
Due date: 2023-03-15, 23:59 IST.
Assignment not submitted
1 point
Which of the following statement is NOT true about clustering?
1 point
Which of the following clustering technique start with the points as individual clusters and, at each step, merge the closest pair of clusters
1 point
DBSCAN is a___________ algorithm
1 point
The Euclidean distance matrix between four 2-dimensional points, p1, p2, p3, and p4, is shown below. A possible set of co-ordinate values of these points are:
1 point
The leaves of a dendogram in hierarchical clustering represent?
1 point
Distance between two clusters in complete linkage clustering is defined as:
1 point
Consider a set of five 2-dimensional points p1=(0, 0), p2=(5, 0), p3=(5, 1), p4=(0, 1), and p5=(0, 0.5). Euclide-an distance is the distance function. Single linkage clustering is used to cluster the points into two clusters. The clusters are:
1 point
Consider a set of five 2-dimensional points p1=(0, 0), p2=(5, 0), p3=(5, 1), p4=(0, 1), and p5=(0, 0.5). Euclide-an distance is the distance function. Complete linkage clustering is used to cluster the points into two clus-ters. The clusters are:
1 point
Consider a set of five 2-dimensional points p1=(0, 0), p2=(5, 0), p3=(5, 1), p4=(0, 1), and p5=(0, 0.5). Euclidean distance is the distance function. The k-means algorithm is used to cluster the points into two clusters. The initial cluster centers are p1 and p5. The clusters after two iterations of k-means are:
1 point
Given a set of seven 2-dimensional points p1=(0, 0), p2=(5, 0), p3=(5, 1), p4=(0, 1), p5=(0, 0.5), p6=(0, 9), and p7=(5.5, 1). Euclidean distance is the distance function. The DBSCAN algorithm is used to cluster the points. Epsilon = 1, and MinPts = 2 is used for DBSCAN. The clusters and outliers obtained are:
- Get link
- X
- Other Apps
Comments
Post a Comment