官术网_书友最值得收藏!

K-Nearest Neighbors

KNN is a simple model for regression and classification tasks. It is so simple that its name describes most of its learning algorithm. The titular neighbors are representations of training instances in a metric space. A metric space is a feature space in which the distances between all members of a set are defined. In the previous chapter's pizza problem, our training instances were represented in a metric space because the distances between all the pizza diameters was defined. These neighbors are used to estimate the value of the response variable for a test instance. The hyperparameter k specifies how many neighbors can be used in the estimation. A hyperparameter is a parameter that controls how the algorithm learns; hyperparameters are not estimated from the training data and are sometimes set manually. Finally, the k neighbors that are selected are those that are nearest to the test instance, as measured by some distance function.

For classification tasks, a set of tuples of feature vectors and class labels comprise the training set. KNN is a capable of binary, multi-class, and multi-label classification; we will define these tasks later, and we will focus on binary classification in this chapter. The simplest KNN classifiers use the mode of the KNN labels to classify test instances, but other strategies can be used. The k is often set to an odd number to prevent ties. In regression tasks, the feature vectors are each associated with a response variable that takes a real-valued scalar instead of a label. The prediction is the mean or weighted mean of the KNN response variables.

主站蜘蛛池模板: 伊通| 富源县| 古田县| 韶山市| 芒康县| 花莲市| 金塔县| 上林县| 新郑市| 伊吾县| 揭阳市| 台湾省| 龙门县| 新田县| 巴青县| 保山市| 黎川县| 合江县| 渝中区| 东平县| 榆中县| 壶关县| 原平市| 浦东新区| 海门市| 图木舒克市| 北安市| 师宗县| 崇礼县| 晋江市| 长子县| 宜君县| 龙口市| 望城县| 茌平县| 巨野县| 闻喜县| 阿拉尔市| 霸州市| 库伦旗| 临猗县|