3 ms·
No, you're absolutely right. The closure of anyone over friendship is likely all people. But I think there's a scoring mechanism that's possible using a graph
by renewiltord 6y ago
No, you're absolutely right. The closure of anyone over friendship is likely all people.
But I think there's a scoring mechanism that's possible using a graph model that can usually reveal whether you want to see a person's comments or not.
For the moment, I just settle for the opposite bias: there are people who I want to read what I say, but I don't let them. Instead I just settle for a group that most of the time also feels that way.
- chaboud 6y ago"The closure of anyone over friendship is likely all people." Except Ted. Nobody likes Ted, and he has no friends. Yes, you, Ted. You know who you are. Joking aside, an aggregate measure of proximal association and affiliation is useful, but it is also likely fundamentally incomplete and incoherent over even a small subset of modes of affiliation (e.g. coders, windsurfers, rock climbers, pianists, frisbee players, race drivers, book collectors, DJs, etc). That said, a heuristic that generally improves the real probability of alignment, enjoyment and engagement is definitely possible. The most entertaining part of this is that, with Aggregability being an NP-Hard problem, there will probably always be room for improvement in this problem category. So game on.