Question

In k-NN algorithm, given a set of training examples and the value of k < size of training set (n), the algorithm predicts the class of a test example to be the
A) Most frequent class among the classes of k closest training examples.
B) Least frequent class among the classes of k closest training examples.
C) Class of the closest point.
D) Most frequent class among the classes of the k farthest training examples.

Answer 1

A. Most frequent class among the classes of k closest training examples.

Answer 2

The correct answer to this question is Option A-  Most frequent class among the classes of k closest training examples.

In k-NN classification, the algorithm predicts a class membership.

An object is classified by the majority vote of its neighbors, with the object being assigned to the class most common among its k nearest neighbors, where k is a positive integer.