{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T14:27:46Z","timestamp":1775744866307,"version":"3.50.1"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62032025"],"award-info":[{"award-number":["62032025"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61973325"],"award-info":[{"award-number":["61973325"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Natural Science Foundations of Guangdong Province","award":["2021A1515011661"],"award-info":[{"award-number":["2021A1515011661"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Sci. Eng."],"published-print":{"date-parts":[[2022,7,1]]},"DOI":"10.1109\/tnse.2022.3166655","type":"journal-article","created":{"date-parts":[[2022,4,12]],"date-time":"2022-04-12T19:37:48Z","timestamp":1649792268000},"page":"2579-2588","source":"Crossref","is-referenced-by-count":71,"title":["FA-GNN: Filter and Augment Graph Neural Networks for Account Classification in Ethereum"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8158-3735","authenticated-orcid":false,"given":"Jieli","family":"Liu","sequence":"first","affiliation":[{"name":"School of Software Engineering, Sun Yat-sen University, Zhuhai, China"}]},{"given":"Jiatao","family":"Zheng","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Sun Yat-sen University, Guangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5155-8547","authenticated-orcid":false,"given":"Jiajing","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Sun Yat-sen University, Guangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7872-7718","authenticated-orcid":false,"given":"Zibin","family":"Zheng","sequence":"additional","affiliation":[{"name":"School of Software Engineering, Sun Yat-sen University, Zhuhai, China"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Ethereum: A secure decentralised generalised transaction ledger","author":"Wood"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1504\/IJWGS.2018.095647"},{"key":"ref3","article-title":"Crypto crime trends for 2022: Illicit transaction activity reaches all-time high in value, all-time low in share of all cryptocurrency activity"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2021.103139"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8486401"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2020.2970113"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2021.3049278"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2018.2883678"},{"key":"ref9","article-title":"Bitcoin: A peer-to-peer electronic cash system","author":"Nakamoto"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3391195"},{"key":"ref11","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. 5th Int. Conf. Learn. Represent.","author":"Kipf","year":"2017"},{"key":"ref12","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst","author":"Hamilton","year":"2017"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330925"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113318"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2020.102462"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2020.3016821"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/621"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3398071"},{"key":"ref19","first-page":"1","article-title":"FastGCN: Fast learning with graph convolutional networks via importance sampling","volume-title":"Proc. 5th Int. Conf. Learn. Represent.","author":"Chen","year":"2018"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403296"},{"key":"ref21","first-page":"1","article-title":"Inductive representation learning on temporal graphs","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Xu","year":"2020"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380073"},{"key":"ref23","first-page":"7793","article-title":"Beyond homophily in graph neural networks: Current limitations and effective designs","author":"Zhu","year":"2020","journal-title":"Proc. Adv. Neural Inf. Process. Syst"},{"key":"ref24","first-page":"1","article-title":"Geom-GCN: Geometric graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Pei","year":"2020"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2022.3161112"},{"key":"ref26","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: An Introduction","author":"Newman","year":"2010"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1609\/icwsm.v4i1.14033"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.soc.27.1.415"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref30","first-page":"496","article-title":"Link-based classification","volume-title":"Proc. Int. Conf. Mach. Learn","author":"Lu","year":"2003"},{"key":"ref31","first-page":"1","article-title":"Query-driven active surveying for collective classification","volume-title":"Proc. Int. Conf. Mach. Learn. ICML Work. MLG","author":"Namata","year":"2012"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2011.12.021"},{"key":"ref33","first-page":"6861","article-title":"Simplifying graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn. Projection-method Learn. Rule","author":"Wu","year":"2019"},{"key":"ref34","first-page":"1","article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Kingma","year":"2015"}],"container-title":["IEEE Transactions on Network Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6488902\/9808096\/09756314.pdf?arnumber=9756314","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T21:12:08Z","timestamp":1705957928000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9756314\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,1]]},"references-count":34,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tnse.2022.3166655","relation":{},"ISSN":["2327-4697","2334-329X"],"issn-type":[{"value":"2327-4697","type":"electronic"},{"value":"2334-329X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,1]]}}}