You are on page 1of 3

S No

1
2
3
4
5
6
7
8
9
11
12
13
14
15
16
18
19
23
27
28
32
33
35
36
38
Questions
Members of the same cluster are far away / distant from each other .
unsupervised learning focuses on understanding the data and its underlying pattern.
Each point is a cluster in itself. We then combine the two nearest clusters into one. What type of clustering doe
What is a preferred distance measure while dealing with sets ?
Which learning is the method of finding structure in the data without labels.
__________ measures the goodness of a cluster
A centroid is a valid point in a non-Eucledian space .
___________ of two points is the average of the two points in Eucledian Space.
The ______ is a visual representation of how the data points are merged to form clusters.
___________ is the data point that is closest to the other point in the cluster.
Sampling is one technique to pick the initial k points in K Means Clustering
The number of rounds for convergence in k means clustering can be lage
Hierarchical Clustering is a suggested approach for Large Data Sets
__________ is a way of finding the k value for k means clustering.
What is the R Function to divide a dataset into k clusters ?
K Means algorithm assumes Eucledian Space/Distance
What is the R function to apply hierarchical clustering to a matrix of distance objects ?
____________ of a set of points is defined using a distance measure .
A centroid is a valid point in a non-Eucledian space .
What is the overall complexity of the the Agglomerative Hierarchical Clustering ?
_____________ is when points don't move between clusters and centroids stabilize.
___________ is a way of finding the k value for k means clustering.
Sampling is one technique to pick the initial k points in K Means Clustering
K Means algorithm assumes Eucledian Space/Distance
What is the R function to apply hierarchical clustering to a matrix of distance objects ?
Answers
0
1
Agglomerative
Jaccard
Unsupervised
Cohesion
0
Centroid
Dendogram
Clusteroid
1
1
0
Cross
Kmeans
1
None
Similarity
0
O(N^3)
Convergence
Cross Validation
1
1
hclust()

You might also like