-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlearntcp.cpp~
116 lines (98 loc) · 2.65 KB
/
learntcp.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
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cstring>
#include <fstream>
#include <sstream>
#include "perceptron.hpp"
using namespace std;
#define LOOP_MAX 2000
int parseInt(char *arg){
string str;
int ret;
for(int i=0;i<(int)strlen(arg);i++){
str += arg[i];
}
istringstream iss(str);
iss >> ret;
return ret;
}
int main(int argc, char *argv[]){
vector<string> teacher;
vector<string> data;
string str;
double e;
int t=0;
long long tsum=0;
int n;
int ans;
int takenAll=0, takenNormal=0;
int gaveup=0, random=0;
bool istaken;
double pred;
Perceptron p;
if(argc == 1){
cout << "input number of teacher. Exitting." <<endl;
exit(0);
}
n = parseInt(argv[1]);
cout << "history length = " << n << endl;
//データの読み込み
ifstream fin("./data.dat");
while(getline(fin,str)){
data.push_back(str);
}
cout << "data loaded. # of data =" << data.size() << endl;
//n番目から予測を始める
for(int i=n;i<(int)data.size();i++){
teacher.clear(); //教師データのクリア
p.init(); //perceptron内parameterのクリア
for(int j=0;j<n;j++){
teacher.push_back(data[i-1-j]); //教師データを加えていく
}
//与えた教師データでの学習を行う
t = 0; //loop回数のカウンタリセット
do{
e = p.learn(teacher);
t++;
//cout << e << endl;
}while(e > 0.05*n && t < LOOP_MAX);
if(t == LOOP_MAX) gaveup++;
//教師データ(正答)を取得
istringstream iss(data[i]);
for(int j=0;j<3;j++){
iss >> ans;
}
iss >> ans;
//paramter出力
p.print_param();
//教師データを流してperceptronからの出力を得る
pred = p.get(data[i]);
if(pred == 0.5){
pred = rand() % 2;
random++;
}else if(pred > 0.5){
pred = 1;
}else{
pred = 0;
}
if(fabs((double)ans - pred) == 0){
takenAll++;
if(t != LOOP_MAX) takenNormal++;
istaken = true;
}else{
istaken = false;
}
printf("[%d]answer = %d, prediction = %d, istaken=%d, repeated %d times\n",
i,ans,(int)pred,istaken, t);
if(t != LOOP_MAX){
tsum += t;
}
}
printf("taken rate(ALL)=%lf(%d/%d), ",(double)takenAll / (data.size()- n), takenAll, (int)data.size() - n);
printf("taken rate(except gave up) = %lf(%d/%d)\n", (double)takenNormal / (data.size() - n - gaveup), takenNormal,
(int)data.size() - n - gaveup);
printf("average loop times(except gave up) = %lf, ", (double)tsum / (data.size() - n - gaveup));
printf("# of gaveup = %d, # of determined randomly = %d\n", gaveup, random);
}