How does KNN decide a label?

It finds the k nearest neighbors of a new point and takes a majority vote of their labels. It measures closeness by distance.

How do I check a KNN classifier?

Confirm there is one predicted label per row of X_test, and that the neighbor count k is actually used.

What libraries does this problem use?

Python, numpy, and scikit-learn. Rather than implementing a distance function yourself, you use scikit-learn's built-in KNN classifier, training only on the training data.

classify by nearest neighbors

Your task

Grouping similar data to predict a new point's label is called classification. KNN is the most intuitive classifier: it looks at the k nearest neighbors of a new point and takes a majority vote for the label. Complete knn_predict(X_train, y_train, X_test, k). X_train, y_train training features and labels. X_test new data whose labels you must predict. k the number of neighbors to consult. Train scikit-learn's KNN and return the predicted label for each row of X_test as an array. Example Given training data split into two groups, a new point is predicted as the label of the nearer group.

Ground rules

•X_train and X_test are 2-D float arrays; y_train is a label array.
•train only on X_train and y_train.

Not required

•hyperparameter search or cross-validation.
•implementing a distance function yourself.

▶About this challenge

This challenge asks you to complete a function that trains scikit-learn's KNN (nearest-neighbors) classifier and returns a predicted label for each row of new data as an array. It takes training features and labels, the new data to predict, and the neighbor count k, and trains only on the training data. It practices the fundamentals of a classification model that judges by distance.

KNN looks at the k nearest neighbors of a new point and takes a majority vote — a classification method grounded in distance. This problem implements KNN with scikit-learn and verifies the result against the actual numbers.

How does KNN decide a label?: It finds the k nearest neighbors of a new point and takes a majority vote of their labels. It measures closeness by distance.
How do I check a KNN classifier?: Confirm there is one predicted label per row of X_test, and that the neighbor count k is actually used.
What libraries does this problem use?: Python, numpy, and scikit-learn. Rather than implementing a distance function yourself, you use scikit-learn's built-in KNN classifier, training only on the training data.

classify by nearest neighbors

Your task

Ground rules

•X_train and X_test are 2-D float arrays; y_train is a label array.
•train only on X_train and y_train.

Not required

•hyperparameter search or cross-validation.
•implementing a distance function yourself.

▶About this challenge

How does KNN decide a label?: It finds the k nearest neighbors of a new point and takes a majority vote of their labels. It measures closeness by distance.
How do I check a KNN classifier?: Confirm there is one predicted label per row of X_test, and that the neighbor count k is actually used.
What libraries does this problem use?: Python, numpy, and scikit-learn. Rather than implementing a distance function yourself, you use scikit-learn's built-in KNN classifier, training only on the training data.