{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T18:40:25Z","timestamp":1765392025173,"version":"3.46.0"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/access.2025.3637528","type":"journal-article","created":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T19:05:14Z","timestamp":1764183914000},"page":"204759-204772","source":"Crossref","is-referenced-by-count":0,"title":["MOOC Dropout Prediction Using Explainable Relational Graph Convolution"],"prefix":"10.1109","volume":"13","author":[{"given":"Yang","family":"Guo","sequence":"first","affiliation":[{"name":"Development Planning and Discipline Construction Department, NUIST, Nanjing, Jiangsu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-5621-7063","authenticated-orcid":false,"given":"Yijia","family":"He","sequence":"additional","affiliation":[{"name":"College of Computing, NUIST, Nanjing, Jiangsu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1177\/0735633118757015"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.3301517"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3045157"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.121187"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.3390\/math10142483"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TE.2024.3398771"},{"key":"ref7","article-title":"Online academic course performance prediction using relational graph convolutional neural network","author":"Karimi","year":"2020","journal-title":"Int. Educ. Data Mining Soc."},{"key":"ref8","article-title":"Academic performance estimation with attention-based graph convolutional networks","author":"Hu","year":"2019","journal-title":"arXiv:2001.00632"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/W14-4111"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2018.07.007"},{"key":"ref11","article-title":"Spectral networks and locally connected networks on graphs","author":"Bruna","year":"2013","journal-title":"arXiv:1312.6203"},{"article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Kipf","key":"ref12"},{"key":"ref13","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","volume":"30","author":"Hamilton"},{"article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Veli\u010dkovi\u0107","key":"ref14"},{"key":"ref15","article-title":"Temporal graph networks for deep learning on dynamic graphs","author":"Rossi","year":"2020","journal-title":"arXiv:2006.10637"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93417-4_38"},{"article-title":"Graph contrastive learning with augmentations","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","author":"You","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313488"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.cell.2020.01.021"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219890"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403085"},{"article-title":"GNNExplainer: Generating explanations for graph neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ying","key":"ref22"},{"key":"ref23","first-page":"19620","article-title":"Parameterized explainer for graph neural network","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Luo"},{"key":"ref24","first-page":"12241","article-title":"On explainability of graph neural networks via subgraph explorations","volume-title":"Proc. 38th Int. Conf. Mach. Learn.","author":"Yuan"},{"article-title":"Explainability techniques for graph convolutional networks","volume-title":"Proc. ICML Workshop Learn. Reasoning Graph-Structured Represent.","author":"Baldassarre","key":"ref25"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.01103"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3115452"},{"key":"ref28","first-page":"12225","article-title":"PGM-Explainer: Probabilistic graphical model explanations for GNNs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Vu"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645599"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3126973.3126990"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2022.108409"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/11269760.pdf?arnumber=11269760","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T18:33:57Z","timestamp":1765391637000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11269760\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3637528","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2025]]}}}