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/

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).

Publication Details

Journal
Journal of Combinatorial Mathematics and Combinatorial Computing
Published
2025-03-30
DOI
https://doi.org/10.61091/jcmcc127a-434
Primary Topic
Cognitive Computing and Networks
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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/

Journal of Combinatorial Mathematics and Combinatorial Computing
Cognitive Computing and Networks
article

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/

article en

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).

Journal of Combinatorial Mathematics and Combinatorial ComputingVol. 127a
Hubei University of Automotive Technology, Hubei University
Openalex Percentile: Top 96%
Cognitive Computing and Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.