{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:10:53Z","timestamp":1740100253548,"version":"3.37.3"},"reference-count":34,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T00:00:00Z","timestamp":1623974400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T00:00:00Z","timestamp":1623974400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T00:00:00Z","timestamp":1623974400000},"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":["62076065,61751202,61751205,61572540,U1813203,U1801262"],"award-info":[{"award-number":["62076065,61751202,61751205,61572540,U1813203,U1801262"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003392","name":"Natural Science Foundation of Fujian Province","doi-asserted-by":"publisher","award":["2020J01495"],"award-info":[{"award-number":["2020J01495"]}],"id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,6,18]]},"DOI":"10.1109\/spac53836.2021.9539905","type":"proceedings-article","created":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T22:13:55Z","timestamp":1632780835000},"page":"477-482","source":"Crossref","is-referenced-by-count":0,"title":["Contrastive Graph Representation Learning via Maximizing Mutual Information"],"prefix":"10.1109","author":[{"given":"Yuqi","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chun-Yang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4842-2766-4_12"},{"key":"ref31","article-title":"Graph cross networks with vertex infomax pooling","author":"li","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref30","article-title":"Heterogeneous deep graph infomax","author":"ren","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref34","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2014","journal-title":"ArXiv Preprint"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1016\/j.ins.2020.01.028","article-title":"Graph deconvolutional networks","volume":"518","author":"cyz","year":"2020","journal-title":"Information Sciences"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.03.022"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2008.11.006"},{"key":"ref13","article-title":"Stacked denoising autoencoders: Learning useful representations in a deep network with a local denoising criterion","volume":"11","author":"vincent","year":"2010","journal-title":"Journal of Machine Learning Research"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2019.106979"},{"key":"ref15","article-title":"Mine: mutual information neural estimation","author":"belghazi","year":"2018","journal-title":"ArXiv Preprint"},{"key":"ref16","article-title":"Learning deep representations by mutual information estimation and maximization","author":"hjelm","year":"2018","journal-title":"ArXiv Preprint"},{"key":"ref17","article-title":"Contrastive multiview coding","author":"tian","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref18","article-title":"Representation learning with contrastive predictive coding","author":"oord","year":"2018","journal-title":"ArXiv Preprint"},{"key":"ref19","article-title":"Deep graph infomax","author":"velickovic","year":"2019","journal-title":"ICLR (Poster)"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380112"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref27","article-title":"Graph attention networks","author":"veli?kovi?","year":"2017","journal-title":"ArXiv Preprint"},{"key":"ref3","article-title":"Relational inductive biases, deep learning, and graph networks","author":"battaglia","year":"2018","journal-title":"ArXiv Preprint"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330950"},{"key":"ref29","article-title":"Unsupervised hierarchical graph representation learning by mutual information maximization","author":"ding","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref5","first-page":"5241","article-title":"Gmnn: Graph markov neural networks","author":"qu","year":"0","journal-title":"International Conference on Machine Learning"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/asi.20591"},{"key":"ref7","article-title":"Variational graph auto-encoders","author":"kipf","year":"2016","journal-title":"ArXiv Preprint"},{"key":"ref2","article-title":"Representation learning on graphs: Methods and applications","author":"hamilton","year":"2017","journal-title":"ArXiv Preprint"},{"key":"ref9","article-title":"Link prediction based on graph neural networks","author":"zhang","year":"2018","journal-title":"ArXiv Preprint"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2017.2693418"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1995.7.6.1129"},{"key":"ref22","first-page":"1597","article-title":"A simple framework for contrastive learning of visual representations","author":"chen","year":"0","journal-title":"International Conference on Machine Learning"},{"key":"ref21","article-title":"f-gan: Training generative neural samplers using variational divergence minimization","author":"nowozin","year":"2016","journal-title":"ArXiv Preprint"},{"key":"ref24","article-title":"Unsupervised representation learning by predicting image rotations","author":"komodakis","year":"0","journal-title":"International Conference on Learning Representations (ICLR)"},{"key":"ref23","article-title":"A framework for contrastive self-supervised learning and designing a new approach","author":"falcon","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref26","article-title":"Fastgcn: fast learning with graph convolutional networks via importance sampling","author":"chen","year":"2018","journal-title":"ArXiv Preprint"},{"key":"ref25","article-title":"Inductive representation learning on large graphs","author":"hamilton","year":"2017","journal-title":"ArXiv Preprint"}],"event":{"name":"2021 International Conference on Security, Pattern Analysis, and Cybernetics\uff08SPAC\uff09","start":{"date-parts":[[2021,6,18]]},"location":"Chengdu, China","end":{"date-parts":[[2021,6,20]]}},"container-title":["2021 International Conference on Security, Pattern Analysis, and Cybernetics\uff08SPAC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9539245\/9539895\/09539905.pdf?arnumber=9539905","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:46:07Z","timestamp":1652197567000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9539905\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,18]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/spac53836.2021.9539905","relation":{},"subject":[],"published":{"date-parts":[[2021,6,18]]}}}