Professional Documents
Culture Documents
Data Mining Quiz 1 Clustering
Data Mining Quiz 1 Clustering
Correct Answer
Marks: 1/1
Silhouettescore = (p−q)/max(p,q)
p = mean distance to the points in the nearest cluster & q = mean intra-cluster distance to all the
points.
You Selected
p = mean distance to the points in the farthest cluster & q = mean intra-cluster distance to all the
points.
p = mean distance to the points in the nearest cluster & q = sum of the intra-cluster distance of all the
points.
p = mean distance to the points in the farthest cluster & q = sum of the intra-cluster distance of all
the points.
Q No: 2
Correct Answer
Marks: 1/1
At p=2, the Minkowski distance will resemble which type of distance measure?
Euclidean Distance
You Selected
Manhattan Distance
Chebyshev Distance
Q No: 3
Correct Answer
Marks: 1/1
Calculate Euclidean Distance for between below points:
p1= [2,3]
p2= [4,5]
2.626
3.100
2.423
2.828
You Selected
Euclidean Distance:
(2,3)
(4,5)
Q No: 4
Correct Answer
Marks: 1/1
0.4164
0.5478
0.4069
You Selected
0.3209
Q No: 5
Correct Answer
Marks: 1/1
Calculate the Manhattan distance between Point P1(4,4) and P2(9,9)?
10
You Selected
(5,5)
Manhattan Distance:
(4,4) (9,9)
d= |(x2-x1)|+|(y2-y1)|
d= |(9-4)|+|(9-4)| = 5+5=10
Q No: 6
Correct Answer
Marks: 1/1
Agglomerative clustering algorithm is generating 2 different dendrograms. What among the following
could be the possibilities for it to occur?
Correct Answer
Marks: 1/1
Agglomerative Clustering will start by considering all points as part of one big cluster
True
False
You Selected
Agglomerative Clustering starts by considering all points as individual clusters
Q No: 8
Correct Answer
Marks: 3/3
1102.32
1694.33
1895.25
You Selected
2123.10
kmeans = KMeans(n_clusters=4,random_state=0)
km=kmeans.fit(dataset_scaled)
print('The within sum of squared for 4 clusters is',round(km.inertia_,2))