机器学习 1

1. underfitting and over-fitting

2. locally weighted regression LWR - 局部加权回归，只利用附近的点来计算，而不是全部的测试集。

3. LOESS

LOESS combines much of the simplicity of linear least squares regression with the flexibility of nonlinear regression.

4. it's a bad idea to use linear regression for classification.  

logistic regression.

5. K-D tree see http://en.wikipedia.org/wiki/K-d_tree

In computer science, a k-d tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space. k-d trees are a useful data structure for several applications, such as searches involving a multidimensional search key (e.g. range searches and nearest neighbor searches). k-d trees are a special case of binary space partitioning trees.