Benchmarking Crisis in Social Media Analytics: A Solution for the Data-Sharing Problem. (December 2022)

• Record Type: Journal Article
• Authors: Assenmacher, Dennis; Weber, Derek; Preuss, Mike; Calero Valdez, André; Bradshaw, Alison; Ross, Björn; Cresci, Stefano; Trautmann, Heike; Neumann, Frank; Grimme, Christian
• Is Part Of: Social science computer review. Volume 40:Number 6(2022)
• Page Start: 1496
• Page End: 1522
• Publication Date: 2022-12
• Subjects: social media analytics -- benchmarking -- social computing -- reproducibility; Social sciences -- Data processing -- Periodicals; Computers -- Social aspects -- Periodicals; Microcomputers -- Periodicals; Sciences sociales -- Informatique -- Périodiques; Micro-ordinateurs -- Périodiques; 300.285
• DOI: 10.1177/08944393211012268
• Languages: English
• ISSNs: 0894-4393

Abstract

Computational social science uses computational and statistical methods in order to evaluate social interaction. The public availability of data sets is thus a necessary precondition for reliable and replicable research. These data allow researchers to benchmark the computational methods they develop, test the generalizability of their findings, and build confidence in their results. When social media data are concerned, data sharing is often restricted for legal or privacy reasons, which makes the comparison of methods and the replicability of research results infeasible. Social media analytics research, consequently, faces an integrity crisis. How is it possible to create trust in computational or statistical analyses, when they cannot be validated by third parties? In this work, we explore this well-known, yet little discussed, problem for social media analytics. We investigate how this problem can be solved by looking at related computational research areas. Moreover, we propose and implement a prototype to address the problem in the form of a new evaluation framework that enables the comparison of algorithms without the need to exchange data directly, while maintaining flexibility for the algorithm design.