HackerPapers

arXiv:1507.05224cs.SI

Quantifying Controversy in Social Media

Kiran Garimella, Gianmarco De Francisci Morales, Aristides Gionis, Michael Mathioudakis

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

Abstract

Which topics spark the most heated debates on social media? Identifying those topics is not only interesting from a societal point of view, but also allows the filtering and aggregation of social media content for disseminating news stories. In this paper, we perform a systematic methodological study of controversy detection by using the content and the network structure of social media. Unlike previous work, rather than study controversy in a single hand-picked topic and use domain specific knowledge, we take a general approach to study topics in any domain. Our approach to quantifying controversy is based on a graph-based three-stage pipeline, which involves (i) building a conversation graph about a topic; (ii) partitioning the conversation graph to identify potential sides of the controversy; and (iii) measuring the amount of controversy from characteristics of the graph. We perform an extensive comparison of controversy measures, different graph-building approaches, and data sources. We use both controversial and non-controversial topics on Twitter, as well as other external datasets. We find that our new random-walk-based measure outperforms existing ones in capturing the intuitive notion of controversy, and show that content features are vastly less helpful in this task.

arXiv comments
Accepted in the journal Transactions on Social Computing (TSC). Extended version of the WSDM 2016 and CSCW 2016 demo paper. Please cite the TSC/WSDM version and not the arxiv version
Journal reference
DOI
Subjects
cs.SISocial and Information Networks

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Aug 2015 to Aug 2015. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.