archive/bigly-caret
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

fast

Browse source
This commit is contained in:
dervperson 2025-01-31 16:09:33 -05:00
parent 0552a81c72
commit 354a9e75d2
1 changed files with 21 additions and 14 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

37
rank.js
View file

@ -5,6 +5,7 @@ function rankCalc(result, iterations = 10) {
let fng = {}; let fng = {};
let fnc = {}; let fnc = {};
let frs = {}; let frs = {};
let frsEasy = {};
let msum_old = 0.001; let msum_old = 0.001;
let pr = {}; let pr = {};
@ -34,9 +35,8 @@ function rankCalc(result, iterations = 10) {
let mm = (process.env.matrixIterations || iterations); let mm = (process.env.matrixIterations || iterations);
let discarded = 0; let rl = Object.keys(result).length;
let thk = Object.keys(result).length;
for (let i = 0; i < mm; i++) { for (let i = 0; i < mm; i++) {
let prold = pr; let prold = pr;
let matrixf = matrixe; let matrixf = matrixe;
@ -44,9 +44,8 @@ function rankCalc(result, iterations = 10) {
pr = []; pr = [];
matrixe = []; matrixe = [];
let msum = 1; let msum = 1;
let intv = Math.pow(1/1000,Math.pow(0.25, i / Math.sqrt(mm))); let intv = Math.pow(0.35 / rl, Math.pow(0.1, i / mm));
console.log(`Completed ${i} iterations with ${intv} threshold and ${discarded * 100}% discard rate`) console.log(`Completed ${i} iterations with ${intv} threshold`)
discarded = 0;
let th = -1; let th = -1;
for (let una in result) { for (let una in result) {
@ -56,25 +55,33 @@ function rankCalc(result, iterations = 10) {
if (frs[una].length == 0) { if (frs[una].length == 0) {
pr[una] = prold[una]; pr[una] = prold[una];
matrixe[una] = matrixf[una]; matrixe[una] = matrixf[una];
discarded += 1 / thk
continue; continue;
} }
for (let unb in result) { let ar = Object.keys(result);
let prb = prold[unb]; let rf = pr[una];
matrixe[una][unb] = 0.03;
if (prb < intv || fnc[unb] == 0) { for (let unb of ar) {
pr[una] = prold[una]; let prb = prold[unb];
discarded += Math.pow(thk,-2) * 0.9;
matrixe[una][unb] = 0.03;
msum += 0.03;
if (prb * matrixf[una][unb] < intv || fnc[unb] == 0) {
let mfb = matrixf[una][unb];
if (isNaN(mfb) || !mfb) continue;
pr[una] += prb * mfb;
continue; continue;
} }
for (let unc in result) { for (let unc in result) {
matrixe[una][unb] += matrixf[una][unc] * matrixf[unc][unb]; let mfc = matrixf[una][unc];
let mfb = matrixf[unc][unb];
if (isNaN(mfc) || isNaN(mfb) || !mfc || !mfb) continue;
matrixe[una][unb] += mfc * mfb;
} }
msum += matrixe[una][unb]; msum += matrixe[una][unb] - 0.03;
pr[una] += prb * matrixe[una][unb]; pr[una] += prb * matrixe[una][unb];
} }
} }
@ -88,7 +95,7 @@ function rankCalc(result, iterations = 10) {
} }
} }
let new_sum = Object.values(pr).reduce((a, b) => a + b, 0) let new_sum = Object.values(pr).filter(x => !isNaN(x)).reduce((a, b) => a + b, 0)
for (let unn in result) { for (let unn in result) {
pr[unn] /= new_sum; pr[unn] /= new_sum;