• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Sun Jianwen, Zhou Jianpeng, Liu Sannüya, He Feijuan, Tang Yun. Hierarchical Attention Network Based Interpretable Knowledge Tracing[J]. Journal of Computer Research and Development, 2021, 58(12): 2630-2644. DOI: 10.7544/issn1000-1239.2021.20210997
Citation: Sun Jianwen, Zhou Jianpeng, Liu Sannüya, He Feijuan, Tang Yun. Hierarchical Attention Network Based Interpretable Knowledge Tracing[J]. Journal of Computer Research and Development, 2021, 58(12): 2630-2644. DOI: 10.7544/issn1000-1239.2021.20210997

Hierarchical Attention Network Based Interpretable Knowledge Tracing

Funds: This work was supported by the Major Program of National Science and Technology Innovation 2030 of China for New Generation of Artificial Intelligence (2020AAA0108804), the National Natural Science Foundation of China (62077021, 61977030, 61937001, 61807011), the Natural Science Basic Research Program of Shaanxi Province (2020JM-711), the Shaanxi Provincial Education Science Regulations “Thirteenth Five-Year” Plan Project (SGH20Y1397), the Special Research Project of Xi’an Jiaotong University City College (KCSZ01006), and the Teaching Reform Research Project for Postgraduates of Central China Normal University (2020JG14).
More Information
  • Published Date: November 30, 2021
  • Knowledge tracing is a data-driven learner modeling technology, which aims to predict learners’ knowledge mastery or future performance based on their historical learning data. Recently, with the support of deep learning algorithms, deep learning-based knowledge tracing has become a current research hotspot in the field. Aiming at the problems that deep learning-based knowledge tracing models generally have ‘black-box’ attributes, the decision-making process or results lack interpretability, and it is difficult to provide high-value education services such as learning attribution analysis and wrong cause backtracking, a Hierarchical Attention network based Knowledge Tracing model (HAKT) is proposed. By mining the multi-dimensional and in-depth semantic association between questions, a network structure containing three-layer attention of questions, semantics and elements is established, where graph attention neural network and self-attention mechanism are utilized for question representation learning, semantic fusion and questions retrieve. A regularization term to improve model interpretability is introduced into the loss function, with which a trade-off factor is incorporated to balance predictive performance and interpretability of model. Besides, we define an interpretability measurement index for the prediction results—fidelity, which can quantitatively evaluate the model interpretability. Finally, the experimental results on 6 benchmark datasets show that our method effectively improves the model interpretability.
  • Related Articles

    [1]Xia Qing, Li Shuai, Hao Aimin, Zhao Qinping. Deep Learning for Digital Geometry Processing and Analysis: A Review[J]. Journal of Computer Research and Development, 2019, 56(1): 155-182. DOI: 10.7544/issn1000-1239.2019.20180709
    [2]Xu Xiao, Ding Shifei, Sun Tongfeng, Liao Hongmei. Large-Scale Density Peaks Clustering Algorithm Based on Grid Screening[J]. Journal of Computer Research and Development, 2018, 55(11): 2419-2429. DOI: 10.7544/issn1000-1239.2018.20170227
    [3]Sun Yong, Tan Wenan, Jin Ting, Zhou Liangguang. A Collaborative Collusion Detection Method Based on Online Clustering[J]. Journal of Computer Research and Development, 2018, 55(6): 1320-1332. DOI: 10.7544/issn1000-1239.2018.20170231
    [4]Xu Kai, Wu Xiaojun, Yin Hefeng. Distributed Low Rank Representation-Based Subspace Clustering Algorithm[J]. Journal of Computer Research and Development, 2016, 53(7): 1605-1611. DOI: 10.7544/issn1000-1239.2016.20148362
    [5]Zhang Shuai, Li Tao, Jiao Xiaofan, Wang Yifeng, Yang Yulu. Parallel TNN Spectral Clustering Algorithm in CPU-GPU Heterogeneous Computing Environment[J]. Journal of Computer Research and Development, 2015, 52(11): 2555-2567. DOI: 10.7544/issn1000-1239.2015.20148151
    [6]Zhu Hong, Ding Shifei, Xu Xinzheng. An AP Clustering Algorithm of Fine-Grain Parallelism Based on Improved Attribute Reduction[J]. Journal of Computer Research and Development, 2012, 49(12): 2638-2644.
    [7]Lu Weiming, Du Chenyang, Wei Baogang, Shen Chunhui, and Ye Zhenchao. Distributed Affinity Propagation Clustering Based on MapReduce[J]. Journal of Computer Research and Development, 2012, 49(8): 1762-1772.
    [8]Li Wenjun, Wang Jianxin, and Chen Jianer. An Improved Parameterized Algorithm for Hyperplane-Cover Problem[J]. Journal of Computer Research and Development, 2012, 49(4): 804-811.
    [9]Luo Xiaonan, Lin Mouguang, Ji Changbo, and Li Zhiyong. A Progressive Geometry Simplification Method for Mobile Computing Terminal[J]. Journal of Computer Research and Development, 2007, 44(6): 1038-1043.
    [10]Ou Xinliang, Chen Songqiao, Chang Zhiming. A Parallel Geometric Correction Algorithm Based on Dynamic Division-Point Computing[J]. Journal of Computer Research and Development, 2006, 43(6): 1115-1121.

Catalog

    Article views (737) PDF downloads (524) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return