-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMatrices.js
More file actions
95 lines (80 loc) · 1.89 KB
/
Matrices.js
File metadata and controls
95 lines (80 loc) · 1.89 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
function matrixMultiply(a, b) {
var res = [];
var n = a[0].length;
var m = a.length;
var p = b[0].length;
for (var i = 0; i < m; i++) {
var arr = [];
for (var j = 0; j < p; j++) {
arr.push(0);
}
res.push(arr);
}
for(var i = 0; i < m; i++) {
for(var j = 0; j < p; j++) {
for(var k = 0; k < n; k++) {
res[i][j] += a[i][k] * b[k][j];
}
}
}
return res;
}
function transpose(a) {
var res = [];
for (var i = 0; i < a.length; i++) {
res[i] = [a[i]];
}
return res;
}
function applySigmoid(a) {
var res = [];
// We know that res will be a n * 1 matrix
for (var i = 0; i < a.length; i++) {
res.push([1 / (1 + Math.pow(Math.E, a[i][0] * (-1)))]);
}
return res;
}
function mutate(a, diff) {
var res = [];
for (var i = 0; i < a.length; i++) {
res.push([]);
for (var j = 0; j < a[0].length; j++) {
if (Math.random() < 0.6) {
res[i][j] = a[i][j] + diff;
} else {
res[i][j] = a[i][j]
}
}
}
return res;
}
function averageMatrices(a, b) {
var res = [];
for (var i = 0; i < a.length; i++) {
res.push([]);
for (var j = 0; j < a[0].length; j++) {
res[i][j] = (a[i][j] + b[i][j]) / 2;
}
}
return res;
}
function crossover(a, b) {
var res1 = [];
var res2 = [];
for (var i = 0; i < a.length; i++) {
var x = [];
var y = [];
for (var j = 0; j < a[0].length; j++) {
if (Math.random() < 0.5) {
x.push(a[i][j]);
y.push(b[i][j]);
} else {
x.push(b[i][j]);
y.push(a[i][j]);
}
}
res1.push(x);
res2.push(y);
}
return [res1, res2];
}