Research Data

Permanent URI for this collectionhttps://www.weizenbaum-library.de/handle/id/977

Browse

Author: search.filters.author.Fan, YangliuSubject: search.filters.subject.bibliometrics

Search Results

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    Digital Turn Without Digital Methods? Mapping the Journey of Journalism Studies [Dataset]
    (2025) Fan, Yangliu; Ohme, Jakob; Neuberger, Christoph
    Recent years have seen a growing diversity in journalism studies, primarily ascribed to digital transformation in the contemporary context. Analyzing 6,770 publications from the five major journalism journals—Journalism, Journalism & Mass Communication Quarterly, Journalism Practice, Journalism Studies, and Digital Journalism—between 1995 and 2022, we find new evidence that the digital turn is highly visible in journalism studies. Using document co-citation analysis, we first have identified distinct and coherent, yet loosely integrated, research clusters that focus on different journalistic topics, i.e., specialties. Second, we find that digital journalism has not only been integrated into the research agendas within the field but has also formed stand-alone and distinct research clusters. We further show that field structure has developed over the years in response to digital transformation. Yet, digital and computational methods remain in the stark minority compared with the more traditional methods. Our results suggest that journalism studies could benefit from novel inter-cluster communications and methodological innovations.
  • Thumbnail Image
    Item
    Supplementary Information: “Extracting the interdisciplinary specialty structures in social media data-based research: A clustering-based network approach”
    (2022) Fan, Yangliu; Lehmann, Sune; Blok, Anders
    In this Supplementary Information, we provide the additional analyses of authors and detail the results for network analysis that we present in the paper. The weighted network is generally represented as a graph G = (V, E, 𝜔) with a weight 𝜔 assigned to each edge, where V is the graph's vertex set, and E is the edge set. We assume that G is a simple undirected graph with no multiple edges or loops, and edges have no orientations. S1 Author-level analysis S2 Comparison of the two network filtering techniques S3 Network statistics S4 The disciplinary composition of clusters in the networks