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

? 歡迎來到蟲蟲下載站! | ?? 資源下載 ?? 資源專輯 ?? 關(guān)于我們
? 蟲蟲下載站

?? svm.cpp

?? 一種應(yīng)用廣泛的分類算法
?? CPP
?? 第 1 頁 / 共 5 頁
字號:
		svm_destroy_model(submodel);		free(subprob.x);		free(subprob.y);	}			free(fold_start);	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;		int pos=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[pos++] = sum;			}		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");	}	fclose(fp);	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\n");			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;	}	fclose(fp);	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);}

?? 快捷鍵說明

復(fù)制代碼 Ctrl + C
搜索代碼 Ctrl + F
全屏模式 F11
切換主題 Ctrl + Shift + D
顯示快捷鍵 ?
增大字號 Ctrl + =
減小字號 Ctrl + -
亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频
精品国产麻豆免费人成网站| 91女神在线视频| 国产亚洲成aⅴ人片在线观看| 国产乱子伦视频一区二区三区| 26uuu精品一区二区| 国产91清纯白嫩初高中在线观看 | 99精品欧美一区| 亚洲日韩欧美一区二区在线| 欧洲精品一区二区三区在线观看| 午夜视频一区二区| 欧美xxxxxxxxx| 成人动漫一区二区三区| 亚洲最色的网站| 日韩免费一区二区三区在线播放| 国产99久久久精品| 亚洲成人免费视| 亚洲精品在线三区| 色哟哟一区二区在线观看| 丝袜美腿亚洲综合| 久久精品无码一区二区三区| 99久久婷婷国产| 美腿丝袜亚洲一区| 中文字幕在线观看不卡视频| 欧美日韩视频专区在线播放| 国产真实乱对白精彩久久| 亚洲欧美视频在线观看| 7777精品伊人久久久大香线蕉最新版| 精品一区二区三区香蕉蜜桃 | 国产精一品亚洲二区在线视频| 国产精品国产三级国产aⅴ中文 | 精品国产免费一区二区三区香蕉 | 亚洲国产中文字幕在线视频综合 | 91麻豆精品国产91久久久更新时间 | 69精品人人人人| av亚洲精华国产精华精华| 日韩avvvv在线播放| ...xxx性欧美| 精品国产免费一区二区三区四区| 日本大香伊一区二区三区| 激情久久五月天| 亚洲超碰精品一区二区| 亚洲国产精品av| 欧美成人激情免费网| 欧美一a一片一级一片| 成人激情校园春色| 激情丁香综合五月| 日本怡春院一区二区| 中文字幕亚洲不卡| 久久久国产精品午夜一区ai换脸| 91麻豆精品国产自产在线观看一区| 91网页版在线| 懂色av一区二区在线播放| 奇米777欧美一区二区| 一区二区三区高清| 亚洲黄色av一区| 亚洲欧洲在线观看av| 久久久午夜精品| 日韩欧美国产电影| 91精品午夜视频| 7878成人国产在线观看| 欧美色精品在线视频| 欧美性大战xxxxx久久久| 一本色道久久综合精品竹菊| 北条麻妃一区二区三区| 国产成人精品亚洲日本在线桃色 | 99国产欧美久久久精品| 国产高清精品在线| 国产传媒久久文化传媒| 国产精品一区二区三区99| 激情综合色播激情啊| 久久国产婷婷国产香蕉| 青青草原综合久久大伊人精品| 性欧美大战久久久久久久久| 亚洲成人午夜影院| 日韩激情视频网站| 免费久久精品视频| 激情综合色播激情啊| 国产老妇另类xxxxx| 粉嫩欧美一区二区三区高清影视| 国产成人鲁色资源国产91色综 | 成人美女视频在线观看18| 丁香婷婷综合色啪| 99热精品国产| 欧美在线|欧美| 91精品久久久久久久91蜜桃| 日韩精品一区国产麻豆| 久久综合九色综合97_久久久 | 91精品国产一区二区| 日韩欧美的一区| 久久精品人人做人人爽97| 亚洲国产精品ⅴa在线观看| 亚洲欧美另类小说| 五月天激情小说综合| 欧美aaaaaa午夜精品| 精品一区二区三区在线播放 | 色婷婷国产精品久久包臀| 欧美高清性hdvideosex| 欧美日韩另类国产亚洲欧美一级| 欧美精品久久久久久久多人混战| 欧美一二三区在线观看| 久久精品免视看| 国产在线视频一区二区| 国产精品 欧美精品| 91玉足脚交白嫩脚丫在线播放| 在线视频国内一区二区| 宅男噜噜噜66一区二区66| 久久久久久综合| 亚洲一区二区中文在线| 免费看欧美女人艹b| www.欧美日韩| 91精品国产综合久久久久久久| 久久色在线视频| 亚洲一区在线观看视频| 国模冰冰炮一区二区| 91碰在线视频| 日韩欧美在线123| 最新成人av在线| 久久精品国产一区二区三| 99视频精品全部免费在线| 91精品国产综合久久小美女| 国产精品久久久久久久久免费桃花 | 99久久精品国产一区二区三区 | 国产乱妇无码大片在线观看| 在线免费观看日本一区| 久久亚洲一区二区三区四区| 亚洲人亚洲人成电影网站色| 奇米一区二区三区av| 91精品1区2区| 久久精品视频一区二区| 日本欧美一区二区| 色婷婷香蕉在线一区二区| xfplay精品久久| 午夜电影网一区| 91在线精品秘密一区二区| 精品日产卡一卡二卡麻豆| 亚洲国产综合在线| 成人动漫在线一区| 久久久国产午夜精品| 捆绑调教美女网站视频一区| 精品视频免费在线| 国产精品久久毛片| 国产成人免费在线视频| 日韩精品一区二区三区视频| 五月婷婷综合在线| 91黄色激情网站| 国产精品国产馆在线真实露脸 | 一区二区成人在线视频| 成人美女视频在线观看| 久久久精品蜜桃| 精品影院一区二区久久久| 3d成人h动漫网站入口| 亚洲综合成人在线| 色噜噜狠狠色综合欧洲selulu| 中文字幕欧美日本乱码一线二线 | 日精品一区二区| 在线观看av一区| 亚洲色大成网站www久久九九| 懂色av一区二区三区免费看| 国产色爱av资源综合区| 韩国女主播成人在线| 日韩欧美电影在线| 九一九一国产精品| 日韩美女一区二区三区| 日本美女一区二区| 欧美一级搡bbbb搡bbbb| 美女精品一区二区| 欧美一级日韩不卡播放免费| 蜜桃视频一区二区| 欧美不卡一二三| 久久99日本精品| 久久久亚洲欧洲日产国码αv| 国产剧情在线观看一区二区| 国产蜜臀97一区二区三区| 波波电影院一区二区三区| 亚洲丝袜另类动漫二区| 在线观看视频一区二区 | 欧美精品一区二区三区在线 | 色综合久久久久| 亚洲线精品一区二区三区| 欧美午夜精品久久久久久孕妇| 亚洲成人免费电影| 日韩视频在线永久播放| 精品亚洲国内自在自线福利| 国产亚洲欧美中文| 97精品超碰一区二区三区| 亚洲精品伦理在线| 欧美日韩激情一区二区| 麻豆中文一区二区| 国产欧美日韩一区二区三区在线观看| 成人听书哪个软件好| 亚洲女人****多毛耸耸8| 欧美丰满高潮xxxx喷水动漫| 国产麻豆午夜三级精品| 国产精品福利av | 337p日本欧洲亚洲大胆精品| 成人午夜视频网站| 午夜国产精品影院在线观看| 久久久久久影视| 欧美午夜影院一区| 国产乱一区二区|