forked from pennyliang/MachineLearning-C---code
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain2.cpp
198 lines (176 loc) · 5.59 KB
/
main2.cpp
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
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <time.h>
const int doc_cnt = 16;
const int term_per_doc = 16;
const int term_cnt = 5;
const int topic_cnt = 2;
int doc[doc_cnt][term_per_doc][2]={
{{2,0},{2,0},{2,0},{2,0},{3,1},{3,0},{3,0},{3,0},{3,1},{3,0},{4,1},{4,1},{4,0},{4,1},{4,0},{4,0}},
{{2,0},{2,0},{2,1},{2,0},{2,0},{3,1},{3,1},{3,1},{3,1},{3,1},{3,1},{3,0},{4,1},{4,0},{4,0},{4,1}},
{{2,0},{2,0},{2,0},{2,1},{2,0},{2,0},{2,0},{3,0},{3,1},{3,0},{3,1},{3,0},{4,1},{4,0},{4,0},{4,0}},
{{2,1},{2,1},{2,1},{2,0},{2,1},{2,0},{2,0},{3,0},{3,1},{3,1},{3,0},{3,0},{3,0},{4,0},{4,0},{4,0}},
{{2,1},{2,1},{2,0},{2,1},{2,0},{2,1},{2,0},{3,1},{3,0},{4,0},{4,1},{4,0},{4,0},{4,0},{4,0},{4,0}},
{{2,0},{2,1},{2,1},{2,0},{2,1},{2,1},{2,1},{2,1},{2,1},{3,0},{3,1},{3,0},{4,0},{4,0},{4,1},{4,1}},
{{0,0},{2,0},{2,1},{2,1},{2,1},{3,1},{3,1},{3,0},{3,0},{3,1},{3,0},{4,0},{4,1},{4,1},{4,1},{4,0}},
{{0,1},{1,0},{1,1},{2,0},{2,0},{2,1},{2,1},{2,1},{2,1},{3,0},{3,1},{3,1},{3,0},{4,1},{4,1},{4,0}},
{{0,1},{1,0},{1,0},{1,1},{2,0},{2,0},{2,0},{2,0},{2,0},{2,1},{3,1},{3,0},{3,1},{3,1},{4,0},{4,1}},
{{0,1},{0,0},{1,1},{1,1},{1,0},{2,1},{2,0},{2,0},{2,0},{2,0},{2,0},{3,1},{4,1},{4,0},{4,0},{4,1}},
{{0,0},{0,1},{1,0},{1,1},{1,1},{2,0},{2,0},{2,0},{2,1},{2,1},{2,0},{2,0},{3,1},{3,1},{3,1},{4,1}},
{{0,0},{0,0},{0,0},{1,0},{1,0},{1,0},{1,0},{1,1},{1,0},{2,1},{2,0},{2,1},{2,1},{2,0},{2,1},{3,0}},
{{0,0},{0,0},{0,0},{0,1},{0,1},{0,1},{1,0},{1,1},{1,0},{2,1},{2,0},{2,0},{2,0},{2,1},{2,1},{4,0}},
{{0,0},{0,0},{1,1},{1,1},{1,0},{1,0},{1,0},{1,1},{1,1},{1,1},{2,1},{2,1},{2,0},{2,1},{2,0},{2,0}},
{{0,0},{0,1},{0,1},{0,1},{1,1},{1,1},{1,1},{1,0},{1,0},{1,1},{1,0},{2,1},{2,0},{2,1},{2,0},{2,1}},
{{0,1},{0,0},{0,1},{0,1},{0,0},{1,1},{1,1},{1,0},{1,0},{1,0},{1,0},{1,1},{2,1},{2,1},{2,1},{2,0}},
};
double C[term_cnt][topic_cnt];
double F[doc_cnt][topic_cnt];
void update_C_F()
{
for(int i=0;i<term_cnt;++i)
{
for(int j=0;j<topic_cnt;++j)
{
C[i][j] = 0;
}
}
for(int i=0;i<doc_cnt;++i)
{
for(int j=0;j<topic_cnt;++j)
{
F[i][j] = 0;;
}
}
for(int i=0;i<doc_cnt;++i)
{
for(int j=0;j<term_per_doc;++j)
{
C[doc[i][j][0] ][doc[i][j][1]]++;
}
}
for(int i=0;i<doc_cnt;++i)
{
for(int j=0;j<term_per_doc;++j)
{
F[i][doc[i][j][1]]++;
}
}
}
void show_C()
{
printf("\n");
for( int i =0 ;i<term_cnt;++i)
{
for(int j=0;j<topic_cnt;++j)
{
printf("%f\t",C[i][j]);
}
printf("\n");
}
}
void show_doc()
{
printf("\n");
for(int i=0;i<doc_cnt;i++)
{
for(int j=0;j<term_per_doc;++j)
{
printf("{%d,%d}\t",doc[i][j][0],doc[i][j][1]);
}
printf("\n");
}
}
void show_F()
{
printf("\n");
for( int i =0 ;i<doc_cnt;++i)
{
for(int j=0;j<topic_cnt;++j)
{
printf("%f\t",F[i][j]);
}
}
}
double beta = 0.01;
double alpha = 25;
int max_iter = 64;
int counter_dt_n[doc_cnt][topic_cnt];
int counter_dt_sum_n[doc_cnt];
int counter_tt_n[topic_cnt][term_cnt];
int counter_tt_sum_n[topic_cnt];
int main(void)
{
//update_C_F();
//show_C();
for(int m = 0;m<doc_cnt;++m)
{
for(int k=0;k<term_per_doc;++k)
{
int topic_idx = doc[m][k][1];
int term_idx = doc[m][k][0];
counter_dt_n[m][topic_idx]++;
counter_dt_sum_n[m]++;
counter_tt_n[topic_idx][term_idx]++;
counter_tt_sum_n[topic_idx]++;
}
srand(time(NULL));
}
srand(time(NULL));
for(int iter = 0; iter<max_iter;++iter)
{
for(int m=0;m<doc_cnt;++m) //doc by doc
{
for(int k=0;k<term_per_doc;++k) // term by term
{
int topic_idx = doc[m][k][1];
int new_topic_idx;
int term_idx = doc[m][k][0];
if(counter_dt_n[m][topic_idx]>0) // avoid to -1....
counter_dt_n[m][topic_idx]--;
counter_dt_sum_n[m]--;
if(counter_tt_n[topic_idx][term_idx]>0) //avoid to -1....
counter_tt_n[topic_idx][term_idx]--;
counter_tt_sum_n[topic_idx]--;
//sample topic_idx
/*double a = (counter_dt_n[m][0]+beta)/(counter_dt_sum_n[m]+term_cnt*beta);
a *= (counter_tt_n[0][term_idx]+alpha)/(counter_tt_sum_n[0]+topic_cnt*alpha);
double b = (counter_dt_n[m][1]+beta)/(counter_dt_sum_n[m]+term_cnt*beta);
b *= (counter_tt_n[1][term_idx]+alpha)/(counter_tt_sum_n[1]+topic_cnt*alpha);
*/
double a = (counter_dt_n[m][0]+alpha)/(counter_dt_sum_n[m]+topic_cnt*alpha);
a *= (counter_tt_n[0][term_idx]+beta)/(counter_tt_sum_n[0]+term_cnt*beta);
double b = (counter_dt_n[m][1]+alpha)/(counter_dt_sum_n[m]+topic_cnt*alpha);
b *= (counter_tt_n[1][term_idx]+beta)/(counter_tt_sum_n[1]+term_cnt*beta);
double all = a+b;
double topic_0_share = a/all;
if( random()%100000 < topic_0_share*100000)
{
topic_idx = 0;
doc[m][k][1] = 0;
}
else
{
topic_idx = 1;
doc[m][k][1] = 1;
}
//end sample topic_idx
if(counter_dt_n[m][topic_idx]<=counter_dt_sum_n[m]) // here must be <= ,pls use your head to think...
counter_dt_n[m][topic_idx]++;
counter_dt_sum_n[m]++;
if(counter_tt_n[topic_idx][term_idx]<=counter_tt_sum_n[topic_idx])
counter_tt_n[topic_idx][term_idx]++;
counter_tt_sum_n[topic_idx]++;
}
}
show_doc();
update_C_F();
show_C();
show_F();
}
show_doc();
update_C_F();
show_C();
show_F();
return 0;
}