Nearest-Neighbor Methods(ESL读书笔记)
Nearest-neighbor methods use those observations in the training set T closest in input space to x form Y-hat.
Specifically, the k-nearest neighbor fit for Y-hat is difined as follows: Y(x)=1/kΣyi,xi belong to Nk(x).
where Nk(x) is the neighborhood of x defined by the k closest points xi in the traing sample.
Closeness implies a metric, which for the moment we assume is Euclidean distance. So, in words, we find the k observations with xi closest to x in input space, and average their responses.
1.Kernel methods use weights that decrease smoothly to zero with distance from the target point, rather than the effective 0/1 weights used by k-nearest neighbors.
2.In high-dimensional spaces the distance kernels are modified to emphasize some variable more than others.
3.Local regression fits linear models by locally weighted least squares, rather than fitting constants locally.
4.Local models fit to a basis expansion of the original inputs allow arbitrarily complex models.
5.Projection pursuit and neural network models consist of sums of nonlinearly transformed linear models.
最新文章
- Android应用底部导航栏(选项卡)实例
- dblink嵌套场景下 查询出现:ORACLE ORA-00600错误的解决
- [HTML]POST方法和GET方法
- CCNA 4.14 TP Correction
- Transaction Manager Maximum Timeout
- asp.net使用dorpdownlist绑定无限级分类
- leetcode Binary Tree Inorder Traversal python
- HDOJ 4687 Boke and Tsukkomi 一般图最大匹配带花树+暴力
- (转)MultipleOutputFormat和MultipleOutputs
- Vim编辑器显示行数
- Dynamics 365 Online-Microsoft Flow
- [SDOi2012]吊灯
- python, Image
- hive 远程管理
- delphi实现数字签名
- VB6 获取和设置默认打印机
- (转)CentOS 7 —— /etc/rc.local 开机不执行 - 解决方法
- js 基础拓展
- python2 UnicodeDecodeError: 'ascii' codec can't decode byte 0xce in position 7: ordinal not in range(128)
- [javaEE] jsp入门