knn.rar_K._K近邻算法_knn vc

void CDMDlg::OnButtonKnn() { result_knn.clear(); double distance[K],tempdistance,tempmax; CString tempstr,tempstr2; int indexmax; int K2=0,i,j,k; for(k=0;k<K;k++) distance[k]=0; ReadTestData(); ReadTrainData(); CStdioFile File_result("D:\\DM\\data\\result_knn.txt",CFile::modeWrite|CFile::modeCreate); for(i=0;i<test.size();i++)//找train中离test[i]最近的K个Sample { K2=0; TempK.clear(); for(j=0;j<train.size();j++) { tempdistance=Distance(test[i],train[j]); if(K2<K) { distance[K2]=tempdistance; TempK.push_back(train[j]); //TempK[K2]=test[j];注意错误 K2++; } else { for(k=0;k<K;k++)//是否存在比当前距离小的 { if(tempdistance<distance[k]) { break; } } if(k!=K)//找distance[K]中最大的替换 { tempmax=distance[0]; indexmax=0; for(k=1;k<K;k++) { if(tempmax<distance[k]) { indexmax=k; tempmax=distance[k]; } } distance[indexmax]=tempdistance; TempK[indexmax]=train[j]; } } } //计数 int tempTcount=0,tempFcount=0; for(k=0;k<TempK.size();k++) { if(TempK[k].category=="true") tempTcount++; else tempFcount++; } File_result.SeekToEnd(); if(tempTcount>=tempFcount) { result_knn.push_back(true); test[i].result="true"; tempstr=""; for(j=0;j<dimension;j++) { tempstr2.Format("%.2f,",test[i].feature[j]); tempstr+=tempstr2; } //File_result.WriteString(tempstr+"true\n"); File_result.WriteString("true\n"); } else { result_knn.push_back(false); test[i].result="false"; tempstr=""; for(j=0;j<dimension;j++) { tempstr2.Format("%.2f,",test[i].feature[j]); tempstr+=tempstr2; } //File_result.WriteString(tempstr+"false\n"); File_result.WriteString("false\n"); } } File_result.Close(); output(test,"test"); AfxMessageBox("成功"); }