8 #define Malloc(type,n) (type *)malloc((n)*sizeof(type))
11 void print_null(const char *s) {}
16 "Usage: train [options] training_set_file [model_file]\n"
18 "-s type : set type of solver (default 1)\n"
19 " 0 -- L2-regularized logistic regression\n"
20 " 1 -- L2-regularized L2-loss support vector classification (dual)\n"
21 " 2 -- L2-regularized L2-loss support vector classification (primal)\n"
22 " 3 -- L2-regularized L1-loss support vector classification (dual)\n"
23 " 4 -- multi-class support vector classification by Crammer and Singer\n"
24 " 5 -- L1-regularized L2-loss support vector classification\n"
25 " 6 -- L1-regularized logistic regression\n"
26 "-c cost : set the parameter C (default 1)\n"
27 "-e epsilon : set tolerance of termination criterion\n"
29 " |f'(w)|_2 <= eps*min(pos,neg)/l*|f'(w0)|_2,\n"
30 " where f is the primal function and pos/neg are # of\n"
31 " positive/negative data (default 0.01)\n"
33 " Dual maximal violation <= eps; similar to libsvm (default 0.1)\n"
35 " |f'(w)|_inf <= eps*min(pos,neg)/l*|f'(w0)|_inf,\n"
36 " where f is the primal function (default 0.01)\n"
37 "-B bias : if bias >= 0, instance x becomes [x; bias]; if < 0, no bias term added (default 1)\n"
38 "-wi weight: weights adjust the parameter C of different classes (see README for details)\n"
39 "-v n: n-fold cross validation mode\n"
40 "-q : quiet mode (no outputs)\n"
45 void exit_input_error(int line_num)
47 fprintf(stderr,"Wrong input format at line %d\n", line_num);
51 static char *line = NULL;
52 static int max_line_len;
54 static char* readline(FILE *input)
58 if(fgets(line,max_line_len,input) == NULL)
61 while(strrchr(line,'\n') == NULL)
64 line = (char *) realloc(line,max_line_len);
65 len = (int) strlen(line);
66 if(fgets(line+len,max_line_len-len,input) == NULL)
72 void parse_command_line(int argc, char **argv, char *input_file_name, char *model_file_name);
73 void read_problem(const char *filename);
74 void do_cross_validation();
76 struct feature_node *x_space;
77 struct parameter param;
80 int flag_cross_validation;
84 int main(int argc, char **argv)
86 char input_file_name[1024];
87 char model_file_name[1024];
88 const char *error_msg;
90 parse_command_line(argc, argv, input_file_name, model_file_name);
91 read_problem(input_file_name);
92 error_msg = check_parameter(&prob,¶m);
96 fprintf(stderr,"Error: %s\n",error_msg);
100 if(flag_cross_validation)
102 do_cross_validation();
106 model_=train(&prob, ¶m);
107 save_model(model_file_name, model_);
108 destroy_model(model_);
110 destroy_param(¶m);
119 void do_cross_validation()
122 int total_correct = 0;
123 int *target = Malloc(int, prob.l);
125 cross_validation(&prob,¶m,nr_fold,target);
127 for(i=0;i<prob.l;i++)
128 if(target[i] == prob.y[i])
130 printf("Cross Validation Accuracy = %g%%\n",100.0*total_correct/prob.l);
135 void parse_command_line(int argc, char **argv, char *input_file_name, char *model_file_name)
140 param.solver_type = L2R_L2LOSS_SVC_DUAL;
142 param.eps = INF; // see setting below
144 param.weight_label = NULL;
146 flag_cross_validation = 0;
152 if(argv[i][0] != '-') break;
158 param.solver_type = atoi(argv[i]);
162 param.C = atof(argv[i]);
166 param.eps = atof(argv[i]);
170 bias = atof(argv[i]);
175 param.weight_label = (int *) realloc(param.weight_label,sizeof(int)*param.nr_weight);
176 param.weight = (double *) realloc(param.weight,sizeof(double)*param.nr_weight);
177 param.weight_label[param.nr_weight-1] = atoi(&argv[i-1][2]);
178 param.weight[param.nr_weight-1] = atof(argv[i]);
182 flag_cross_validation = 1;
183 nr_fold = atoi(argv[i]);
186 fprintf(stderr,"n-fold cross validation: n must >= 2\n");
192 liblinear_print_string = &print_null;
197 fprintf(stderr,"unknown option: -%c\n", argv[i-1][1]);
203 // determine filenames
207 strcpy(input_file_name, argv[i]);
210 strcpy(model_file_name,argv[i+1]);
213 char *p = strrchr(argv[i],'/');
218 sprintf(model_file_name,"%s.model",p);
223 if(param.solver_type == L2R_LR || param.solver_type == L2R_L2LOSS_SVC)
225 else if(param.solver_type == L2R_L2LOSS_SVC_DUAL || param.solver_type == L2R_L1LOSS_SVC_DUAL || param.solver_type == MCSVM_CS)
227 else if(param.solver_type == L1R_L2LOSS_SVC || param.solver_type == L1R_LR)
232 // read in a problem (in libsvm format)
233 void read_problem(const char *filename)
235 int max_index, inst_max_index, i;
236 long int elements, j;
237 FILE *fp = fopen(filename,"r");
239 char *idx, *val, *label;
243 fprintf(stderr,"can't open input file %s\n",filename);
250 line = Malloc(char,max_line_len);
251 while(readline(fp)!=NULL)
253 char *p = strtok(line," \t"); // label
258 p = strtok(NULL," \t");
259 if(p == NULL || *p == '\n') // check '\n' as ' ' may be after the last feature
270 prob.y = Malloc(int,prob.l);
271 prob.x = Malloc(struct feature_node *,prob.l);
272 x_space = Malloc(struct feature_node,elements+prob.l);
276 for(i=0;i<prob.l;i++)
278 inst_max_index = 0; // strtol gives 0 if wrong format
280 prob.x[i] = &x_space[j];
281 label = strtok(line," \t");
282 prob.y[i] = (int) strtol(label,&endptr,10);
284 exit_input_error(i+1);
288 idx = strtok(NULL,":");
289 val = strtok(NULL," \t");
295 x_space[j].index = (int) strtol(idx,&endptr,10);
296 if(endptr == idx || errno != 0 || *endptr != '\0' || x_space[j].index <= inst_max_index)
297 exit_input_error(i+1);
299 inst_max_index = x_space[j].index;
302 x_space[j].value = strtod(val,&endptr);
303 if(endptr == val || errno != 0 || (*endptr != '\0' && !isspace(*endptr)))
304 exit_input_error(i+1);
309 if(inst_max_index > max_index)
310 max_index = inst_max_index;
313 x_space[j++].value = prob.bias;
315 x_space[j++].index = -1;
321 for(i=1;i<prob.l;i++)
322 (prob.x[i]-2)->index = prob.n;
323 x_space[j-2].index = prob.n;