4 ms·
This seems to be a sort of iterative clustering of a graph to find highly connected nodes. I suppose a similar result is reached by sorting users in a sub-grap
by scrrr 13y ago
This seems to be a sort of iterative clustering of a graph to find highly connected nodes.
I suppose a similar result is reached by sorting users in a sub-graph by the time they spend online on that social network, since more time spent online probably means more "friends".
- mathattack 13y agoIt seems like they're looking for a large amount groups of people who are tightly connected.
- thejulielogan 13y agoMore time online does not mean more "friends," quality of engagement while online does. Troll for 10 hours and not interact...0 new friends. Interact for 1 hour in a quality way...2 new friends.
- deleted 13y ago[deleted]
- marcosdumay 13y agoThey remove the most connected nodes at each step. The one thing this algorithm is not usefull for is for finding hightly connected nodes.