z-logo
open-access-imgOpen Access
A comparative study of online communities and popularity of BBS in four Chinese universities
Author(s) -
Haonan Yang,
Xiaowei Xu,
Haili Liang,
Xiaofan Wang
Publication year - 2020
Publication title -
plos one
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.99
H-Index - 332
ISSN - 1932-6203
DOI - 10.1371/journal.pone.0234469
Subject(s) - popularity , latent dirichlet allocation , computer science , similarity (geometry) , bulletin board system , world wide web , bulletin board , preference , data science , internet privacy , topic model , information retrieval , the internet , psychology , artificial intelligence , social psychology , statistics , mathematics , image (mathematics) , operating system
Online forums in Chinese universities play an important role in understanding collective behavior of college students. Of particular interest are community and popularity. We address these two issues by examining data from Bulletin Board Systems (BBSs) of four Chinese universities. To characterize users’ behavior, we introduce a hypothesis test to infer individual preferred boards, which yields a polarization of users. We also perform a multilevel algorithm to detect communities of each BBS network. We measure the similarity between the board-preferred polarization and the algorithmically identified community structure by quantitative and visual tools. The resulting discrepancy indicates that board labels are inadequate to represent underlying communities. To reveal online popularity, we employ latent Dirichlet allocation to mine topics from threads to compare popularity in different universities. Based on which, we implement the Cox-Stuart test to explore the change in popularity over time and reproduce significantly ascending and descending topics around a decade. Finally, we devise a two-step model based on users’ preference and interests to reproduce the observed connectivity patterns.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here