Research on Content innovation path design of ideological and political education in network environment based on artificial intelligence reinforcement learning
Bibliographic record
Abstract
This paper establishes a specific path for the realization of AI-enhanced learning on the content of Civic and Political Education, starting from the relevance, quality, novelty and intuitiveness of the teaching content.Through HTML parsing and other crawler technology to obtain the Civics education data on the news network, and extract the data characteristics of the Civics material, using the clustering rule algorithm, to classify the material.Decision tree calculation based on random forest is performed to dynamically expand and integrate the material, on this basis, using reinforcement learning recommendation algorithm, the Civic and political education content recommendation model is constructed, and the recommendation results of the algorithm are verified using simulation experiments.The experimental results show that the average success rate of the research-designed recommendation algorithm in the last 10 groups of experimental data is 25.218%, which is higher than that of the MK recommendation algorithm (18.03%), and the average time of the research-designed recommendation algorithm in the last 10 groups of data is 5.095s, which is more efficient than that of the MK recommendation algorithm (11.903s).After integrating the enhanced learning content recommendation in the Civics education, the students' humanism scale score was 100.56±12.364,with a p-value of less than 0.05, which was significantly higher than that before teaching.
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.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| 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".