{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T14:54:19Z","timestamp":1777733659708,"version":"3.51.4"},"reference-count":46,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2021,11,15]],"date-time":"2021-11-15T00:00:00Z","timestamp":1636934400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["62072365"],"award-info":[{"award-number":["62072365"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"crossref","award":["2020AAA0107100 and 2020YFB1406900"],"award-info":[{"award-number":["2020AAA0107100 and 2020YFB1406900"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100015401","name":"Key Research and Development Program of Shaanxi","doi-asserted-by":"crossref","award":["2020KW-002"],"award-info":[{"award-number":["2020KW-002"]}],"id":[{"id":"10.13039\/501100015401","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Innovation Capability Support Plan of Shaanxi","award":["2021PT-010"],"award-info":[{"award-number":["2021PT-010"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2022,6,30]]},"abstract":"<jats:p>Graph representation learning aims at learning low-dimension representations for nodes in graphs, and has been proven very useful in several downstream tasks. In this article, we propose a new model, Graph Community Infomax (GCI), that can adversarial learn representations for nodes in attributed networks. Different from other adversarial network embedding models, which would assume that the data follow some prior distributions and generate fake examples, GCI utilizes the community information of networks, using nodes as positive(or real) examples and negative(or fake) examples at the same time. An autoencoder is applied to learn the embedding vectors for nodes and reconstruct the adjacency matrix, and a discriminator is used to maximize the mutual information between nodes and communities. Experiments on several real-world and synthetic networks have shown that GCI outperforms various network embedding methods on community detection tasks.<\/jats:p>","DOI":"10.1145\/3480244","type":"journal-article","created":{"date-parts":[[2021,11,15]],"date-time":"2021-11-15T17:31:28Z","timestamp":1636997488000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Graph Community Infomax"],"prefix":"10.1145","volume":"16","author":[{"given":"Heli","family":"Sun","sequence":"first","affiliation":[{"name":"Xi\u2019an Jiaotong University, Shaanxi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Li","sequence":"additional","affiliation":[{"name":"Xi\u2019an Jiaotong University, Shaanxi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bing","family":"Lv","sequence":"additional","affiliation":[{"name":"Xi\u2019an Jiaotong University, Shaanxi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wujie","family":"Yan","sequence":"additional","affiliation":[{"name":"Xi\u2019an Jiaotong University, Shaanxi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang","family":"He","sequence":"additional","affiliation":[{"name":"Xi\u2019an Jiaotong University, Shaanxi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaojie","family":"Qiao","sequence":"additional","affiliation":[{"name":"Chengdu University of Information Technology, Sichuan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianbin","family":"Huang","sequence":"additional","affiliation":[{"name":"Xidian University, Shaanxi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,11,15]]},"reference":[{"issue":"8","key":"e_1_3_3_2_1","doi-asserted-by":"crossref","first-page":"1548","DOI":"10.1109\/TPAMI.2010.231","article-title":"Graph regularized nonnegative matrix factorization for data representation","volume":"33","author":"Cai Deng","year":"2010","unstructured":"Deng Cai, Xiaofei He, Jiawei Han, and Thomas S. Huang. 2010. Graph regularized nonnegative matrix factorization for data representation. IEEE Transactions on Pattern Analysis and Machine Intelligence 33, 8 (2010), 1548\u20131560.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"e_1_3_3_3_1","first-page":"1145","volume-title":"Proceedings of the 30th AAAI Conference on Artificial Intelligence","author":"Cao Shaosheng","year":"2016","unstructured":"Shaosheng Cao, Wei Lu, and Qiongkai Xu. 2016. Deep neural networks for learning graph representations.. In Proceedings of the 30th AAAI Conference on Artificial Intelligence. 1145\u20131152."},{"key":"e_1_3_3_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132925"},{"key":"e_1_3_3_5_1","volume-title":"Proceedings of the 32nd AAAI Conference on Artificial Intelligence","author":"Dai Quanyu","year":"2018","unstructured":"Quanyu Dai, Qiang Li, Jian Tang, and Dan Wang. 2018. Adversarial network embedding. In Proceedings of the 32nd AAAI Conference on Artificial Intelligence."},{"key":"e_1_3_3_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271768"},{"key":"e_1_3_3_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_3_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/2945.841119"},{"key":"e_1_3_3_9_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-017-02751-8"},{"key":"e_1_3_3_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3373760"},{"key":"e_1_3_3_11_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.3301152"},{"key":"e_1_3_3_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2937298"},{"key":"e_1_3_3_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2958806"},{"key":"e_1_3_3_14_1","article-title":"A survey of community detection approaches: From statistical modeling to deep learning","author":"Jin Di","year":"2021","unstructured":"Di Jin, Zhizhi Yu, Pengfei Jiao, Shirui Pan, Philip S. Yu, and Weixiong Zhang. 2021. A survey of community detection approaches: From statistical modeling to deep learning. arXiv:2101.01669. Retrieved from https:\/\/arxiv.org\/abs\/2101.01669.","journal-title":"arXiv:2101.01669"},{"key":"e_1_3_3_15_1","volume-title":"International Conference on Learning Representations (ICLR)","author":"Kipf Thomas N.","year":"2017","unstructured":"Thomas N. Kipf and Max Welling. 2017. Semi-supervised classification with graph convolutional networks. In International Conference on Learning Representations (ICLR)."},{"key":"e_1_3_3_16_1","volume-title":"NIPS Workshop on Bayesian Deep Learning (2016)","author":"Kipf Thomas N.","year":"2016","unstructured":"Thomas N. Kipf and Max Welling. 2016. Variational graph auto-encoders. NIPS Workshop on Bayesian Deep Learning (2016)."},{"key":"e_1_3_3_17_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.78.046110"},{"key":"e_1_3_3_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1241540.1241551"},{"key":"e_1_3_3_19_1","first-page":"281","volume-title":"Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability","volume":"1","author":"MacQueen James","year":"1967","unstructured":"James MacQueen et\u00a0al. 1967. Some methods for classification and analysis of multivariate observations. In Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, Vol. 1. 281\u2013297."},{"key":"e_1_3_3_20_1","unstructured":"Alireza Makhzani Jonathon Shlens Navdeep Jaitly and Ian Goodfellow. 2016. Adversarial autoencoders. In International Conference on Learning Representations . http:\/\/arxiv.org\/abs\/1511.0564."},{"key":"e_1_3_3_21_1","article-title":"Efficient estimation of word representations in vector space","volume":"2013","author":"Mikolov Tomas","year":"2013","unstructured":"Tomas Mikolov, Kai Chen, G. S. Corrado, and Jeffrey Dean. 2013. Efficient estimation of word representations in vector space. In Proceedings of Workshop at ICLR 2013.","journal-title":"Proceedings of Workshop at ICLR"},{"key":"e_1_3_3_22_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0601602103"},{"key":"e_1_3_3_23_1","article-title":"Spatio-temporal deep graph infomax","author":"Opolka Felix L.","year":"2019","unstructured":"Felix L. Opolka, Aaron Solomon, C\u0103t\u0103lina Cangea, Petar Veli\u010dkovi\u0107, Pietro Li\u00f2, and R. Devon Hjelm. 2019. Spatio-temporal deep graph infomax. arXiv:1904.06316. Retrieved from https:\/\/arxiv.org\/abs\/1701.00133.","journal-title":"arXiv:1904.06316"},{"key":"e_1_3_3_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939751"},{"key":"e_1_3_3_25_1","doi-asserted-by":"crossref","unstructured":"Shirui Pan Ruiqi Hu Guodong Long Jing Jiang Lina Yao and Chengqi Zhang. 2018. Adversarially regularized graph autoencoder for graph embedding. In Proceedings of the 27th International Joint Conference on Artificial Intelligence . 2609\u20132615. DOI:https:\/\/doi.org\/10.24963\/ijcai.2018\/362","DOI":"10.24963\/ijcai.2018\/362"},{"key":"e_1_3_3_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380112"},{"key":"e_1_3_3_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_3_28_1","volume-title":"Matching Theory","author":"Plummer Michael D","year":"1986","unstructured":"Michael D Plummer and L\u00e1szl\u00f3 Lov\u00e1sz. 1986. Matching Theory. Vol. 29. Elsevier."},{"key":"e_1_3_3_29_1","volume-title":"Workshop of Deep Learning on Graphs: Methodologies and Applications co-located with the Thirty-Fourth AAAI Conference on Artificial Intelligence","author":"Ren Yuxiang","year":"2020","unstructured":"Yuxiang Ren, Bo Liu, Chao Huang, Peng Dai, Liefeng Bo, and Jiawei Zhang. 2020. Heterogeneous deep graph infomax. In Workshop of Deep Learning on Graphs: Methodologies and Applications co-located with the Thirty-Fourth AAAI Conference on Artificial Intelligence."},{"key":"e_1_3_3_30_1","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"e_1_3_3_31_1","article-title":"Overlapping community detection with graph neural networks","author":"Shchur Oleksandr","year":"2019","unstructured":"Oleksandr Shchur and Stephan G\u00fcnnemann. 2019. Overlapping community detection with graph neural networks. arXiv:1909.12201. Retrieved from https:\/\/arxiv.org\/abs\/1909.12201.","journal-title":"arXiv:1909.12201"},{"key":"e_1_3_3_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132902"},{"key":"e_1_3_3_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741093"},{"key":"e_1_3_3_34_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v28i1.8916"},{"key":"e_1_3_3_35_1","article-title":"Deep graph infomax","author":"Veli\u010dkovi\u0107 Petar","year":"2018","unstructured":"Petar Veli\u010dkovi\u0107, William Fedus, William L Hamilton, Pietro Li\u00f2, Yoshua Bengio, and R Devon Hjelm. 2018. Deep graph infomax. arXiv:1809.10341 (2018). Retrieved from https:\/\/arxiv.org\/abs\/1809.10341.","journal-title":"arXiv:1809.10341"},{"key":"e_1_3_3_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939753"},{"key":"e_1_3_3_37_1","doi-asserted-by":"crossref","unstructured":"Xiao Wang Peng Cui Jing Wang Jian Pei Wenwu Zhu and Shiqiang Yang. 2017. Community Preserving Network Embedding. In Proceedings of the 31st AAAI Conference on Artificial Intelligence. Retrieved from https:\/\/aaai.org\/ocs\/index.php\/AAAI\/AAAI17\/paper\/view\/14589.","DOI":"10.1609\/aaai.v31i1.10488"},{"key":"e_1_3_3_38_1","doi-asserted-by":"crossref","first-page":"152637","DOI":"10.1109\/ACCESS.2020.3018033","article-title":"Adversarial attention-based variational graph autoencoder","volume":"8","author":"Weng Ziqiang","year":"2020","unstructured":"Ziqiang Weng, Weiyu Zhang, and Wei Dou. 2020. Adversarial attention-based variational graph autoencoder. IEEE Access 8 (2020), 152637\u2013152645.","journal-title":"IEEE Access"},{"key":"e_1_3_3_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/3045390.3045442"},{"key":"e_1_3_3_40_1","volume-title":"Proceedings of the International Conference on Learning Representations","author":"Xu Keyulu","year":"2019","unstructured":"Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2019. How powerful are graph neural networks?. In Proceedings of the International Conference on Learning Representations. Retrieved from https:\/\/openreview.net\/forum?id=ryGs6iA5Km."},{"key":"e_1_3_3_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/2832415.2832542"},{"key":"e_1_3_3_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.556"},{"key":"e_1_3_3_43_1","first-page":"2252","volume-title":"Proceedings of the 25th International Joint Conference on Artificial Intelligence","author":"Yang Liang","year":"2016","unstructured":"Liang Yang, Xiaochun Cao, Dongxiao He, Chuan Wang, Xiao Wang, and Weixiong Zhang. 2016. Modularity based community detection with deep learning.. In Proceedings of the 25th International Joint Conference on Artificial Intelligence. 2252\u20132258."},{"key":"e_1_3_3_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2019.00081"},{"key":"e_1_3_3_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220000"},{"key":"e_1_3_3_46_1","unstructured":"Binbin Zhang Zhizhi Yu and Weixiong Zhang. 2020. Community-centric graph convolutional network for unsupervised community detection. In Proceedings of the 29th International Joint Conference on Artificial Intelligence ."},{"key":"e_1_3_3_47_1","article-title":"CAGNN: Cluster-aware graph neural networks for unsupervised graph representation learning","author":"Zhu Yanqiao","year":"2020","unstructured":"Yanqiao Zhu, Yichen Xu, Feng Yu, Shu Wu, and Liang Wang. 2020. CAGNN: Cluster-aware graph neural networks for unsupervised graph representation learning. arXiv:2009.01674. Retrieved from https:\/\/arxiv.org\/abs\/2009.01674.","journal-title":"arXiv:2009.01674"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3480244","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3480244","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:17Z","timestamp":1750188677000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3480244"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,15]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,6,30]]}},"alternative-id":["10.1145\/3480244"],"URL":"https:\/\/doi.org\/10.1145\/3480244","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,15]]},"assertion":[{"value":"2020-08-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-11-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}