0% found this document useful (0 votes)
34 views

Nptel Notes 4

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
34 views

Nptel Notes 4

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

Q) What is the primary purpose of the k -nearest neighbor (KNN) algorithm?

A. Classification
B. Regression
C. Clustering
D. Dimensionality Reduction

Q) In KNN, what does "k" represent?


A. The number of clusters
B. The number of features
C. The number of neighbors to consider
D. The number of iterations

Q) How does KNN handle categorical data?


A. It cannot handle categorical data
B. It treats categorical data as continuous values
C. It uses specialized distance metrics for categorical data
D. It ignores categorical features during classification

Q) In KNN, what distance metric is commonly used for continuous numerical


features?

A. Euclidean distance
B. Cosine similarity
C. Hamming distance
D. Jaccard similarity
Q) What is the "curse of dimensionality" in the context of KNN?

A. The model is too simple


B. The model is too complex
C. Increased computational complexity as the number of features grows
D. The model's inability to handle high-dimensional data

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

Q) How does the k-means algorithm initialize cluster centroids?

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

Q) What is the objective function that k-means tries to minimize during


clustering?
A. Sum of squared differences between data points
and centroids
B. Entropy
C. Mean absolute error
D. F1-score

What is the key assumption made by k -means clustering regarding cluster


shapes?
A. Clusters can have any arbitrary shape
B. Clusters are spherical and equally sized
C. Clusters are linearly separable
D. Clusters have the same density

Q) What is the role of the elbow method in k-means clustering?


A. To determine the number of clusters
B. To compute the final cluster assignments
C. To calculate the silhouette score
D. To measure the Davies-Bouldin index

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

Q) You are comparing the performance of two k-means clustering solutions.


Solution A has a WCSS of 800, and Solution B has a WCSS of 700.
Which solution is likely to be better?
A. Solution A
B. Solution B
C. Both solutions are equally good
D. More information is needed to determine

You might also like