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

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.

主站蜘蛛池模板: 通山县| 佛山市| 崇文区| 长武县| 梨树县| 柳林县| 会东县| 绥阳县| 应城市| 石城县| 宁化县| 金乡县| 赣州市| 竹溪县| 含山县| 邮箱| 清水县| 沁水县| 龙州县| 赤城县| 青海省| 淮北市| 岑巩县| 梨树县| 靖安县| 桓仁| 孙吴县| 扶沟县| 凭祥市| 正镶白旗| 甘谷县| 平安县| 海安县| 吉隆县| 宜兰市| 揭阳市| 周至县| 龙海市| 雷波县| 微博| 布尔津县|