检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Guo Xiangbo Wang Jian Huang Mengjie Wang Minghui Yang Jian Yu Yongtao
机构地区:[1]School of Computer and Artificial Intelligence,Zhengzhou University,Zhengzhou 450001,China [2]Yunnan Key Laboratory of Smart City in Cyberspace Security,Yuxi Normal University,Yuxi 653100,China
出 处:《The Journal of China Universities of Posts and Telecommunications》2023年第1期17-27,共11页中国邮电高校学报(英文版)
基 金:supported by the National Natural Science Foundation of China(61972133);Plan for“1125”Innovation Leading Talent of Zhengzhou City(2019);the Opening Foundation of Yunnan Key Laboratory of Smart City in Cyberspace Security(202105AG070010);Zhengzhou University Professors’Assisting Enterprises’Innovation-Driven Development Project(32213409)。
摘 要:Knowledge tracking(KT)algorithm,which can model the cognitive level of learners,is a fundamental artificial intelligence approach to solve the personalized learning problem in the field of education.The recently presented separated self-attentive neural knowledge tracing(SAINT)algorithm has got a great improvement on predictingthe accuracy of students’answers in comparison with the present other methods.However there is still potential to enhance its performance for it fails to effectively utilize temporal features.In this paper,an optimization algorithm for SAINT based on Ebbinghaus’law of forgetting was proposed which took temporal features into account.The proposed algorithm used forgetting law-based data binning to discretize the time information sequences,so as to obtain the temporal featuresin accordance with people’s forgetting pattern.Then the temporal features were used as input in the decoder of SAINT model to improve its accuracy.Ablation experiments and comparison experiments were performed on the EdNet dataset in order to verify the effectiveness of the proposed model.Seen in the experimental results,it achieved higher area under curve(AUC)values than the other present representative knowledge tracing algorithms.It demonstrates that temporal featuresare necessary for KT algorithms if it can be properly dealt with.
关 键 词:KNOWLEDGE tracking NEURAL network ATTENTION mechanism PERSONALIZED learning Ebbinghaus' LAW of FORGETTING
分 类 号:TP18[自动化与计算机技术—控制理论与控制工程] G434[自动化与计算机技术—控制科学与工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:52.15.53.236