Optimization and realization path of moral education flipped classroom teaching model based on intelligent computing in colleges and universities
Bibliographic record
Abstract
Flipped classroom teaching puts forward new requirements on the enthusiasm of students' independent learning, however, the traditional independent learning lacks scientific aids and cannot meet the individual needs of students in the process of self-study.Therefore, this paper exploits the neural network technology in intelligent computing technology to extract the deep implicit semantic representation, combines the implicit semantic indexing (LSI) to improve the traditional collaborative filtering algorithm, and explores an optimized implementation path of the flipped classroom teaching mode.The improved ICF algorithm outperforms the comparison algorithm in terms of recommendation accuracy, average recall, and average coverage in the three datasets.The computational time consumed is reduced by 44.85%, 57.34%, and 73.68%, respectively, compared with UCF.Incorporating the learning resource recommendation model constructed in this paper in a traditional flipped classroom, it is found that the post-test scores of the experimental class in Moral Education are significantly higher than those of the control class (p<0.01), and its post-test scores are significantly higher than its pre-test scores (p<0.01).The collaborative filtering algorithm optimized by intelligent computing technology facilitates students' personalized independent learning, innovates the general flipped classroom teaching mode, and receives the expected results.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".