{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T19:32:53Z","timestamp":1730230373519,"version":"3.28.0"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,6,6]],"date-time":"2021-06-06T00:00:00Z","timestamp":1622937600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,6]],"date-time":"2021-06-06T00:00:00Z","timestamp":1622937600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,6]],"date-time":"2021-06-06T00:00:00Z","timestamp":1622937600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,6,6]]},"DOI":"10.1109\/icassp39728.2021.9414279","type":"proceedings-article","created":{"date-parts":[[2021,5,13]],"date-time":"2021-05-13T19:53:45Z","timestamp":1620935625000},"page":"3210-3214","source":"Crossref","is-referenced-by-count":1,"title":["Ego-Based Entropy Measures for Structural Representations on Graphs"],"prefix":"10.1109","author":[{"given":"George","family":"Dasoulas","sequence":"first","affiliation":[]},{"given":"Giannis","family":"Nikolentzos","sequence":"additional","affiliation":[]},{"given":"Kevin","family":"Seaman","sequence":"additional","affiliation":[]},{"given":"Aladin","family":"Virmaux","sequence":"additional","affiliation":[]},{"given":"Michalis","family":"Vazirgiannis","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"ref11","article-title":"Deep learning long- range information in undirected graphs with wave networks","author":"matlock","year":"2018","journal-title":"CoRR"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339723"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098061"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220025"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220068"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.83.036109"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555904"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00026-006-0289-3"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.4018\/jats.2009071005"},{"key":"ref28","article-title":"Graph attention networks","author":"veli?kovi?","year":"0","journal-title":"2018 ICLR"},{"key":"ref4","article-title":"Semi-Supervised Classification with Graph Convolutional Networks","author":"kipf","year":"0","journal-title":"ICLR 2017"},{"key":"ref27","article-title":"Capsule graph neural network","author":"xinyi","year":"2019","journal-title":"ICLRE"},{"key":"ref3","article-title":"How powerful are graph neural networks?","author":"xu","year":"0","journal-title":"ICLR 2019"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/294"},{"key":"ref5","article-title":"Variational graph auto-encoders","author":"kipf","year":"2016","journal-title":"CoRR"},{"key":"ref8","article-title":"Pairnorm: Tackling oversmoothing in gnns","author":"zhao","year":"2020","journal-title":"International Conference on Learning Representations"},{"key":"ref7","article-title":"Deeper insights into graph convolutional networks for semi- supervised learning","volume":"abs 1801 7606","author":"li","year":"2018","journal-title":"CoRR"},{"key":"ref2","article-title":"Representation learning on graphs: Methods and applications","author":"hamilton","year":"2017","journal-title":"CoRR"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2020.07.008"},{"key":"ref1","article-title":"Neural message passing for quantum chemistry","author":"gilmer","year":"0","journal-title":"ICML 2017"},{"journal-title":"ICML ’01","year":"2019","author":"chen","key":"ref20"},{"key":"ref22","article-title":"On the von Neumann entropy of graphs","author":"minello","year":"2018","journal-title":"Journal of Complex Networks"},{"article-title":"Fast computation of von neumann entropy for large-scale graphs via quadratic approximations","year":"2018","author":"choi","key":"ref21"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8113\/40\/28\/S18"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/zamm.19290090206"},{"key":"ref26","article-title":"An end-to-end deep learning architecture for graph classification","author":"zhang","year":"2018","journal-title":"AAAI"},{"key":"ref25","article-title":"Are powerful graph neural nets necessary? A dissection on graph classification","author":"chen","year":"2019","journal-title":"CoRR"}],"event":{"name":"ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2021,6,6]]},"location":"Toronto, ON, Canada","end":{"date-parts":[[2021,6,11]]}},"container-title":["ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9413349\/9413350\/09414279.pdf?arnumber=9414279","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:40:58Z","timestamp":1652197258000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9414279\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,6]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/icassp39728.2021.9414279","relation":{},"subject":[],"published":{"date-parts":[[2021,6,6]]}}}