I hereby claim:
- I am maasencioh on github.
- I am maasencioh (https://keybase.io/maasencioh) on keybase.
- I have a public key ASDaTArJ4TlWZIczHrs__rp6nqlUORqIzN2Rel_AvmumEQo
To claim this, I am signing this object:
Sede 2 | |
T:22.3H:45%UV:1 | |
C|01.07.2015|17:05:39 | |
T:22.2H:46%UV:1 | |
C|01.07.2015|17:11:05 | |
T:22.2H:46%UV:1 |
I hereby claim:
To claim this, I am signing this object:
var SLR = ML.Regression.SLR; | |
var inputs = [10, 20, 50, 75, 80]; | |
var outputs = [30, 50, 80, 100, 130]; | |
var regression = new SLR(inputs, outputs); | |
var y = regression.predict(85); | |
var min = 1000000; | |
var max = -100000; |
/* | |
* levmarq.c | |
* | |
* This file contains an implementation of the Levenberg-Marquardt algorithm | |
* for solving least-squares problems, together with some supporting routines | |
* for Cholesky decomposition and inversion. No attempt has been made at | |
* optimization. In particular, memory use in the matrix routines could be | |
* cut in half with a little effort (and some loss of clarity). | |
* | |
* It is assumed that the compiler supports variable-length arrays as |