Description: 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.
To Search:
File list (Check if you may need any files):
mymoshishibie.cpp
mymoshishibie.dsp
mymoshishibie.dsw
mymoshishibie.ncb
mymoshishibie.opt
mymoshishibie.plg
iris.txt
Download