#include "stdafx.h"
#include <iostream>
#include <fstream>
#include <sstream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <cmath>
 
using namespace std;
 
//樣本特征結(jié)構(gòu)體
struct sample
{
 string type;
 vector<double> features;
};
 
//讀取訓(xùn)練樣本train.txt，訓(xùn)練樣本格式：類(lèi)型名+特征向量
void readTrain(vector<sample>& train, const string& file)
{
 ifstream fin(file.c_str()); //file是存儲(chǔ)希望讀寫(xiě)的文件名的string對(duì)象，fin是讀的流
 if(!fin)
 {
 cerr<<"Unable to open the input file: "<<file<<endl;
 exit(1);
 }
 
 string line; 
 double d=0.0;
 while(getline(fin,line)) //fin是讀入流，getline從輸入流fin讀入一行到line
 {
 istringstream stream(line); //bind to stream to the line we read
 sample ts;
 stream>>ts.type;
 while(stream>>d) //read a word from line
 {
  ts.features.push_back(d); //在trains.features的末尾添加一個(gè)值為d的元素
 }
 train.push_back(ts); //在train的末尾添加一個(gè)值為ts的元素
 }
 fin.close();
}
 
//讀取測(cè)試樣本test.txt，每行都是一個(gè)特征向量
void readTest(vector<sample>& test, const string& file)
{
 ifstream fin(file.c_str());
 if(!fin)
 {
 cerr<<"Unable to open the input file: "<<file<<endl;
 exit(1);
 }
 
 string line;
 double d=0.0;
 while(getline(fin,line))
 {
 istringstream stream(line); //bind to stream to the line we read
 sample ts;
 while(stream>>d)
 {
  ts.features.push_back(d);
 }
 test.push_back(ts);
 }
 fin.close();
}
 
//輸出結(jié)果，為每一個(gè)向量賦予一個(gè)類(lèi)型，寫(xiě)入result.txt中
void writeResult(const vector<sample>& test, const string& file)
{
 ofstream fout(file.c_str());
 if(!fout)
 {
 cerr<<"Unable to write the input file: "<<endl;
 exit(1);
 }
 
 for(vector<sample>::size_type i=0;i!=test.size();++i)
 {
 fout << test[i].type << '\t';
 for(vector<double>::size_type j=0;j!=test[j].features.size();++j)
 {
  fout<<test[i].features[j]<<' ';
 }
 fout<<endl;
 }
}
 
//KNN算法的實(shí)現(xiàn)
void knnProcess(vector<sample>& test, const vector<sample>& train, const vector<vector<double> >& dm, unsigned int k)
{
 for (vector<sample>::size_type i = 0; i != test.size(); ++i)
 {
 multimap<double, string> dts; //保存與測(cè)試樣本i距離最近的k個(gè)點(diǎn)
 
 for (vector<double>::size_type j = 0; j != dm[i].size(); ++j)
 {
  if (dts.size() < k) //把前面k個(gè)插入dts中
  {
  dts.insert(make_pair(dm[i][j], train[j].type)); //插入時(shí)會(huì)自動(dòng)排序，按dts中的double排序，最小的排在最后
  }
  else
  {
  multimap<double, string>::iterator it = dts.end();
  --it;
 
  if (dm[i][j] < it->first) //把當(dāng)前測(cè)試樣本i到當(dāng)前訓(xùn)練樣本之間的歐氏距離與dts中最小距離比較，若更小就更新dts
  {
   dts.erase(it);
   dts.insert(make_pair(dm[i][j], train[j].type));
  }
  }
 }
 map<string, double> tds;
 string type = "";
 double weight = 0.0;
 //下面for循環(huán)主要是求出與測(cè)試樣本i最鄰近的k個(gè)樣本點(diǎn)中大多數(shù)屬于的類(lèi)別，即將其作為測(cè)試樣本點(diǎn)i的類(lèi)別
 for (multimap<double, string>::const_iterator cit = dts.begin(); cit != dts.end(); ++cit)
 {
  // 不考慮權(quán)重的情況，在 k 個(gè)樣例中只要出現(xiàn)就加 1
  // ++tds[cit->second];
 
  // 這里是考慮距離與權(quán)重的關(guān)系，距離越大權(quán)重越小
  tds[cit->second] += 1.0 / cit->first;
  if (tds[cit->second] > weight)
  {
  weight = tds[cit->second];
  type = cit->second; //保存一下類(lèi)別
  }
 }
 test[i].type = type;
 }
}
 
// 計(jì)算歐氏距離
double euclideanDistance(const vector<double>& v1, const vector<double>& v2)
{
 if(v1.size() != v2.size())
 {
 cerr<<"Unable to get a distance! "<<endl;
 }
 
 else
 {
 double distance = 0.0;
 
 for (vector<double>::size_type i = 0; i != v1.size(); ++i)
 {
  distance += (v1[i] - v2[i]) * (v1[i] - v2[i]);
 }
 return sqrt(distance);
 }
}
 
/*初始化距離矩陣，該矩陣是根據(jù)訓(xùn)練樣本和測(cè)試樣本而得，
矩陣的行數(shù)為測(cè)試樣本的數(shù)目，列數(shù)為訓(xùn)練樣本的數(shù)目，
每一行為一個(gè)測(cè)試樣本到各個(gè)訓(xùn)練樣本之間的歐式距離組成的數(shù)組*/
void initDistanceMatrix(vector<vector<double> >& dm, const vector<sample>& train, const vector<sample>& test)
{
 for (vector<sample>::size_type i = 0; i != test.size(); ++i)
 {
 vector<double> vd;
 for (vector<sample>::size_type j = 0; j != train.size(); ++j)
 {
  vd.push_back(euclideanDistance(test[i].features, train[j].features));
 }
 dm.push_back(vd);
 }
}
 
//封裝
void xfxKnn(const string& file1, const string& file2, const string& file3, int k)
{
 vector<sample> train,test;
 readTrain(train, file1.c_str());
 readTest(test, file2.c_str());
 vector< vector<double> > dm;
 initDistanceMatrix(dm, train, test);
 knnProcess(test, train, dm, k);
 writeResult(test, file3.c_str());
}
 
// 測(cè)試
int main()
{
 xfxKnn("train.txt", "test.txt", "result.txt", 5);
 return 0;
}