2025-01-29 19:06:26 -05:00
|
|
|
|
2025-01-29 18:54:30 -05:00
|
|
|
// derived from https://git.dervland.net/biglyderv/new-bigly-chat/src/branch/master/docs/stats.php
|
|
|
|
function rankCalc(result, iterations = 10) {
|
|
|
|
let matrixe = {}
|
|
|
|
let fng = {};
|
2025-01-29 19:06:26 -05:00
|
|
|
let fnc = {};
|
2025-01-29 18:54:30 -05:00
|
|
|
let frs = {};
|
|
|
|
let msum_old = 0;
|
|
|
|
let pr = {};
|
2025-01-29 19:06:26 -05:00
|
|
|
|
2025-01-29 18:54:30 -05:00
|
|
|
for (let unn in result) {
|
|
|
|
matrixe[unn] = {};
|
2025-01-29 19:06:26 -05:00
|
|
|
matrixe[unn][unn] = 1;
|
2025-01-29 18:54:30 -05:00
|
|
|
frs[unn] = result[unn].followers;
|
|
|
|
fng[unn] = result[unn].following;
|
2025-01-30 07:59:30 -05:00
|
|
|
fnc[unn] = Object.keys(fng[unn]).length;
|
2025-01-29 18:54:30 -05:00
|
|
|
pr[unn] = 1;
|
|
|
|
}
|
|
|
|
|
2025-01-29 19:06:26 -05:00
|
|
|
for (let unn in result) {
|
2025-01-29 18:54:30 -05:00
|
|
|
let fnu = frs[unn];
|
|
|
|
for (let follow of fnu) {
|
|
|
|
if (follow == unn) continue;
|
|
|
|
let dst = fnc[fnu] || 0;
|
|
|
|
matrixe[unn][follow] = 1 + 0.1 / (dst + 10);
|
|
|
|
msum_old += matrixe[unn][follow];
|
|
|
|
}
|
|
|
|
for (let unn2 in result) {
|
|
|
|
if (!matrixe[unn][unn2]) {
|
|
|
|
matrixe[unn][unn2] = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2025-01-29 19:06:26 -05:00
|
|
|
|
2025-01-29 18:54:30 -05:00
|
|
|
for (let i = 0; i < iterations; i++) {
|
2025-01-30 07:59:30 -05:00
|
|
|
let prold = pr;
|
|
|
|
let matrixf = matrixe;
|
|
|
|
|
|
|
|
pr = [];
|
|
|
|
matrixe = [];
|
2025-01-29 18:54:30 -05:00
|
|
|
let msum = 1;
|
|
|
|
|
|
|
|
for (let una in result) {
|
|
|
|
pr[una] = 0;
|
2025-01-30 07:59:30 -05:00
|
|
|
matrixe[una] = [];
|
2025-01-29 18:54:30 -05:00
|
|
|
if (frs[una].length == 0) continue;
|
|
|
|
|
|
|
|
for (let unb in result) {
|
2025-01-29 19:07:09 -05:00
|
|
|
let prb = prold[unb];
|
2025-01-30 07:59:30 -05:00
|
|
|
if (prb < 1 / 1e4 || fnc[unb] == 0) {
|
2025-01-29 18:54:30 -05:00
|
|
|
//msum += matrixe[una][unb];
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
matrixe[una][unb] = 0.03;
|
|
|
|
|
|
|
|
for (let unc in result) {
|
|
|
|
matrixe[una][unb] += matrixf[una][unc] * matrixf[unc][unb];
|
|
|
|
}
|
|
|
|
|
|
|
|
msum += matrixe[una][unb];
|
2025-01-30 07:59:30 -05:00
|
|
|
pr[una] += prb * msum;
|
2025-01-29 18:54:30 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
for (let una in result) {
|
|
|
|
if ((frs[una]).length == 0) continue;
|
|
|
|
|
|
|
|
for (let unb in result) {
|
|
|
|
matrixe[una][unb] *= msum_old / msum;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2025-01-29 19:07:42 -05:00
|
|
|
let new_sum = Object.values(pr).reduce((a, b) => a + b, 0)
|
2025-01-29 18:54:30 -05:00
|
|
|
|
|
|
|
for (let unn in result) {
|
|
|
|
pr[unn] /= new_sum;
|
|
|
|
}
|
2025-01-30 07:59:30 -05:00
|
|
|
|
2025-01-29 19:06:26 -05:00
|
|
|
console.log(`Iteration ${i} calculated`);
|
2025-01-29 18:54:30 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
return pr;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
2025-01-30 07:59:30 -05:00
|
|
|
export {
|
|
|
|
rankCalc
|
|
|
|
}
|