{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T14:34:39Z","timestamp":1785249279184,"version":"3.55.0"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Social Science Committee of Changde, Hunan, China","award":["CSP22ZZ06"],"award-info":[{"award-number":["CSP22ZZ06"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/access.2024.3401460","type":"journal-article","created":{"date-parts":[[2024,5,15]],"date-time":"2024-05-15T17:39:58Z","timestamp":1715794798000},"page":"74751-74761","source":"Crossref","is-referenced-by-count":2,"title":["Dynamic Heterogeneous Graph Learning: An Adaptive Research Academic Network"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-3530-7044","authenticated-orcid":false,"given":"Minghong","family":"Yang","sequence":"first","affiliation":[{"name":"School of Economics and Management, Hunan Applied Technology University, Changde, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-1749-2600","authenticated-orcid":false,"given":"Zhenhua","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Information Engineering, Hunan Applied Technology University, Changde, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.joi.2019.02.011"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICET.2018.8603661"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75530-2_10"},{"key":"ref4","doi-asserted-by":"crossref","volume-title":"Continuous time dynamic graph learning via neural interaction processes","author":"Chang","DOI":"10.1145\/3340531.3411946"},{"key":"ref5","volume-title":"Patent US11537852B2","author":"Chen"},{"key":"ref6","first-page":"10383","article-title":"Can graph neural networks count substructures","volume-title":"Proc. Conf. NIPS","author":"Chen"},{"key":"ref7","first-page":"15894","article-title":"On the equivalence between graph isomorphism testing and function approximation with GNNs","volume-title":"Proc. Conf. NIPS","author":"Chen"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098036"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2016.2521657"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2022.3172588"},{"key":"ref11","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. NIPS","author":"Hamilton"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380027"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450107"},{"key":"ref14","first-page":"3146","article-title":"LightGBM: A highly efficient gradient boosting decision tree","volume-title":"Proc. Int. Conf. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Ke"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2016.07.104"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1111\/1475-679X.12123"},{"key":"ref17","volume-title":"What graph neural networks cannot learn: Depth vs width","author":"Loukas"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2019.107000"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0049246"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5984"},{"key":"ref21","volume-title":"Temporal graph networks for deep learning on dynamic graphs","author":"Rossi"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.joi.2020.101039"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371845"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.116463"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1126\/science.1237825"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN52387.2021.9533711"},{"key":"ref27","first-page":"1","article-title":"Inductive representation learning on temporal graphs","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Xu"},{"key":"ref28","volume-title":"How powerful are graph neural networks?","author":"Xu"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063757"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3463028"},{"key":"ref31","first-page":"2141","article-title":"Modeling and predicting citation count via recurrent neural network with long short-term memory","volume-title":"Proc. 28th Int. Conf. AAAI. Artifi. Intell.","author":"Yuan"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1186\/s40649-019-0069-y"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1002\/asi.23612"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.3390\/info8030073"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.joi.2020.101128"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1126\/science.aal4217"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2942221"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2021.107936"},{"key":"ref39","first-page":"64","article-title":"Recurrent neural networks","volume":"5","author":"Medsker","year":"2001","journal-title":"Des. Appl."},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.15439\/2020F20"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.aiopen.2021.01.001"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1371"},{"key":"ref44","volume-title":"DyRep: Learning representations over dynamic graphs","author":"Trivedi"},{"key":"ref45","first-page":"13260","article-title":"Principal neighbourhood aggregation for graph nets","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","author":"Corso"},{"issue":"1","key":"ref46","first-page":"42","article-title":"Impact factor: A valid measure of journal quality?","volume":"91","author":"Saha","year":"2003","journal-title":"J. Med. Library Assoc."},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1002\/asi.22803"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1002\/asi.20262"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/j.joi.2016.02.007"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10380310\/10530958.pdf?arnumber=10530958","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T17:38:59Z","timestamp":1717177139000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10530958\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":49,"URL":"https:\/\/doi.org\/10.1109\/access.2024.3401460","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}