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.

mymoshishibie.cpp
mymoshishibie.dsp
mymoshishibie.dsw
mymoshishibie.ncb
mymoshishibie.opt
mymoshishibie.plg
iris.txt

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．