-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathgroupstats.awk
More file actions
153 lines (132 loc) · 4.05 KB
/
groupstats.awk
File metadata and controls
153 lines (132 loc) · 4.05 KB
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
#!/usr/bin/awk
#compute N, min, 0.05, .25, .5, .75, 0.95, max, mean, stdev
function sq_init(sq, epsilon, compact_size) {
sq["epsilon"] = epsilon;
sq["k"] = compact_size;
sq["n"] = 0;
sq["W"] = exp(log(rand())/compact_size);
sq["next_i"] = compact_size + int(log(rand())/log(1-sq["W"])) + 1;
sq["min"] = "";
sq["max"] = "";
}
function sq_insert(sq, v, _i) {
if(sq["n"] < sq["k"]) {
#take the first k elements
sq["s"][sq["n"]+1] = v;
if(sq["min"] == "") {
sq["min"] = v;
} else {
sq["min"] = (sq["min"]<v)?sq["min"]:v;
}
if(sq["max"] == "") {
sq["max"] = v;
} else {
sq["max"] = (sq["max"]>v)?sq["max"]:v;
}
} else {
if(sq["n"] == sq["next_i"]) {
sq["s"][int(rand()*sq["k"])+1] = v;
sq["W"] = sq["W"] * exp(log(rand())/sq["k"])
sq["next_i"] = sq["next_i"] + int(log(rand())/log(1-sq["W"])) + 1;
}
sq["min"] = (sq["min"]<v)?sq["min"]:v;
sq["max"] = (sq["max"]>v)?sq["max"]:v;
}
sq["n"] += 1;
}
function sq_quantile(sq, phi, _i) {
_i = int(phi*((sq["n"]<sq["k"])?sq["n"]:sq["k"]));
return sq["s"][_i];
}
function sq_min(sq) {
return sq["min"];
}
function sq_max(sq) {
return sq["max"];
}
function printstats(key, data, countvals, sumvals, sumsquares) {
asort(data["s"]);
printf("%s\tN\t%d\n", key, countvals);
printf("%s\tmin\t%f\n", key, sq_min(data));
printf("%s\tp05\t%f\n", key, sq_quantile(data,0.05));
printf("%s\tp25\t%f\n", key, sq_quantile(data,0.25));
printf("%s\tp50\t%f\n", key, sq_quantile(data,0.5));
printf("%s\tp75\t%f\n", key, sq_quantile(data,0.75));
printf("%s\tp95\t%f\n", key, sq_quantile(data,0.95));
printf("%s\tmax\t%f\n", key, sq_max(data));
printf("%s\tmean\t%f\n", key, sumvals/countvals);
if(sumsquares < sumvals*sumvals/countvals) {
#protect against numerical stability issues
stdev=-1;
} else if(countvals <= 1) {
#protect against an edgecase with just one element
#if there are zero elements than x won't exist in s
stdev=0;
} else {
stdev=sqrt((sumsquares-sumvals*sumvals/countvals)/(countvals-1));
}
printf("%s\tstdev\t%f\n", key, stdev);
}
NF != 2 {
print "didn't have two fields on line", NR, "fields", NF, "line", $0 > "/dev/stderr"
exit 1;
}
BEGIN {
delete all_d;
sq_init(all_d, 0.05, 10000);
}
!n[$1] {
d[$1]["min"];
sq_init(d[$1], 0.05, 10000);
}
{
ss[$1] += $2*$2;
s[$1] += $2;
n[$1] += 1;
sq_insert(d[$1], $2);
all_SS += $2*$2;
all_S += $2;
all_n += 1;
sq_insert(all_d, $2);
N+=1;
}
END {
if(N>0) {
K=0;
Ysum=0;
for(x in s) {
printstats(x, d[x], n[x], s[x], ss[x]);
K+=1;
Ybar[x] = s[x]/n[x];
Ysum += s[x];
};
printstats("ALL", all_d, all_n, all_S, all_SS);
if(K>1 && N > K) {
explained_variance=0;
for(x in Ybar) {
explained_variance += n[x]*(Ybar[x] - Ysum/N)*(Ybar[x] - Ysum/N)/(K-1);
}
unexplained_variance=0;
for(x in Ybar) {
unexplained_variance += (ss[x] - s[x]*s[x]/n[x])/(N-K);
#TODO: would be better to not pass over the data again
#for (j in d[x]) {
# unexplained_variance += (d[x][j] - Ybar_i[x])*(d[x][j] - Ybar_i[x]) / (N-K);
#}
}
if(unexplained_variance > 0) {
F = explained_variance / unexplained_variance;
} else {
F = 0;
}
printf("ANOVA\tF\t%f\n", F);
printf("ANOVA\td1\t%d\n", K-1);
printf("ANOVA\td2\t%d\n", N-K);
printf("ANOVA\tK\t%d\n", K);
printf("ANOVA\tN\t%d\n", N);
printf("ANOVA\tev\t%f\n", explained_variance);
printf("ANOVA\tuv\t%f\n", unexplained_variance);
printf("ANOVA\tgrandmean\t%f\n", Ysum/N);
}
}
}