Abstract

US Senate is the venue of political debates where the federal bills are formed and voted. Senators show their support/opposition along the bills with their votes. This information makes it possible to extract the polarity of the senators. We use signed bipartite graphs for modeling debates, and we propose an algorithm for partitioning both the senators, and the bills comprising the debate into binary opposing camps. Simultaneously, our algorithm scales both the senators and the bills on a univariate scale. Using this scale, a researcher can identify moderate and partisan senators within each camp, and polarizing vs. unifying bills. We applied our algorithm on all the terms of the US Senate to the date for longitudinal analysis and developed a web based interactive user interface www.PartisanScale.com to visualize the analysis. Copyright is held by the International World Wide Web Conference Committee (IW3C2).

Original languageEnglish (US)
Title of host publicationWWW'12 - Proceedings of the 21st Annual Conference on World Wide Web Companion
Pages349-352
Number of pages4
DOIs
StatePublished - May 21 2012
Event21st Annual Conference on World Wide Web, WWW'12 - Lyon, France
Duration: Apr 16 2012Apr 20 2012

Publication series

NameWWW'12 - Proceedings of the 21st Annual Conference on World Wide Web Companion

Other

Other21st Annual Conference on World Wide Web, WWW'12
CountryFrance
CityLyon
Period4/16/124/20/12

    Fingerprint

Keywords

  • Community discovery
  • HITS
  • Link analysis
  • Partitioning
  • Ranking
  • Scaling
  • Signed bipartite graphs
  • Spectral clustering

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Gokalp, S., & Davulcu, H. (2012). Partisan scale. In WWW'12 - Proceedings of the 21st Annual Conference on World Wide Web Companion (pp. 349-352). (WWW'12 - Proceedings of the 21st Annual Conference on World Wide Web Companion). https://doi.org/10.1145/2187980.2188046