Digital Clustering - The Data Ensemble_FP | Fresco Play Course Answer | Course ID 55938

 

Q 1. K Means algorithm assumes Eucledian Space/Distance

A. False

B. True

Answer: B

Q 2. ____________ of a set of points is defined using a distance measure .

A. Similarity

B. None of the options

C. Dissimilarity

D. Adjacency

Answer: A

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

A. None of the Options

B. Dendogram

C. Scatter Plot

D. Graph

Answer: B

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

A. True

B. False

Answer: B

Q 5. ___________ of two points is the average of the two points in Eucledian Space.

A. Centroid

B. Central Tendency

C. Center

D. None of the Options

Answer: A

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

A. Supervised

B. Unsupervised

C. Active

D. Passive

Answer: B

Q 7. What is the R Function to divide a dataset into k clusters ?

A. None of the Options

B. kclusters()

C. kmeans()

D. clusters()

Answer: C

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

A. Affinity Point

B. Clusteroid

C. None of the Options

D. Closure Point

Answer: B

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

A. Jaccard

B. Cosine

C. Manhattan

D. Eucledian

Answer: A

Q 10. ___________ measures the goodness of a cluster

A. None of the options

B. Cohesion

C. Clusteroid

D. Centroid

Answer: B