0 sats \ 2 replies \ @k00b OP 25 Aug 2023 \ parent \ on: What are the top reasons someone SHOULD NOT use Stacker News? meta
I'm sorry. I realize now that probably came off pretty brash. I was not suggesting you are naive. I was just being blunt because you were being a touch presumptive, but I should be happy you've put in the work that you have and I am. (It's just a lot of work to untangle presumptions and I'm so time-poor that it triggers me. Again, I'm sorry. It's not the person I want to be.)
It's not possible the way you describe it. It's likely possible if paired with other exceptional circumstances. It's hard to explain why but the algorithm biases away from trust clusters.
Naive pagerank (power method) has a runtime complexity of O(N^2). If you look at our algorithm more closely, you'll see we have O(N^3) because we are effectively running the power method N times.
No worries, I understand as you do that it's hard to give advice to programmers of unknown competence without falling arwy of tending towards either "have you tried turning it on and off again?" or "have you noticed your (publically) cron-jobbed
O(n^3) algorithm can be reduced to O(m+n)"? DIdn't mean to come off as concescending with the "you need more tests" comment, I make that observation in nearly every project I consult on.I believe your business plan and architecture is inherently flawed due to the reasons of power user manipulation I've outlined, but I enjoy your site atm and respect the effort you put in to it. Thanks for your time in responding.
reply
❤️🫂
reply