Nptel Notes 4
Nptel Notes 4
A. Classification
B. Regression
C. Clustering
D. Dimensionality Reduction
A. Euclidean distance
B. Cosine similarity
C. Hamming distance
D. Jaccard similarity
Q) What is the "curse of dimensionality" in the context of KNN?
Q) You are using KNN for a regression task with "k" set to 3. The distances to the
three nearest neighbors are 2.0, 3.0, and 4.0. What will be the predicted value using
simple averaging?
A. 2.0
B. 3.0
C. 3.33
D. 3.67
What is the primary objective of the k -means clustering algorithm?
A. Classification
B. Dimensionality reduction
C. Clustering
D. Regression
A. Randomly
B. Using hierarchical clustering
C. Based on class labels
D. With gradient descent
What does "k" represent in k -means clustering?
A. The number of data points
B. The number of clusters
C. The number of features
D. The number of iterations
Given a dataset with 100 data points, if you perform k-means clustering with k = 5, how many cluster
centroids will be initialized initially?
A. 100
B. 10
C. 5
D. 1