Teacher-Guided Peer Learning With Continuous Action Iterated Dilemma Based on Incremental Network

IF 4.5 2区 计算机科学 Q1 COMPUTER SCIENCE, CYBERNETICS
Can Qiu;Dengxiu Yu;Zhen Wang;C. L. Philip Chen
{"title":"Teacher-Guided Peer Learning With Continuous Action Iterated Dilemma Based on Incremental Network","authors":"Can Qiu;Dengxiu Yu;Zhen Wang;C. L. Philip Chen","doi":"10.1109/TCSS.2023.3335162","DOIUrl":null,"url":null,"abstract":"This article proposes a teacher-guided peer learning approach that employs a continuous action iterated dilemma (CAID) model based on an incremental network. Traditional peer learning approaches often assume static communication relationships between students, which is not consistent with actual society, and this affects the effectiveness of peer learning. Additionally, every student is a highly unique individual, and using a single mathematical model to mimic their behavior would result in research findings with limited applicability. Therefore, this article presents several innovations. First, we propose an incremental network generation algorithm that generates an effective communication network to improve classroom efficiency by enhancing the convergence of information between classmates. Second, considering the multiple unknown nonlinear environmental impacts, we design a student dynamic model based on CAID with multiple layers of nonlinearity to fit the different environmental impacts that different students receive. Finally, based on the incremental network and student dynamic model, we design the Lyapunov function to prove the convergence of the proposed model. This mathematical proof ensures that the proposed model is stable and unaffected by parameters, making it more applicable.","PeriodicalId":13044,"journal":{"name":"IEEE Transactions on Computational Social Systems","volume":null,"pages":null},"PeriodicalIF":4.5000,"publicationDate":"2024-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Computational Social Systems","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10404003/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, CYBERNETICS","Score":null,"Total":0}
引用次数: 0

Abstract

This article proposes a teacher-guided peer learning approach that employs a continuous action iterated dilemma (CAID) model based on an incremental network. Traditional peer learning approaches often assume static communication relationships between students, which is not consistent with actual society, and this affects the effectiveness of peer learning. Additionally, every student is a highly unique individual, and using a single mathematical model to mimic their behavior would result in research findings with limited applicability. Therefore, this article presents several innovations. First, we propose an incremental network generation algorithm that generates an effective communication network to improve classroom efficiency by enhancing the convergence of information between classmates. Second, considering the multiple unknown nonlinear environmental impacts, we design a student dynamic model based on CAID with multiple layers of nonlinearity to fit the different environmental impacts that different students receive. Finally, based on the incremental network and student dynamic model, we design the Lyapunov function to prove the convergence of the proposed model. This mathematical proof ensures that the proposed model is stable and unaffected by parameters, making it more applicable.
基于增量网络的持续行动迭代困境下的教师引导式同伴学习
本文提出了一种教师指导的同伴学习方法,该方法采用了基于增量网络的连续行动迭代困境(CAID)模型。传统的同伴学习方法往往假设学生之间是静态的交流关系,这与社会实际不符,影响了同伴学习的效果。此外,每个学生都是高度独特的个体,使用单一的数学模型来模仿他们的行为会导致研究结果的适用性有限。因此,本文提出了几项创新。首先,我们提出了一种增量网络生成算法,该算法能生成有效的交流网络,通过加强同学间的信息汇聚来提高课堂效率。其次,考虑到多种未知的非线性环境影响,我们在 CAID 的基础上设计了多层非线性的学生动态模型,以适应不同学生受到的不同环境影响。最后,基于增量网络和学生动态模型,我们设计了 Lyapunov 函数来证明所提模型的收敛性。这一数学证明确保了所提出的模型是稳定的,不受参数的影响,使其更加适用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Computational Social Systems
IEEE Transactions on Computational Social Systems Social Sciences-Social Sciences (miscellaneous)
CiteScore
10.00
自引率
20.00%
发文量
316
期刊介绍: IEEE Transactions on Computational Social Systems focuses on such topics as modeling, simulation, analysis and understanding of social systems from the quantitative and/or computational perspective. "Systems" include man-man, man-machine and machine-machine organizations and adversarial situations as well as social media structures and their dynamics. More specifically, the proposed transactions publishes articles on modeling the dynamics of social systems, methodologies for incorporating and representing socio-cultural and behavioral aspects in computational modeling, analysis of social system behavior and structure, and paradigms for social systems modeling and simulation. The journal also features articles on social network dynamics, social intelligence and cognition, social systems design and architectures, socio-cultural modeling and representation, and computational behavior modeling, and their applications.
文献相关原料
公司名称 产品信息 采购帮参考价格
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信