a2liu / DSFP

This is my final project for Data Structures and Algorithms: a version of the fictional app "MeowMeowBeenz" from the tv show Community. Written in Java and SQL.
0 stars 0 forks source link

Updating social graph #17

Open A1Liu opened 6 years ago

A1Liu commented 6 years ago

Just keep the rest of the network static. No need to keep whole network exact, calculate exact values for specific subsection then let the rest go.

Sent with GitHawk

A1Liu commented 6 years ago

Also pagerank

Sent with GitHawk

A1Liu commented 6 years ago

And the range should be maybe 2 removed from the user receiving the rating using BFS

Sent with GitHawk

A1Liu commented 6 years ago

Ok so limiting range with a hard cap will have unintended consequences in the long run. How about having a threshold for increasing the range at a specific point? Like maybe a "node significance" score, so insignificant nodes don't cause a spreading of the update. I guess it would be quantified by the ratio of that node's score to the nodes that it has rated? I need to think about the significance score more.