Proceedings of the 28th ACM International Conference on Information and Knowledge Management 2019
DOI: 10.1145/3357384.3357977
|View full text |Cite
|
Sign up to set email alerts
|

Discovering Polarized Communities in Signed Networks

Abstract: Signed networks contain edge annotations to indicate whether each interaction is friendly (positive edge) or antagonistic (negative edge). The model is simple but powerful and it can capture novel and interesting structural properties of real-world phenomena. The analysis of signed networks has many applications from modeling discussions in social media, to mining user reviews, and to recommending products in e-commerce sites.In this paper we consider the problem of discovering polarized communities in signed … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
47
0
1

Year Published

2019
2019
2024
2024

Publication Types

Select...
3
2
2

Relationship

3
4

Authors

Journals

citations
Cited by 53 publications
(48 citation statements)
references
References 52 publications
(66 reference statements)
0
47
0
1
Order By: Relevance
“…For example, (i) can we extend the current work to finding k-way polarized communities (k > 2)? (ii) how does the signed bipartiteness ratio compare with other polarization measures, such as Polarity proposed in [5]? (iii) how to enforce graph connectivity on both bands in a polarized community?…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…For example, (i) can we extend the current work to finding k-way polarized communities (k > 2)? (ii) how does the signed bipartiteness ratio compare with other polarization measures, such as Polarity proposed in [5]? (iii) how to enforce graph connectivity on both bands in a polarized community?…”
Section: Resultsmentioning
confidence: 99%
“…10 We scan the communities sequentially (in random order), keep track of the nodes that are covered so far and drop any communities that intersect with the covered nodes. [5], which counts the number of edges that agree with the polarized structure and penalizes large communities:…”
Section: Evaluation On Real-world Graphsmentioning
confidence: 99%
“…As expected, Eigen achieves higher density than Timbal. This can be explained by the fact that Eigen can be seen as optimizing the following objective [6]:…”
Section: Trading Off Balance and Graph Sizementioning
confidence: 99%
“…The 2correlation-clustering problem [7], also known as the frustration-index problem [2], is also widely studied. Finally, a more recent line of work introduces the problem of discovering antagonistic communities in signed networks [5].…”
Section: Related Workmentioning
confidence: 99%
“…Therefore, it has also been shown the importance of measuring to what extent an unbalanced signed network is close to be balanced [17]. Structural balance is also linked with group polarization, i.e., the division of a group of entities (e.g., nodes of a network) into two subgroups each reaching consensus and having opposite opinions [5]. Network visualization has emerged as a key complement to standard network analysis techniques to fill the gap between computation and interpretation, communicate findings, and deepen insight [16].…”
Section: Introductionmentioning
confidence: 99%