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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
|
/*
* Winnow classifier
*/
#include <sys/types.h>
#include <math.h>
#include "classifiers.h"
#define WINNOW_PROMOTION 1.23
#define WINNOW_DEMOTION 0.83
struct winnow_callback_data {
statfile_pool_t *pool;
struct classifier_ctx *ctx;
char *filename;
double sum;
int count;
int in_class;
time_t now;
};
static gboolean
classify_callback (gpointer key, gpointer value, gpointer data)
{
token_node_t *node = key;
struct winnow_callback_data *cd = data;
float v;
/* Consider that not found blocks have value 1 */
if ((v = statfile_pool_get_block (cd->pool, cd->filename, node->h1, node->h2, cd->now)) < 0.00001) {
cd->sum += 1;
}
else {
cd->sum += v;
cd->in_class ++;
}
cd->count ++;
return FALSE;
}
static gboolean
learn_callback (gpointer key, gpointer value, gpointer data)
{
token_node_t *node = key;
struct winnow_callback_data *cd = data;
float v, c;
c = (cd->in_class) ? WINNOW_PROMOTION : WINNOW_DEMOTION;
/* Consider that not found blocks have value 1 */
if ((v = statfile_pool_get_block (cd->pool, cd->filename, node->h1, node->h2, cd->now)) < 0.00001) {
statfile_pool_set_block (cd->pool, cd->filename, node->h1, node->h2, cd->now, c);
}
else {
statfile_pool_set_block (cd->pool, cd->filename, node->h1, node->h2, cd->now, v * c);
}
cd->count ++;
return FALSE;
}
struct classifier_ctx*
winnow_init (memory_pool_t *pool)
{
struct classifier_ctx *ctx = memory_pool_alloc (pool, sizeof (struct classifier_ctx));
ctx->pool = pool;
ctx->results = g_hash_table_new (g_str_hash, g_str_equal);
memory_pool_add_destructor (pool, (pool_destruct_func)g_hash_table_destroy, ctx->results);
return ctx;
}
void
winnow_classify (struct classifier_ctx *ctx, statfile_pool_t *pool, char *statfile, GTree *input, double scale)
{
struct winnow_callback_data data;
double *res = memory_pool_alloc (ctx->pool, sizeof (double));
g_assert (pool != NULL);
g_assert (ctx != NULL);
data.pool = pool;
data.filename = statfile;
data.sum = 0;
data.count = 0;
data.now = time (NULL);
data.ctx = ctx;
if (!statfile_pool_is_open (pool, statfile)) {
if (statfile_pool_open (pool, statfile) == -1) {
return;
}
}
g_tree_foreach (input, classify_callback, &data);
*res = scale * (data.sum / data.count);
g_hash_table_insert (ctx->results, statfile, res);
}
void
winnow_learn (struct classifier_ctx *ctx, statfile_pool_t *pool, char *statfile, GTree *input, int in_class)
{
struct winnow_callback_data data;
g_assert (pool != NULL);
g_assert (ctx != NULL);
data.pool = pool;
data.filename = statfile;
data.sum = 0;
data.count = 0;
data.in_class = in_class;
data.now = time (NULL);
data.ctx = ctx;
if (!statfile_pool_is_open (pool, statfile)) {
if (statfile_pool_open (pool, statfile) == -1) {
return;
}
}
statfile_pool_lock_file (pool, statfile);
g_tree_foreach (input, learn_callback, &data);
statfile_pool_unlock_file (pool, statfile);
}
struct winnow_result_data {
char *filename;
double max_score;
double sum;
};
static void
result_file_callback (gpointer key, gpointer value, gpointer data)
{
struct winnow_result_data *d = (struct winnow_result_data *)data;
double w = *((double *)value);
if (fabs (w) > fabs (d->max_score)) {
d->filename = (char *)key;
d->max_score = w;
}
d->sum += fabs (w);
}
char*
winnow_result_file (struct classifier_ctx* ctx, double *probability)
{
struct winnow_result_data data = { NULL, 0, 0 };
g_assert (ctx != NULL);
g_hash_table_foreach (ctx->results, result_file_callback, &data);
if (data.sum != 0) {
*probability = data.max_score / data.sum;
}
else {
*probability = 1;
}
return data.filename;
}
|
