Unsupervised learning focuses on understanding the data and its underlying pattern.
True
Which learning is the method of finding structure in the data without labels
Unsupervised
of a set of points is defined using a distance measure .
Similarity
What is a preferred distance measure while dealing with sets
Jaccard
Each point is a cluster in itself. We then combine the two nearest clusters into one. What
type of clustering does this represent ?
Agglomerative
___ of two points is the average of the two points in Eucledian Space.
Centroid
___ measures the goodness of a cluster
Cohesion
The ______ is a visual representation of how the data points are merged to form clusters.
Dendogram
A centroid is a valid point in a non-Eucledian space .
False
What is the overall complexity of the the Agglomerative Hierarchical Clustering ?
O(N^3)
The number of rounds for convergence in k means clustering can be lage
True
___ is a way of finding the k value for k means clustering.
Cross Validation
K Means algorithm assumes Eucledian Space/Distance
True
Sampling is one technique to pick the initial k points in K Means Clustering
True
What is the R function to apply hierarchical clustering to a matrix of distance objects ?
hclust()
_____________ is when points don't move between clusters and centroids stabilize.
Convergence
What is the R Function to divide a dataset into k clusters ?
kclusters()
