void optimize3(int *fn, int *fp, int *groups, double *fvals, int *groupraw,int *gname,
int *ngroup, int *method, double *cooling, double *temp_start,
int *projdim, double *val, double *proj,int *r,double *lambda)
{
int n,p,g,projn,projp,maxproj,i,j,m,kt,count,*group;
double *proj_best, *projdata, *index_best,*proj_temp,*index_temp;
double temp_end,temp,cool,*sum,diff,radius;
double *index_work,*proj_work;
n = *fn; p = *fp; g = *groups;
projn = p;
projp = *projdim;
temp = *temp_start;
cool = *cooling;
temp_end = 0.001;
maxproj=1000;
group = Calloc(n,int);
zero_int(group, n);
if(gname[(g-1)] !=g)
{ for(i=0; i<n; i++)
for(j=0; j<g; j++)
if(groupraw[i] == gname[j]) group[i] = j+1;
}
else
memcpy(group,groupraw,n*sizeof(int));
/********************************/
proj_best = Calloc(projp*projn,double);zero(proj_best,projp*projn);
proj_work = Calloc(projp*projn,double);zero(proj_work,projp*projn);
proj_temp = Calloc(projp*projn,double);zero(proj_temp,projp*projn);
projdata = Calloc(projp*n,double); zero(projdata,projp*n);
index_best = Calloc(1,double);
index_work = Calloc(1,double);
index_temp = Calloc(1,double);
sum = Calloc(1,double);
/* initrandom(start); */
GetRNGstate();
iszero(fp,projdim,proj_best,sum);
if (!(*sum))
{ normal_fill1 (fp,projdim,proj_best, 1.0,proj_best);
orthonormal (proj_best,fp,projdim);
}
for(i=0; i<projp; i++)
{ for (j=0;j<n; j++)
{ projdata[i*n+j] = 0;
for (m=0; m<p; m++)
projdata[i*n+j] += proj_best[i*p+m]*fvals[m*n+j];
}
}
switch(*method)
{
case 1:
discriminant1(fn,projdim,groups,projdata,group,gname,ngroup,index_best);
break;
case 2:
discriminant2(fn,projdim,groups,projdata,group,gname,ngroup,index_best);
break;
case 3:
discriminant3(fn,projdim,groups,projdata,group,gname,ngroup,index_best,r);
break;
case 4:
cartgini(fn,projdim,groups,projdata,group,ngroup,index_best);
break;
case 5:
cartentropy(fn,projdim,groups,projdata,group,ngroup,index_best);
break;
case 6:
pda(fn,projdim,groups,projdata,group,gname,ngroup,index_work,lambda);
break;
}
kt = 1;
for(i=0; i<projp; i++)
for (m=0; m<projn; m++)
proj_work[i*p+m] = proj_best[i*p+m];
temp = 1.5/sqrt(projn+10);
count = 0;
radius = 89;
while (radius>0.6)
{
/* Step 1 */
normal_fill1 (fp,projdim,proj_temp,(0.2/log(projn+5)),proj_best);
orthonormal (proj_temp,fp,projdim);
zero(projdata,projp*n);
for(i=0; i<projp; i++)
{ for (j=0;j<n; j++)
{ for (m=0; m<p; m++)
projdata[i*n+j] += proj_temp[i*p+m]*fvals[m*n+j];
}
}
switch(*method)
{
case 1:
discriminant1(fn,projdim,groups,projdata,group,gname,ngroup,index_temp);
break;
case 2:
discriminant2(fn,projdim,groups,projdata,group,gname,ngroup,index_temp);
break;
case 3:
discriminant3(fn,projdim,groups,projdata,group,gname,ngroup,index_temp,r);
break;
case 4:
cartgini(fn,projdim,groups,projdata,group,ngroup,index_temp);
break;
case 5:
cartentropy(fn,projdim,groups,projdata,group,ngroup,index_temp);
break;
case 6:
pda(fn,projdim,groups,projdata,group,gname,ngroup,index_work,lambda);
break;
}
diff=*index_temp-*index_best;
if(diff <=0)
count++;
else
{ *index_work=*index_temp;
for(i=0;i<projp; i++)
for(j=0; j<projn; j++)
proj_work[i*projn+j] =proj_temp[i*projn+j];
}
/* Step 2 */
normal_fill1 (fp,projdim,proj_temp,temp,proj_best);
orthonormal (proj_temp,fp,projdim);
zero(projdata,projp*n);
for(i=0; i<projp; i++)
{ for (j=0;j<n; j++)
{ for (m=0; m<p; m++)
projdata[i*n+j] += proj_temp[i*p+m]*fvals[m*n+j];
}
}
switch(*method)
{
case 1:
discriminant1(fn,projdim,groups,projdata,group,gname,ngroup,index_temp);
break;
case 2:
discriminant2(fn,projdim,groups,projdata,group,gname,ngroup,index_temp);
break;
case 3:
discriminant3(fn,projdim,groups,projdata,group,gname,ngroup,index_temp,r);
break;
case 4:
cartgini(fn,projdim,groups,projdata,group,ngroup,index_temp);
break;
case 5:
cartentropy(fn,projdim,groups,projdata,group,ngroup,index_temp);
break;
case 6:
pda(fn,projdim,groups,projdata,group,gname,ngroup,index_work,lambda);
break;
}
diff=*index_temp-*index_best;
if(diff <=0)
count++;
else if(*index_temp > *index_work)
{ *index_work=*index_temp;
for(i=0;i<projp; i++)
for(j=0; j<projn; j++)
proj_work[i*projn+j] =proj_temp[i*projn+j];
}
/* Step 3 */
normal_fill1 (fp,projdim,proj_temp,temp,proj_best);
orthonormal (proj_temp,fp,projdim);
zero(projdata,projp*n);
for(i=0; i<projp; i++)
{ for (j=0;j<n; j++)
{ for (m=0; m<p; m++)
projdata[i*n+j] += proj_temp[i*p+m]*fvals[m*n+j];
}
}
switch(*method)
{
case 1:
discriminant1(fn,projdim,groups,projdata,group,gname,ngroup,index_temp);
break;
case 2:
discriminant2(fn,projdim,groups,projdata,group,gname,ngroup,index_temp);
break;
case 3:
discriminant3(fn,projdim,groups,projdata,group,gname,ngroup,index_temp,r);
break;
case 4:
cartgini(fn,projdim,groups,projdata,group,ngroup,index_temp);
break;
case 5:
cartentropy(fn,projdim,groups,projdata,group,ngroup,index_temp);
break;
case 6:
pda(fn,projdim,groups,projdata,group,gname,ngroup,index_work,lambda);
break;
}
diff=*index_temp-*index_best;
if(diff <=0)
count++;
else if(*index_temp > *index_work)
{ *index_work=*index_temp;
for(i=0;i<projp; i++)
for(j=0; j<projn; j++)
proj_work[i*projn+j] =proj_temp[i*projn+j];
}
/* Step 4 */
normal_fill1 (fp,projdim,proj_temp,temp,proj_best);
orthonormal (proj_temp,fp,projdim);
zero(projdata,projp*n);
for(i=0; i<projp; i++)
{ for (j=0;j<n; j++)
{ for (m=0; m<p; m++)
projdata[i*n+j] += proj_temp[i*p+m]*fvals[m*n+j];
}
}
switch(*method)
{
case 1:
discriminant1(fn,projdim,groups,projdata,group,gname,ngroup,index_temp);
break;
case 2:
discriminant2(fn,projdim,groups,projdata,group,gname,ngroup,index_temp);
break;
case 3:
discriminant3(fn,projdim,groups,projdata,group,gname,ngroup,index_temp,r);
break;
case 4:
cartgini(fn,projdim,groups,projdata,group,ngroup,index_temp);
break;
case 5:
cartentropy(fn,projdim,groups,projdata,group,ngroup,index_temp);
break;
case 6:
pda(fn,projdim,groups,projdata,group,gname,ngroup,index_work,lambda);
break;
}
diff=*index_temp-*index_best;
if(diff <=0)
count++;
else if(*index_temp > *index_work)
{ *index_work=*index_temp;
for(i=0;i<projp; i++)
for(j=0; j<projn; j++)
proj_work[i*projn+j] =proj_temp[i*projn+j];
}
/* final step */
if(count > projn*8)
{ radius = radius/2; temp= temp/2;
count = 0;
}
for(i=0;i<projp; i++)
for(j=0; j<projn; j++)
proj_best[i*projn+j] =proj_work[i*projn+j];
*index_best = *index_work;
kt++;
}
for(i=0;i<projp; i++)
for(j=0; j<projn; j++)
proj[i*projn+j] =proj_best[i*projn+j];
*val = *index_best;
/* printf("%d\n",kt);*/
PutRNGstate();
Free(proj_best);
Free(proj_work);
Free(proj_temp);
Free(projdata);
Free(index_work);
Free(index_best);
Free(index_temp);
Free(sum);
Free(group);
}
void optimize1(int *fn, int *fp, int *groups, double *fvals, int *groupraw,int *gname,
int *ngroup, int *method, double *cooling, double *temp_start,
int *projdim, double *val, double *proj,int *r,double *lambda)
{
int n,p,g,projn,projp,maxproj,i,j,m,kt,*group;
double *proj_best,*proj_work, *projdata,*index_work, *index_best;
double temp_end,temp,cool,*sum;
n = *fn; p = *fp; g = *groups;
projn = p;
projp = *projdim;
temp = *temp_start;
cool = *cooling;
temp_end = 0.001;
maxproj=1000;
group = Calloc(n,int);
zero_int(group, n);
if(gname[(g-1)] !=g)
{ for(i=0; i<n; i++)
for(j=0; j<g; j++)
if(groupraw[i] == gname[j]) group[i] = j+1;
}
else
memcpy(group,groupraw,n*sizeof(int));
/********************************/
proj_best = Calloc(projp*projn,double);zero(proj_best,projp*projn);
proj_work = Calloc(projp*projn,double);zero(proj_work,projp*projn);
projdata = Calloc(projp*n,double); zero(projdata,projp*n);
index_best = Calloc(1,double);
index_work = Calloc(1,double);
sum = Calloc(1,double);
/* initrandom(start); */
GetRNGstate();
iszero(fp,projdim,proj_best,sum);
if (!(*sum))
{ normal_fill1 (fp,projdim,proj_best, 1.0,proj_best);
orthonormal (proj_best,fp,projdim);
}
for(i=0; i<projp; i++)
{ for (j=0;j<n; j++)
{ projdata[i*n+j] = 0;
for (m=0; m<p; m++)
projdata[i*n+j] += proj_best[i*p+m]*fvals[m*n+j];
}
}
switch(*method)
{
case 1:
discriminant1(fn,projdim,groups,projdata,group,gname,ngroup,index_best);
break;
case 2:
discriminant2(fn,projdim,groups,projdata,group,gname,ngroup,index_best);
break;
case 3:
discriminant3(fn,projdim,groups,projdata,group,gname,ngroup,index_best,r);
break;
case 4:
cartgini(fn,projdim,groups,projdata,group,ngroup,index_best);
break;
case 5:
cartentropy(fn,projdim,groups,projdata,group,ngroup,index_best);
break;
case 6:
pda(fn,projdim,groups,projdata,group,gname,ngroup,index_best,lambda);
break;
}
kt = 0;
for(i=0; i<projp; i++)
for (m=0; m<projn; m++)
proj_work[i*p+m] = proj_best[i*p+m];
while (temp> temp_end && kt < maxproj)
{
normal_fill1 (fp,projdim,proj_work,temp,proj_best);
orthonormal (proj_work,fp,projdim);
temp *= cool;
zero(projdata,projp*n);
for(i=0; i<projp; i++)
{ for (j=0;j<n; j++)
{ for (m=0; m<p; m++)
projdata[i*n+j] += proj_work[i*p+m]*fvals[m*n+j];
}
}
switch(*method)
{
case 1:
discriminant1(fn,projdim,groups,projdata,group,gname,ngroup,index_work);
break;
case 2:
discriminant2(fn,projdim,groups,projdata,group,gname,ngroup,index_work);
break;
case 3:
discriminant3(fn,projdim,groups,projdata,group,gname,ngroup,index_work,r);
break;
case 4:
cartgini(fn,projdim,groups,projdata,group,ngroup,index_work);
break;
case 5:
cartentropy(fn,projdim,groups,projdata,group,ngroup,index_work);
break;
case 6:
pda(fn,projdim,groups,projdata,group,gname,ngroup,index_best,lambda);
break;
}
if(*index_work > *index_best)
{
for(i=0;i<projp; i++)
for(j=0; j<projn; j++)
proj_best[i*projn+j] =proj_work[i*projn+j];
*index_best = *index_work;
}
kt++;
}
/* printf("kt = %d\n",kt);*/
for(i=0;i<projp; i++)
for(j=0; j<projn; j++)
proj[i*projn+j] =proj_best[i*projn+j];
*val = *index_best;
PutRNGstate();
Free(proj_best);
Free(proj_work);
Free(projdata);
Free(index_work);
Free(index_best);
Free(sum);
Free(group);
}
void optimize2(int *fn, int *fp, int *groups, double *fvals, int *groupraw, int *gname,
int *ngroup, int *method, double *cooling, double *temp_start,
int *projdim, double *val, double *proj, double *energy,int *r,double *lambda)
{
int n,p,g,projn,projp,maxproj,i,j,m,kt,*group;
double *proj_best,*proj_work, *projdata,*index_work, *index_best;
double temp_end,temp,cool,tempp,*sum,prob,e,diff;
n = *fn; p = *fp; g = *groups;
projn = p;
projp = *projdim;
temp = *temp_start;
cool = *cooling;
temp_end = 0.001;
maxproj=1000;
group = Calloc(n,int);
zero_int(group, n);
if(gname[(g-1)] !=g)
{ for(i=0; i<n; i++)
for(j=0; j<g; j++)
if(groupraw[i] == gname[j]) group[i] = j+1;
}
else
memcpy(group,groupraw,n*sizeof(int));
/* printf("in Optimize %f\n",*var);*/
/********************************/
proj_best = Calloc(projp*projn,double);zero(proj_best,projp*projn);
proj_work = Calloc(projp*projn,double);zero(proj_work,projp*projn);
projdata = Calloc(projp*n,double); zero(projdata,projp*n);
index_best = Calloc(1,double);
index_work = Calloc(1,double);
sum = Calloc(1,double);
/* initrandom(start); */
GetRNGstate();
iszero(fp,projdim,proj_best,sum);
if (!(*sum))
{ normal_fill1 (fp,projdim,proj_best, 1.0,proj_best);
orthonormal (proj_best,fp,projdim);
}
for(i=0; i<projp; i++)
{ for (j=0;j<n; j++)
{ projdata[i*n+j] = 0;
for (m=0; m<p; m++)
projdata[i*n+j] += proj_best[i*p+m]*fvals[m*n+j];
}
}
switch(*method)
{
case 1:
discriminant1(fn,projdim,groups,projdata,group,gname,ngroup,index_best);
break;
case 2:
discriminant2(fn,projdim,groups,projdata,group,gname,ngroup,index_best);
break;
case 3:
discriminant3(fn,projdim,groups,projdata,group,gname,ngroup,index_best,r);
break;
case 4:
cartgini(fn,projdim,groups,projdata,group,ngroup,index_best);
break;
case 5:
cartentropy(fn,projdim,groups,projdata,group,ngroup,index_best);
break;
case 6:
pda(fn,projdim,groups,projdata,group,gname,ngroup,index_best,lambda);
break;
}
kt = 1;
for(i=0; i<projp; i++)
for (m=0; m<projn; m++)
proj_work[i*p+m] = proj_best[i*p+m];
diff=100;
while ((temp >0.001 || fabs(diff)>(*energy/1000000)) && kt <=500000)
{
tempp = *energy/log(kt+1)/10000;
temp = temp*cool;
normal_fill1 (fp,projdim,proj_work,temp,proj_best);
orthonormal (proj_work,fp,projdim);
zero(projdata,projp*n);
for(i=0; i<projp; i++)
{ for (j=0;j<n; j++)
{ for (m=0; m<p; m++)
projdata[i*n+j] += proj_work[i*p+m]*fvals[m*n+j];
}
}
switch(*method)
{
case 1:
discriminant1(fn,projdim,groups,projdata,group,gname,ngroup,index_work);
break;
case 2:
discriminant2(fn,projdim,groups,projdata,group,gname,ngroup,index_work);
break;
case 3:
discriminant3(fn,projdim,groups,projdata,group,gname,ngroup,index_work,r);
break;
case 4:
cartgini(fn,projdim,groups,projdata,group,ngroup,index_work);
break;
case 5:
cartentropy(fn,projdim,groups,projdata,group,ngroup,index_work);
break;
case 6:
pda(fn,projdim,groups,projdata,group,gname,ngroup,index_work,lambda);
break;
}
prob=uniformrandom();
diff=*index_work-*index_best;
e=exp(diff/tempp);
if( prob<e)
{
for(i=0;i<projp; i++)
for(j=0; j<projn; j++)
proj_best[i*projn+j] =proj_work[i*projn+j];
*index_best = *index_work;
}
kt++;
}
for(i=0;i<projp; i++)
for(j=0; j<projn; j++)
proj[i*projn+j] =proj_best[i*projn+j];
*val = *index_best;
/* printf("iteration = %d\n",kt);*/
PutRNGstate();
Free(proj_best);
Free(proj_work);
Free(projdata);
Free(index_work);
Free(index_best);
Free(sum);
Free(group);
}
int main(int argc, char *argv[]){
double r;
int i;
int *lut_c;
int *lut_f;
polynom *erg;
/* getopt */
int c;
opterr = 0;
while((c=getopt(argc, argv, "r:m:s:")) != -1) {
switch(c) {
case 'r':
R0=atof(optarg);
break;
case 'm':
AD_MAX=atoi(optarg);
break;
case 's':
AD_STEP=atoi(optarg);
break;
case '?':
if (optopt == 'r' || optopt == 'm' || optopt == 's'){
fprintf(stderr, "Option -%c requires an argument.\n", optopt);
} else if (isprint (optopt)) {
fprintf(stderr, "Unknown option '-%c'.\n", optopt);
} else {
fprintf(stderr, "Unknown option character '\\x%x'.\n", optopt);
}
/* fall through */
default:
usage(argv[0]);
return 1;
}
}
if(optind != argc-1 || R0 <=0 || AD_MAX <=0 || AD_STEP <= 0){
usage(argv[0]);
return 1;
}
printf("Using: R0 = %lf, AD_MAX = %d, AD_STEP = %d\n", R0, AD_MAX, AD_STEP);
readtable(argv[optind]);
orthonormal(basis);
erg = approx();
testresult(erg);
for(i=0; i<4; i++){
a[i] = (*erg)[i];
}
lut_c = malloc(sizeof(int) * LUT_SIZE);
lut_f = malloc(sizeof(int) * LUT_SIZE);
lut_c[0]=0;
lut_f[0]=0;
for(i=1; i<LUT_SIZE; i++){
r = rtot(ad_to_r(i*AD_STEP));
lut_c[i] = (int)round(r * 10.0);
lut_f[i] = (int)round(C_TO_F(r) * 10.0);
}
printf("//Celsius\n");
printf("const int ad_lookup[] = { 0");
for(i=1; i<LUT_SIZE; i++){
printf(", %d", lut_c[i]);
}
printf(" };\n");
printf("//Fahrenheit\n");
printf("const int ad_lookup[] = { 0");
for(i=1; i<LUT_SIZE; i++){
printf(", %d", lut_f[i]);
}
printf(" };\n");
}