Which of the following is NOT a common supervised learning model/algorithm?

All the listed algorithms—K-nearest neighbors (KNN), Random Forest, and Decision Trees—are canonical examples of supervised learning. In supervised learning, the algorithm learns from a labeled dataset, meaning each data point is tagged with a correct output or target. KNN uses proximity to make classifications or predictions. Decision Trees create a model of decisions based on feature values, and Random Forest is an ensemble of multiple decision trees. Since all are supervised learning models, none of them is "NOT" a supervised learning model.

A. K-nearest neighbors is a classic supervised learning algorithm used for both classification and regression tasks based on labeled data points.

B. Random forest is a widely used supervised ensemble learning method that builds multiple decision trees from labeled training data.

C. Decision trees are a fundamental type of supervised learning algorithm that learns decision rules from features in labeled data.

D. This option is incorrect because it falsely claims that all the listed algorithms are not supervised learning models.

1. Hastie, T., Tibshirani, R., & Friedman, J. (2009). The Elements of Statistical Learning: Data Mining, Inference, and Prediction. Springer. (See Chapter 9 for Decision Trees/Random Forest, Chapter 13 for KNN).

2. Abu-Mostafa, Y. S., Magdon-Ismail, M., & Lin, H. T. (2012). Learning from Data. AMLBook. (Section 1.1, "The Learning Problem," introduces supervised learning with examples).

3. Stanford University, CS229: Machine Learning Course Notes. (Lecture notes on Supervised Learning cover Decision Trees, KNN, and ensemble methods like Random Forests).