模式识别中用于完成数据的分类而用到的一种方法-k近邻。是将已有数据划分到3个类中，本方法中解决数据Iris数据的划分问题。将150个4维数据划分到3类。K近邻法是求最近的K个元素从而将其划分到已有类中。-Pattern recognition for the completion of the classification of the data used in a way-k neighbors. The existing data are divided into three classes, the method to solve data Iris data partitioning problem. 150 4-dimensional data is divided into three categories. K-nearest neighbor method is to seek the nearest K elements which can be divided to the existing class.