Published on:
7 February 2024
Primary Category:
Social and Information Networks
Paper Authors:
Jingbang Chen,
Qiuyang Mang,
Hangrui Zhou,
Richard Peng,
Yu Gao,
Chenhao Ma
Allows disagreement within groups up to a tolerance level
New measure combines group size and amount of agreement
Algorithm is faster and finds better groups than other methods
Useful for identifying polarized communities in social networks
Adaptable to related tasks like portfolio analysis
Finding balanced groups allowing some disagreement
This paper introduces a new model to identify groups of connected individuals that mostly agree, but allows some disagreement. It is useful for finding polarized communities in social networks. They develop an efficient algorithm that finds larger, higher quality groups than previous methods.
No comments yet, be the first to start the conversation...
Sign up to comment on this paper