Database - Data Mining

Avatto > > UGC NET COMPUTER SCIENCE > > PRACTICE QUESTIONS > > Database > > Data Mining

61. You have been given the following 2 statements. Find out which of these options is/are true in case of k-NN?
1. In case of very large value of k, we may include points from other classes into the neighborhood.
2. In case of too small value of k, the algorithm is very sensitive to noise.

Answer
Comment
Array

Option : C
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

62. Suppose you are given the following images (1 represents the left image, 2 represents the middle and 3 represents the right). Now your task is to find out the value of k in k-NN in each of the images shown below. Here k1 is for 1^st, k2 is for 2^nd and k3 is for 3^rd figure.

Answer
Comment
Array

Option : C
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

63. Which of the following necessitates feature reduction in machine learning?

Answer
Comment
Array

Option : D
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

64. Suppose, you have given the following data where x and y are the 2 input variables and Class is the dependent variable.

x	y	Class
-1	1	-
0	1	+
0	2	-
1	-1	-
1	0	+
1	2	+
2	2	-
2	3	+

Below is a scatter plot which shows the above data in 2D space.

Suppose, you want to predict the class of new data point x=1 and y=1 using Eucledian distance in 3-NN. In which class this data point belong to?

Answer
Comment
Array

Option : A
Explanation :
All three nearest point are of +class so this point will be classified as +class.

You must be logged in to post a comment.

You must be logged in to post a comment.

65. What are the optimum number of principal components in the below figure?

Answer
Comment
Array

Option : C
Explanation :

You must be logged in to post a comment.

You must be logged in to post a comment.

Related Quiz.
Data Mining

Forgot your password?

I agree with the Terms.