adaboost(二）程序

#include <iostream>
#include <vector>
#include <math.h>
using namespace std;
typedef struct node
{
int sample_x;
int sample_y;
double  weight;
}train_sample;
double  minnum;
int minsplit(train_sample* attstring,int num)
{


  int flag=NULL;
  double* parr=new double[num];
  for(int v=0;v<num;v++)
  {
 parr[v]=0;
  }
  for(int i=0;i<=10;i++)
  {
 int cout=0;
      for(int j=0;j<10;j++)
 {
         if(attstring[j].sample_x<i)
{
flag=-1;
if(attstring[j].sample_y==flag)
//cout++;
parr[i]=parr[i]+attstring[j].weight;
}
else
{
flag=1;
if(attstring[j].sample_y==flag)
    parr[i]=parr[i]+attstring[j].weight;
}
 }
 //parr[i]=cout;
  }
  double bb=parr[0];
  int rr=NULL;
  for(int k=0;k<num;k++)
  {
if(parr[k]<bb)
{
       bb=parr[k];
  minnum=bb;
  rr=k;
}
  }
  return rr;
}
void main()
{
    int num;
//输入样本的个数
cin>>num;
//样本值
    train_sample* sample_arr=new train_sample[num];
for(int k=0;k<num;k++)
{
int x=NULL;
int y=NULL;
cin>>x>>y;
sample_arr[k].sample_x=x;
sample_arr[k].sample_y=y;
sample_arr[k].weight=1/num;
}
//寻找分类错误率最小的边界数 
double* a=new double[num];
for(int t=0;t<num;t++)
{
a[t]=0.0;
}
double* Z=new double[num];
for(int n=0;n<num;n++)
{
Z[n]=0.0;
}
int* Garr=new int[num];
for(int s=0;s<num;s++)
{
Garr[s]=0;
}
for(int f=0;f<3;f++)
{
 int num_edge=minsplit(sample_arr,num+1);
 Garr[f]=num_edge;
 //double error_num=(num-minnum)*1.0/num;
 a[f]=0.5*(log(1.0-minnum))/log(minnum);
 for(int l=0;l<num;l++)
 {
 int flag_c=l<num_edge?1:-1;
 double s_num=-a[f]*sample_arr[l].sample_y*flag_c;
 double p_c=sample_arr[l].weight*exp(s_num);
          Z[f]=Z[f]+p_c;
 }
      for(int u=0;u<num;u++)
 {
          int flag_b=u<num_edge?1:-1;
 double s_num=-a[f]*sample_arr[u].sample_y*flag_b;
 sample_arr[u].sample_y=sample_arr[u].sample_y*s_num/Z[f];
 }
}
double sum=0.0;
int flag_num;
cin>>flag_num;
int pp;
for(int r=0;r<3;r++)
{
  pp=flag_num<Garr[r]?1:-1;
       sum=sum+a[r]*pp;
}
if(sum>=0)
cout<<"输出为:1"<<endl;
else
cout<<"输出为:-1"<<endl;


}