https://combinatorialpress.com/jcmcc-articles/volume-127a/research-on-the-design-of-intelligent-instructional-paths-for-english-grammar-teaching-based-on-ant-colony-algorithm-under-higher-order-cognitive-computing-framework/
Bibliographic record
Abstract
Higher-order cognitive computational modeling focuses on the large amount of data generated by learners during their educational activities in order to make predictions and inferences and obtain their cognitive characteristics.In this paper, the original ant colony system algorithm is improved.Considering learners as ants, through state transfer probability calculation, pheromone updating, and continuous iteration of multiple ants with the same cognitive characteristics, the optimal teaching path suitable for the learner can be derived.After analyzing, it can be seen that comparing with the data of other GA and ACO algorithms, the improved ACO algorithm in this paper achieves the optimal training effect.By setting up the experimental group and the control group, it can be found that the teaching paths of the five students who did not use the method of this paper were all longer.Therefore, a concise and precise teaching path can be designed from the complicated learning resources and activities.Compared to the control group, the students in the experimental group presented more significant grammar scores and grammar learning attitudes (p<0.001).
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.000 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.003 | 0.005 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.006 | 0.003 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.694 | 0.531 |
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; the direct Gemma label and the distilled Codex classifier agree on what is shown here.
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".