{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T05:00:10Z","timestamp":1780981210856,"version":"3.54.1"},"reference-count":60,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"HuaRong RongTong (Beijing) Technology Co., Ltd."}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2022,8,1]]},"DOI":"10.1109\/tkde.2020.3033829","type":"journal-article","created":{"date-parts":[[2020,10,26]],"date-time":"2020-10-26T20:43:46Z","timestamp":1603745026000},"page":"3841-3853","source":"Crossref","is-referenced-by-count":58,"title":["K-Core Based Temporal Graph Convolutional Network for Dynamic Graphs"],"prefix":"10.1109","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2526-8196","authenticated-orcid":false,"given":"Jingxin","family":"Liu","sequence":"first","affiliation":[{"name":"School of Software, Beihang University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chang","family":"Xu","sequence":"additional","affiliation":[{"name":"School of Software, Beihang University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chang","family":"Yin","sequence":"additional","affiliation":[{"name":"HuaRong RongTong (Beijing) Technology Co., Ltd, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weiqiang","family":"Wu","sequence":"additional","affiliation":[{"name":"Credit Card Center, China Bohai Bank Co., Ltd., Tianjin, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0236-859X","authenticated-orcid":false,"given":"You","family":"Song","sequence":"additional","affiliation":[{"name":"School of Software, Beihang University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2849727"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33017370"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/467"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220024"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098061"},{"key":"ref7","first-page":"2111","article-title":"Network representation learning with rich text information","volume-title":"Proc. 24th Int. Joint Conf. Artif. Intell.","author":"Yang"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939753"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.aiopen.2021.01.001"},{"key":"ref10","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf"},{"key":"ref11","article-title":"Graph attention networks","author":"Veli\u010dkovi\u0107"},{"key":"ref12","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Advances Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330950"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11257"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2822283"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90028-x"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322385"},{"key":"ref18","first-page":"2014","article-title":"Learning convolutional neural networks for graphs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Niepert"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219947"},{"key":"ref20","first-page":"3844","article-title":"Convolutional neural networks on graphs with fast localized spectral filtering","volume-title":"Proc. Advances Neural Inf. Process. Syst.","author":"Defferrard"},{"key":"ref21","article-title":"FastGCN: Fast learning with graph convolutional networks via importance sampling","author":"Chen"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1017\/9781108924184.009"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i12.17283"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-04167-0\\_33"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/614"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5984"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939751"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref30","article-title":"DynGEM: Deep embedding method for dynamic graphs","author":"Goyal"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11299"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220054"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5815"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-main.541"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11604"},{"key":"ref36","article-title":"Simplifying graph convolutional networks","author":"Wu"},{"key":"ref37","article-title":"Mixhop: Higher-order graph convolution architectures via sparsified neighborhood mixing","author":"Abu-El-Haija"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/267"},{"key":"ref39","article-title":"Predict then propagate: Graph neural networks meet personalized pagerank","author":"Klicpera"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/360"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0058"},{"key":"ref42","article-title":"An o (m) algorithm for cores decomposition of networks","author":"Batagelj"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330925"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1179"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220068"},{"key":"ref47","first-page":"547","article-title":"\u00c9tude comparative de la distribution florale dans une portion des alpes et des jura","volume":"37","author":"Jaccard","year":"1901","journal-title":"Bull. Soc. Vaudoise Sci. Nat."},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/775107.775126"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.73.026120"},{"key":"ref50","article-title":"Distilling the knowledge in a neural network","author":"Hinton"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/0893-6080(91)90009-T"},{"key":"ref52","article-title":"Neural relational inference for interacting systems","author":"Kipf"},{"key":"ref53","article-title":"Efficient estimation of word representations in vector space","author":"Mikolov","year":"2013"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.06.024"},{"key":"ref55","article-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2014"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69311-6_21"},{"issue":"2","key":"ref57","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1140\/epjb\/e2004-00111-4","article-title":"Betweenness centrality in large complex networks","volume":"38","author":"Barthelemy","year":"2004","journal-title":"Eur. Phys. J. B"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2015.04.006"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1038\/nphys1746"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-011-0841-3"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/9817411\/09240056.pdf?arnumber=9240056","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T20:33:40Z","timestamp":1736368420000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9240056\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,1]]},"references-count":60,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2020.3033829","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,1]]}}}