Research and Practice on Optimizing the Innovation of Teaching Methods for Civic and Political Education in Colleges and Universities Based on Deep Neural Networks
Bibliographic record
Abstract
This study focuses on the innovation of teaching methods for Civic Education in colleges and universities, and provides a structured knowledge framework for teaching by constructing a Civic Knowledge Mapping and integrating course knowledge points.On this basis, a new classroom teaching mode is designed to integrate online and offline teaching resources to enhance student interaction and participation.A knowledge tracking model of key-value memory network (MKVMN) based on multifeature fusion is proposed to accurately track students' mastery of Civics and Politics knowledge by capturing students' multi-dimensional learning behavior characteristics.To optimize the recommended path for students' personalized learning, an improved ant colony algorithm is introduced to generate personalized learning paths based on students' individual differences.The experimental results show that when the number of learning units is 0-10 (pre-study period), the improved ACO algorithm model does not have obvious advantages for students' learning, but when the number of learning units reaches 11-50, the difference between the experimental group students' learning performance and the control group becomes more and more obvious, so it can be seen that the improved ACO algorithm can obviously improve the students' Civic and Political Science learning performance.In addition, the IACS-PRA algorithm is especially effective in long path recommendation, which finds the optimal personalized recommendation path through a gradual approach to help students learn Civics and Political Science more efficiently, and provides a practical demonstration for the digital transformation of Civics and Political Science education in the new era.
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.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".