A Deep Learning-Based Study on Predicting Changes in Data-Driven Opinion Dynamics in Social Media
Bibliographic record
Abstract
Under the background of mediatized society, the fusion of reality and reality between the real world and cyberspace has made the role of social network public opinion more and more significant, and the occurrence of any major emergencies will trigger network public opinion. In this paper, the TF-IDF algorithm is used to extract the feature items of social media opinion data, synthesize them into text vectors and input them into the LDA topic model to mine the opinion topic words, and then combine the co-occurrence of the key topic words to draw the semantic maps of the opinion topic words on the web, so as to explore the dynamic evolution of the opinion topic words. The opinion text vectors are then used as inputs to extract the local features of the opinion text through CNN model, combine with BiLSTM model to obtain the global features and temporal information of the opinion text, and realize the dynamic prediction of opinion sentiment through SoftMax classifier. Taking the Xin Guan epidemic event as an example, and divided into three phases: latent period, outbreak period and recession period, the number of public opinion comments on microblog platform during the outbreak period can reach 1942.59 comments/day, and the evolution of public opinion topic words in different public opinion phases are dominated by themes such as “epidemic”, “pneumonia” and so on. When the CNN-BiLSTM model is used to predict the public opinion sentiment dynamics, the prediction accuracy is between 95.84% and 97.56%. Through the effective use of deep learning technology, it can clarify the orientation of public opinion development driven by social media data and provide reliable data support for social media public opinion guidance.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".