# Clustering - The Data Ensemble MCQs Solution | TCS Fresco Play

Disclaimer: The primary purpose of providing this solution is to assist and support anyone who are unable to complete these courses due to a technical issue or a lack of expertise. This website's information or data are solely for the purpose of knowledge and education.

Make an effort to understand these solutions and apply them to your Hands-On difficulties. (It is not advisable that copy and paste these solutions).

All Question of the MCQs Present Below for Ease Use Ctrl + F with the question name to find the Question. All the Best!

1. Members of the same cluster are far away / distant from each other .

False

2. What is a preferred distance measure while dealing with sets ?

Jaccard Distance

3.Unsupervised learning focuses on understanding the data and its underlying pattern.

True

4. Each point is a cluster in itself. We then combine the two nearest clusters into one. What type of clustering does this represent ?

Agglomerative

5. Which learning is the method of finding structure in the data without labels.

Unsupervised

6. ___________ of two points is the average of the two points in Eucledian Space.

Centroid

7. A centroid is a valid point in a non-Eucledian space .

False

8. What is the overall complexity of the the Agglomerative Hierarchical Clustering ?

O(N^3) O(N2 logN)

9. The ______ is a visual representation of how the data points are merged to form clusters.

Dendogram

10. ___________ measures the goodness of a cluster

Cohesion

11. ___________ is the data point that is closest to the other point in the cluster.

Clusteroid

12. _____________ is when points don't move between clusters and centroids stabilize.

Convergence

13. Sampling is one technique to pick the initial k points in K Means Clustering

True

14. Hierarchical Clustering is a suggested approach for Large Data Sets

False

15. K Means algorithm assumes Eucledian Space/Distance

True

16. The number of rounds for convergence in k means clustering can be lage

True

17. ___________ is a way of finding the k value for k means clustering.

cross validation

18. Each Round----- O(NK)

n=points

k=clusters

`If you have any queries, please feel free to ask on the comment section.If you want MCQs and Hands-On solutions for any courses, Please feel free to ask on the comment section too.Please share and support our page!`