亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

? 歡迎來到蟲蟲下載站! | ?? 資源下載 ?? 資源專輯 ?? 關于我們
? 蟲蟲下載站

?? svm.cpp

?? libsvm-2.84.rar
?? CPP
?? 第 1 頁 / 共 5 頁
字號:
	free(perm);	}int svm_get_svm_type(const svm_model *model){	return model->param.svm_type;}int svm_get_nr_class(const svm_model *model){	return model->nr_class;}void svm_get_labels(const svm_model *model, int* label){	if (model->label != NULL)		for(int i=0;i<model->nr_class;i++)			label[i] = model->label[i];}double svm_get_svr_probability(const svm_model *model){	if ((model->param.svm_type == EPSILON_SVR || model->param.svm_type == NU_SVR) &&	    model->probA!=NULL)		return model->probA[0];	else	{		info("Model doesn't contain information for SVR probability inference\n");		return 0;	}}void svm_predict_values(const svm_model *model, const svm_node *x, double* dec_values){	if(model->param.svm_type == ONE_CLASS ||	   model->param.svm_type == EPSILON_SVR ||	   model->param.svm_type == NU_SVR)	{		double *sv_coef = model->sv_coef[0];		double sum = 0;		for(int i=0;i<model->l;i++)			sum += sv_coef[i] * Kernel::k_function(x,model->SV[i],model->param);		sum -= model->rho[0];		*dec_values = sum;	}	else	{		int i;		int nr_class = model->nr_class;		int l = model->l;				double *kvalue = Malloc(double,l);		for(i=0;i<l;i++)			kvalue[i] = Kernel::k_function(x,model->SV[i],model->param);		int *start = Malloc(int,nr_class);		start[0] = 0;		for(i=1;i<nr_class;i++)			start[i] = start[i-1]+model->nSV[i-1];		int p=0;		for(i=0;i<nr_class;i++)			for(int j=i+1;j<nr_class;j++)			{				double sum = 0;				int si = start[i];				int sj = start[j];				int ci = model->nSV[i];				int cj = model->nSV[j];								int k;				double *coef1 = model->sv_coef[j-1];				double *coef2 = model->sv_coef[i];				for(k=0;k<ci;k++)					sum += coef1[si+k] * kvalue[si+k];				for(k=0;k<cj;k++)					sum += coef2[sj+k] * kvalue[sj+k];				sum -= model->rho[p];				dec_values[p] = sum;				p++;			}		free(kvalue);		free(start);	}}double svm_predict(const svm_model *model, const svm_node *x){	if(model->param.svm_type == ONE_CLASS ||	   model->param.svm_type == EPSILON_SVR ||	   model->param.svm_type == NU_SVR)	{		double res;		svm_predict_values(model, x, &res);				if(model->param.svm_type == ONE_CLASS)			return (res>0)?1:-1;		else			return res;	}	else	{		int i;		int nr_class = model->nr_class;		double *dec_values = Malloc(double, nr_class*(nr_class-1)/2);		svm_predict_values(model, x, dec_values);		int *vote = Malloc(int,nr_class);		for(i=0;i<nr_class;i++)			vote[i] = 0;		int pos=0;		for(i=0;i<nr_class;i++)			for(int j=i+1;j<nr_class;j++)			{				if(dec_values[pos++] > 0)					++vote[i];				else					++vote[j];			}		int vote_max_idx = 0;		for(i=1;i<nr_class;i++)			if(vote[i] > vote[vote_max_idx])				vote_max_idx = i;		free(vote);		free(dec_values);		return model->label[vote_max_idx];	}}double svm_predict_probability(	const svm_model *model, const svm_node *x, double *prob_estimates){	if ((model->param.svm_type == C_SVC || model->param.svm_type == NU_SVC) &&	    model->probA!=NULL && model->probB!=NULL)	{		int i;		int nr_class = model->nr_class;		double *dec_values = Malloc(double, nr_class*(nr_class-1)/2);		svm_predict_values(model, x, dec_values);		double min_prob=1e-7;		double **pairwise_prob=Malloc(double *,nr_class);		for(i=0;i<nr_class;i++)			pairwise_prob[i]=Malloc(double,nr_class);		int k=0;		for(i=0;i<nr_class;i++)			for(int j=i+1;j<nr_class;j++)			{				pairwise_prob[i][j]=min(max(sigmoid_predict(dec_values[k],model->probA[k],model->probB[k]),min_prob),1-min_prob);				pairwise_prob[j][i]=1-pairwise_prob[i][j];				k++;			}		multiclass_probability(nr_class,pairwise_prob,prob_estimates);		int prob_max_idx = 0;		for(i=1;i<nr_class;i++)			if(prob_estimates[i] > prob_estimates[prob_max_idx])				prob_max_idx = i;		for(i=0;i<nr_class;i++)			free(pairwise_prob[i]);		free(dec_values);                free(pairwise_prob);	     		return model->label[prob_max_idx];	}	else 		return svm_predict(model, x);}const char *svm_type_table[] ={	"c_svc","nu_svc","one_class","epsilon_svr","nu_svr",NULL};const char *kernel_type_table[]={	"linear","polynomial","rbf","sigmoid","precomputed",NULL};int svm_save_model(const char *model_file_name, const svm_model *model){	FILE *fp = fopen(model_file_name,"w");	if(fp==NULL) return -1;	const svm_parameter& param = model->param;	fprintf(fp,"svm_type %s\n", svm_type_table[param.svm_type]);	fprintf(fp,"kernel_type %s\n", kernel_type_table[param.kernel_type]);	if(param.kernel_type == POLY)		fprintf(fp,"degree %d\n", param.degree);	if(param.kernel_type == POLY || param.kernel_type == RBF || param.kernel_type == SIGMOID)		fprintf(fp,"gamma %g\n", param.gamma);	if(param.kernel_type == POLY || param.kernel_type == SIGMOID)		fprintf(fp,"coef0 %g\n", param.coef0);	int nr_class = model->nr_class;	int l = model->l;	fprintf(fp, "nr_class %d\n", nr_class);	fprintf(fp, "total_sv %d\n",l);		{		fprintf(fp, "rho");		for(int i=0;i<nr_class*(nr_class-1)/2;i++)			fprintf(fp," %g",model->rho[i]);		fprintf(fp, "\n");	}		if(model->label)	{		fprintf(fp, "label");		for(int i=0;i<nr_class;i++)			fprintf(fp," %d",model->label[i]);		fprintf(fp, "\n");	}	if(model->probA) // regression has probA only	{		fprintf(fp, "probA");		for(int i=0;i<nr_class*(nr_class-1)/2;i++)			fprintf(fp," %g",model->probA[i]);		fprintf(fp, "\n");	}	if(model->probB)	{		fprintf(fp, "probB");		for(int i=0;i<nr_class*(nr_class-1)/2;i++)			fprintf(fp," %g",model->probB[i]);		fprintf(fp, "\n");	}	if(model->nSV)	{		fprintf(fp, "nr_sv");		for(int i=0;i<nr_class;i++)			fprintf(fp," %d",model->nSV[i]);		fprintf(fp, "\n");	}	fprintf(fp, "SV\n");	const double * const *sv_coef = model->sv_coef;	const svm_node * const *SV = model->SV;	for(int i=0;i<l;i++)	{		for(int j=0;j<nr_class-1;j++)			fprintf(fp, "%.16g ",sv_coef[j][i]);		const svm_node *p = SV[i];		if(param.kernel_type == PRECOMPUTED)			fprintf(fp,"0:%d ",(int)(p->value));		else			while(p->index != -1)			{				fprintf(fp,"%d:%.8g ",p->index,p->value);				p++;			}		fprintf(fp, "\n");	}	if (ferror(fp) != 0 || fclose(fp) != 0) return -1;	else return 0;}svm_model *svm_load_model(const char *model_file_name){	FILE *fp = fopen(model_file_name,"rb");	if(fp==NULL) return NULL;		// read parameters	svm_model *model = Malloc(svm_model,1);	svm_parameter& param = model->param;	model->rho = NULL;	model->probA = NULL;	model->probB = NULL;	model->label = NULL;	model->nSV = NULL;	char cmd[81];	while(1)	{		fscanf(fp,"%80s",cmd);		if(strcmp(cmd,"svm_type")==0)		{			fscanf(fp,"%80s",cmd);			int i;			for(i=0;svm_type_table[i];i++)			{				if(strcmp(svm_type_table[i],cmd)==0)				{					param.svm_type=i;					break;				}			}			if(svm_type_table[i] == NULL)			{				fprintf(stderr,"unknown svm type.\n");				free(model->rho);				free(model->label);				free(model->nSV);				free(model);				return NULL;			}		}		else if(strcmp(cmd,"kernel_type")==0)		{					fscanf(fp,"%80s",cmd);			int i;			for(i=0;kernel_type_table[i];i++)			{				if(strcmp(kernel_type_table[i],cmd)==0)				{					param.kernel_type=i;					break;				}			}			if(kernel_type_table[i] == NULL)			{				fprintf(stderr,"unknown kernel function.\n");				free(model->rho);				free(model->label);				free(model->nSV);				free(model);				return NULL;			}		}		else if(strcmp(cmd,"degree")==0)			fscanf(fp,"%d",&param.degree);		else if(strcmp(cmd,"gamma")==0)			fscanf(fp,"%lf",&param.gamma);		else if(strcmp(cmd,"coef0")==0)			fscanf(fp,"%lf",&param.coef0);		else if(strcmp(cmd,"nr_class")==0)			fscanf(fp,"%d",&model->nr_class);		else if(strcmp(cmd,"total_sv")==0)			fscanf(fp,"%d",&model->l);		else if(strcmp(cmd,"rho")==0)		{			int n = model->nr_class * (model->nr_class-1)/2;			model->rho = Malloc(double,n);			for(int i=0;i<n;i++)				fscanf(fp,"%lf",&model->rho[i]);		}		else if(strcmp(cmd,"label")==0)		{			int n = model->nr_class;			model->label = Malloc(int,n);			for(int i=0;i<n;i++)				fscanf(fp,"%d",&model->label[i]);		}		else if(strcmp(cmd,"probA")==0)		{			int n = model->nr_class * (model->nr_class-1)/2;			model->probA = Malloc(double,n);			for(int i=0;i<n;i++)				fscanf(fp,"%lf",&model->probA[i]);		}		else if(strcmp(cmd,"probB")==0)		{			int n = model->nr_class * (model->nr_class-1)/2;			model->probB = Malloc(double,n);			for(int i=0;i<n;i++)				fscanf(fp,"%lf",&model->probB[i]);		}		else if(strcmp(cmd,"nr_sv")==0)		{			int n = model->nr_class;			model->nSV = Malloc(int,n);			for(int i=0;i<n;i++)				fscanf(fp,"%d",&model->nSV[i]);		}		else if(strcmp(cmd,"SV")==0)		{			while(1)			{				int c = getc(fp);				if(c==EOF || c=='\n') break;				}			break;		}		else		{			fprintf(stderr,"unknown text in model file: [%s]\n",cmd);			free(model->rho);			free(model->label);			free(model->nSV);			free(model);			return NULL;		}	}	// read sv_coef and SV	int elements = 0;	long pos = ftell(fp);	while(1)	{		int c = fgetc(fp);		switch(c)		{			case '\n':				// count the '-1' element			case ':':				++elements;				break;			case EOF:				goto out;			default:				;		}	}out:	fseek(fp,pos,SEEK_SET);	int m = model->nr_class - 1;	int l = model->l;	model->sv_coef = Malloc(double *,m);	int i;	for(i=0;i<m;i++)		model->sv_coef[i] = Malloc(double,l);	model->SV = Malloc(svm_node*,l);	svm_node *x_space=NULL;	if(l>0) x_space = Malloc(svm_node,elements);	int j=0;	for(i=0;i<l;i++)	{		model->SV[i] = &x_space[j];		for(int k=0;k<m;k++)			fscanf(fp,"%lf",&model->sv_coef[k][i]);		while(1)		{			int c;			do {				c = getc(fp);				if(c=='\n') goto out2;			} while(isspace(c));			ungetc(c,fp);			fscanf(fp,"%d:%lf",&(x_space[j].index),&(x_space[j].value));			++j;		}	out2:		x_space[j++].index = -1;	}	if (ferror(fp) != 0 || fclose(fp) != 0) return NULL;	model->free_sv = 1;	// XXX	return model;}void svm_destroy_model(svm_model* model){	if(model->free_sv && model->l > 0)		free((void *)(model->SV[0]));	for(int i=0;i<model->nr_class-1;i++)		free(model->sv_coef[i]);	free(model->SV);	free(model->sv_coef);	free(model->rho);	free(model->label);	free(model->probA);	free(model->probB);	free(model->nSV);	free(model);}void svm_destroy_param(svm_parameter* param){	free(param->weight_label);	free(param->weight);}const char *svm_check_parameter(const svm_problem *prob, const svm_parameter *param){	// svm_type	int svm_type = param->svm_type;	if(svm_type != C_SVC &&	   svm_type != NU_SVC &&	   svm_type != ONE_CLASS &&	   svm_type != EPSILON_SVR &&	   svm_type != NU_SVR)		return "unknown svm type";		// kernel_type, degree		int kernel_type = param->kernel_type;	if(kernel_type != LINEAR &&	   kernel_type != POLY &&	   kernel_type != RBF &&	   kernel_type != SIGMOID &&	   kernel_type != PRECOMPUTED)		return "unknown kernel type";	if(param->degree < 0)		return "degree of polynomial kernel < 0";	// cache_size,eps,C,nu,p,shrinking	if(param->cache_size <= 0)		return "cache_size <= 0";	if(param->eps <= 0)		return "eps <= 0";	if(svm_type == C_SVC ||	   svm_type == EPSILON_SVR ||	   svm_type == NU_SVR)		if(param->C <= 0)			return "C <= 0";	if(svm_type == NU_SVC ||	   svm_type == ONE_CLASS ||	   svm_type == NU_SVR)		if(param->nu <= 0 || param->nu > 1)			return "nu <= 0 or nu > 1";	if(svm_type == EPSILON_SVR)		if(param->p < 0)			return "p < 0";	if(param->shrinking != 0 &&	   param->shrinking != 1)		return "shrinking != 0 and shrinking != 1";	if(param->probability != 0 &&	   param->probability != 1)		return "probability != 0 and probability != 1";	if(param->probability == 1 &&	   svm_type == ONE_CLASS)		return "one-class SVM probability output not supported yet";	// check whether nu-svc is feasible		if(svm_type == NU_SVC)	{		int l = prob->l;		int max_nr_class = 16;		int nr_class = 0;		int *label = Malloc(int,max_nr_class);		int *count = Malloc(int,max_nr_class);		int i;		for(i=0;i<l;i++)		{			int this_label = (int)prob->y[i];			int j;			for(j=0;j<nr_class;j++)				if(this_label == label[j])				{					++count[j];					break;				}			if(j == nr_class)			{				if(nr_class == max_nr_class)				{					max_nr_class *= 2;					label = (int *)realloc(label,max_nr_class*sizeof(int));					count = (int *)realloc(count,max_nr_class*sizeof(int));				}				label[nr_class] = this_label;				count[nr_class] = 1;				++nr_class;			}		}			for(i=0;i<nr_class;i++)		{			int n1 = count[i];			for(int j=i+1;j<nr_class;j++)			{				int n2 = count[j];				if(param->nu*(n1+n2)/2 > min(n1,n2))				{					free(label);					free(count);					return "specified nu is infeasible";				}			}		}		free(label);		free(count);	}	return NULL;}int svm_check_probability_model(const svm_model *model){	return ((model->param.svm_type == C_SVC || model->param.svm_type == NU_SVC) &&		model->probA!=NULL && model->probB!=NULL) ||		((model->param.svm_type == EPSILON_SVR || model->param.svm_type == NU_SVR) &&		 model->probA!=NULL);}

?? 快捷鍵說明

復制代碼 Ctrl + C
搜索代碼 Ctrl + F
全屏模式 F11
切換主題 Ctrl + Shift + D
顯示快捷鍵 ?
增大字號 Ctrl + =
減小字號 Ctrl + -
亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频
国产精品福利影院| 国产精品护士白丝一区av| 成人性生交大片免费看中文网站| 日韩av中文字幕一区二区三区| 一区二区三区 在线观看视频| 亚洲一二三区在线观看| 亚洲欧美偷拍卡通变态| 久久久不卡网国产精品一区| 久久综合久久久久88| 日韩精品资源二区在线| 欧美成人在线直播| 日韩精品一区二区在线观看| 精品福利二区三区| 欧美激情在线免费观看| 国产精品美女一区二区三区| 中文字幕国产精品一区二区| 国产精品久久久久久久久免费相片| 久久精品夜色噜噜亚洲a∨| 国产亚洲一区字幕| 最新不卡av在线| 亚洲a一区二区| 男男视频亚洲欧美| 石原莉奈在线亚洲二区| 久久精品国产色蜜蜜麻豆| 国产精品白丝jk白祙喷水网站| 国产精品亚洲第一区在线暖暖韩国| 99国产一区二区三精品乱码| 欧美亚洲一区二区三区四区| 欧美videos中文字幕| 国产亚洲一二三区| 亚洲一区二区在线免费看| 日本中文字幕一区二区视频 | 欧美日韩日日夜夜| 欧美一卡二卡三卡四卡| 国产区在线观看成人精品 | 国产精品欧美精品| 亚洲一卡二卡三卡四卡五卡| 极品美女销魂一区二区三区| thepron国产精品| 制服丝袜日韩国产| 亚洲欧洲精品天堂一级 | 国产成人av电影在线| 色天使色偷偷av一区二区| 一区二区三区精品在线观看| 麻豆91小视频| 在线这里只有精品| 久久精品亚洲乱码伦伦中文| 亚洲国产精品精华液网站| 高清免费成人av| 日韩欧美国产成人一区二区| 亚洲色图欧洲色图| 久久国产精品色婷婷| 91久久线看在观草草青青| 欧美sm美女调教| 亚洲精品高清在线观看| 国产高清在线精品| 欧美一级片在线看| 亚洲成人自拍偷拍| 99久久综合99久久综合网站| 日韩欧美色综合| 亚洲国产精品久久艾草纯爱| 日本道色综合久久| 国产精品初高中害羞小美女文| 国产一区二区三区视频在线播放| 欧美精品在线视频| 夜夜精品视频一区二区| www.日韩在线| 中文字幕av一区二区三区| 国产美女av一区二区三区| 日韩午夜小视频| 蜜桃一区二区三区在线观看| 91国偷自产一区二区开放时间 | 日本高清不卡在线观看| 国产精品久久久久久久久果冻传媒 | 亚洲乱码国产乱码精品精98午夜| 国产 日韩 欧美大片| 国产亚洲精品7777| 国产精品自在欧美一区| 国产欧美一区二区精品忘忧草| 国产综合久久久久久久久久久久| 精品乱人伦小说| 精品亚洲免费视频| 久久久国产精华| 国产欧美日韩另类视频免费观看| 国产剧情在线观看一区二区| 久久久综合精品| 成人国产免费视频| 自拍偷拍亚洲激情| 亚洲成人精品一区| 在线播放中文一区| 日韩影院在线观看| 久久综合资源网| 成人免费福利片| 亚洲一区在线观看网站| 91黄视频在线| 精品影院一区二区久久久| 国产亚洲综合性久久久影院| proumb性欧美在线观看| 亚洲精品写真福利| 51精品秘密在线观看| 精品一区二区免费视频| 亚洲视频一区二区在线观看| 欧美日本韩国一区二区三区视频| 青青草国产成人99久久| 国产目拍亚洲精品99久久精品 | 欧美电视剧在线看免费| 国产福利91精品一区| 亚洲精品国产精华液| 欧美v日韩v国产v| 一区二区三区中文在线| 欧美成人一区二区三区在线观看 | 日日欢夜夜爽一区| 久久精品免视看| 欧美日韩情趣电影| 高清不卡在线观看| 日本少妇一区二区| 国产精品久久久久久久久免费桃花 | 一区二区三区欧美视频| 美女被吸乳得到大胸91| 中文字幕一区二区三区在线不卡| 欧美久久久久中文字幕| 粉嫩aⅴ一区二区三区四区| 午夜av一区二区| 自拍偷拍亚洲综合| 69精品人人人人| 亚洲国产aⅴ天堂久久| 久久精品一二三| 欧美成人一级视频| 欧美日韩视频在线观看一区二区三区| 国产成人综合自拍| 青草国产精品久久久久久| 亚洲欧洲av一区二区三区久久| 日韩美女视频在线| 在线成人av网站| 欧美丝袜丝交足nylons图片| 成人午夜精品在线| 日本一道高清亚洲日美韩| 亚洲狠狠丁香婷婷综合久久久| 国产亚洲精品久| 久久影院电视剧免费观看| 91精品欧美综合在线观看最新 | 亚洲视频 欧洲视频| 久久精品一区二区三区四区| 日韩欧美中文字幕精品| 制服丝袜一区二区三区| 欧美日韩高清在线| 亚洲黄色小说网站| 亚洲欧洲韩国日本视频| 亚洲欧洲国产专区| 国产精品天天看| 国产精品无遮挡| 日韩午夜电影av| 日韩精品中文字幕一区二区三区 | 2014亚洲片线观看视频免费| 91精品国产高清一区二区三区 | 国产日韩三级在线| 久久色在线视频| 久久精品在线免费观看| 欧美精品一区二区三区蜜桃视频| 日韩欧美一级片| 欧美精品一区二| 久久综合九色综合欧美亚洲| 精品福利在线导航| 久久亚洲影视婷婷| 国产精品嫩草影院com| 国产精品嫩草影院av蜜臀| 亚洲人快播电影网| 亚洲丰满少妇videoshd| 性做久久久久久| 欧美一区二区三区四区五区| 91精品国产综合久久久久久久 | 国内精品久久久久影院薰衣草| 蜜桃在线一区二区三区| 国产69精品久久久久777| 91麻豆免费观看| 91精选在线观看| 久久九九久久九九| 亚洲精品中文字幕在线观看| 亚洲1区2区3区4区| 国产盗摄一区二区| 91福利小视频| 26uuu亚洲| 日韩码欧中文字| 蜜桃av一区二区在线观看| 欧美韩日一区二区三区| 亚洲激情校园春色| 日韩成人精品在线| 成人免费观看男女羞羞视频| 欧美日韩国产三级| 国产天堂亚洲国产碰碰| 亚洲综合精品久久| 国产精品一级二级三级| 91麻豆免费视频| 欧美mv和日韩mv的网站| 亚洲精品伦理在线| 黑人巨大精品欧美一区| 欧美影院一区二区三区| 久久久精品国产99久久精品芒果| 一级女性全黄久久生活片免费| 韩国欧美一区二区|