/
linear.h
112 lines (93 loc) · 2.51 KB
/
linear.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
#ifndef _LIBLINEAR_H
#define _LIBLINEAR_H
#include <mpi.h>
#include <vector>
#ifdef __cplusplus
extern "C" {
#endif
static timespec timediff(timespec start, timespec end)
{
timespec temp;
if ((end.tv_nsec-start.tv_nsec)<0)
{
temp.tv_sec = end.tv_sec-start.tv_sec-1;
temp.tv_nsec = 1000000000+end.tv_nsec-start.tv_nsec;
}
else
{
temp.tv_sec = end.tv_sec-start.tv_sec;
temp.tv_nsec = end.tv_nsec-start.tv_nsec;
}
return temp;
}
static void timeadd(timespec *base, timespec offset)
{
base->tv_sec += offset.tv_sec;
if (base->tv_nsec + offset.tv_nsec >= 1000000000)
{
base->tv_sec += 1;
base->tv_nsec -= (1000000000 - offset.tv_nsec);
}
else
base->tv_nsec += offset.tv_nsec;
}
struct feature_node
{
int index;
double value;
};
struct problem
{
int l, n;
double *y;
struct feature_node **x;
double bias; /* < 0 if no bias term */
};
enum { L2_BDA, L1_BDA, LR_BDA, L2_TRON, LR_TRON, L2_DISDCA, L1_DISDCA, LR_DISDCA}; /* solver_type */
struct parameter
{
int solver_type;
/* these are for training only */
double eps; /* stopping criteria */
double C;
int nr_weight;
int *weight_label;
double* weight;
};
struct model
{
struct parameter param;
int nr_class; /* number of classes */
int nr_feature;
double *w;
int *label; /* label of each class */
double bias;
};
struct model* train(const struct problem *prob, const struct parameter *param);
double predict_values(const struct model *model_, const struct feature_node *x, double* dec_values);
double predict(const struct model *model_, const struct feature_node *x);
int save_model(const char *model_file_name, const struct model *model_);
struct model *load_model(const char *model_file_name);
int get_nr_feature(const struct model *model_);
int get_nr_class(const struct model *model_);
void get_labels(const struct model *model_, int* label);
void free_model_content(struct model *model_ptr);
void free_and_destroy_model(struct model **model_ptr_ptr);
void destroy_param(struct parameter *param);
const char *check_parameter(const struct problem *prob, const struct parameter *param);
void set_print_string_function(void (*print_func) (const char*));
#ifdef __cplusplus
}
#endif
int mpi_get_rank();
int mpi_get_size();
template<typename T>
void mpi_allreduce_notimer(T *buf, const int count, MPI_Datatype type, MPI_Op op)
{
std::vector<T> buf_reduced(count);
MPI_Allreduce(buf, buf_reduced.data(), count, type, op, MPI_COMM_WORLD);
for(int i=0;i<count;i++)
buf[i] = buf_reduced[i];
}
void mpi_exit(const int status);
#endif /* _LIBLINEAR_H */