TY - GEN
T1 - Partitioning and scaling signed bipartite graphs for polarized political blogosphere
AU - Gokalp, Sedat
AU - Temkit, M'hamed
AU - Davulcu, Hasan
AU - Toroslu, I. Hakki
PY - 2013
Y1 - 2013
N2 - Blogosphere plays an increasingly important role as a forum for public debate. In this paper, given a mixed set of blogs debating a set of political issues from opposing camps, we use signed bipartite graphs for modeling debates, and we propose an algorithm for partitioning both the blogs, and the issues (i.e. topics, leaders, etc.) comprising the debate into binary opposing camps. Simultaneously, our algorithm scales both the blogs and the underlying issues on a univariate scale. Using this scale, a researcher can identify moderate and extreme blogs within each camp, and polarizing vs. unifying issues. Through performance evaluations we show that our proposed algorithm provides an effective solution to the problem, and performs much better than existing baseline algorithms adapted to solve this new problem. In our experiments, we used both real data from political blogosphere and US Congress records, as well as synthetic data which were obtained by varying polarization and degree distribution of the vertices of the graph to show the robustness of our algorithm.
AB - Blogosphere plays an increasingly important role as a forum for public debate. In this paper, given a mixed set of blogs debating a set of political issues from opposing camps, we use signed bipartite graphs for modeling debates, and we propose an algorithm for partitioning both the blogs, and the issues (i.e. topics, leaders, etc.) comprising the debate into binary opposing camps. Simultaneously, our algorithm scales both the blogs and the underlying issues on a univariate scale. Using this scale, a researcher can identify moderate and extreme blogs within each camp, and polarizing vs. unifying issues. Through performance evaluations we show that our proposed algorithm provides an effective solution to the problem, and performs much better than existing baseline algorithms adapted to solve this new problem. In our experiments, we used both real data from political blogosphere and US Congress records, as well as synthetic data which were obtained by varying polarization and degree distribution of the vertices of the graph to show the robustness of our algorithm.
UR - http://www.scopus.com/inward/record.url?scp=84893613035&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84893613035&partnerID=8YFLogxK
U2 - 10.1109/SocialCom.2013.32
DO - 10.1109/SocialCom.2013.32
M3 - Conference contribution
AN - SCOPUS:84893613035
SN - 9780769551371
T3 - Proceedings - SocialCom/PASSAT/BigData/EconCom/BioMedCom 2013
SP - 168
EP - 173
BT - Proceedings - SocialCom/PASSAT/BigData/EconCom/BioMedCom 2013
PB - IEEE Computer Society
T2 - 2013 ASE/IEEE Int. Conf. on Social Computing, SocialCom 2013, the 2013 ASE/IEEE Int. Conf. on Big Data, BigData 2013, the 2013 Int. Conf. on Economic Computing, EconCom 2013, the 2013 PASSAT 2013, and the 2013 ASE/IEEE Int. Conf. on BioMedCom 2013
Y2 - 8 September 2013 through 14 September 2013
ER -