JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE) ›› 2025, Vol. 60 ›› Issue (7): 84-93.doi: 10.6040/j.issn.1671-9352.4.2024.839
WU Xinyao1,2, XU Ji1*
CLC Number:
[1] LI Zewen, LIU Fan, YANG Wenjie, et al. A survey of convolutional neural networks: analysis, applications, and prospects[J]. IEEE Transactions on Neural Networks and Learning Systems, 2021, 33(12):6999-7019. [2] WU Zonghan, PAN Shirui, CHEN Fengwen, et al. A comprehensive survey on graph neural networks[J]. IEEE Transactions on Neural Networks and Learning Systems, 2020, 32(1):4-24. [3] DWIVEDI V P, JOSHI C K, LUU A T, et al. Benchmarking graph neural networks[J]. Journal of Machine Learning Research, 2023, 24(43):1-48. [4] LIU Chuang, ZHAN Yibing, WU Jia, et al. Graph pooling for graph neural networks: progress, challenges, and opportunities[C] //Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence. Macao: IJCAI, 2023:6712-6722. [5] BIANCHI F M, LACHI V. The expressive power of pooling in graph neural networks[J]. Advances in Neural Information Processing Systems, 2023, 36:71603-71618. [6] YU Shujian, GIRALDO L G S, PRÍNCIPE J C. Information-theoretic methods in deep neural networks: recent advances and emerging opportunities[C] //Proceedings of the Thirty International Joint Conference on Artificial Intelligence. Montreal: IJCAI, 2021:4669-4678. [7] HJELM R D, FEDOROV A, LAVOIE-MARCHILDON S, et al. Learning deep representations by mutual information estimation and maximization[C] //International Conference on Learning Representations. New Orleans, Louisiana: OpenReview.net, 2019. [8] VELICKOVIC P, FEDUS W, HAMILTON W L, et al. Deep graph infomax[C] //International Conference on Learning Representations. New Orleans, Louisiana: OpenReview.net, 2019. [9] PENG Zhen, HUANG Wenbing, LUO Minnan, et al. Graph representation learning via graphical mutual information maximization[C] //Proceedings of The Web Conference. New York: ACM, 2020:259-270. [10] PANG Yunsheng, ZHAO Yunxiang, LI Dongsheng. Graph pooling via coarsened graph infomax[C] //Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval. New York: ACM, 2021:2177-2181. [11] VINYALS O, BENGIO S, KUDLUR M. Order matters: sequence to sequence for sets[C] //International Conference on Learning Representations. San Juan: AAAI, 2016. [12] ZHANG Muhan, CUI Zhicheng, NEUMANN M, et al. An end-to-end deep learning architecture for graph classification[C] //Proceedings of the AAAI Conference on Artificial Intelligence. New Orleans, Louisiana: AAAI, 2018, 32(1):4438-4445. [13] YING Zhitao, YOU Jiaxuan, CHRISTOPHER M, et al. 2018. Hierarchical graph representation learning with differentiable pooling[C] //Proceedings of the 32nd International Conference on Neural Information Processing Systems. Red Hook: Curran Associates Incoporation, 2018:4805-4815. [14] YUAN Had, JI Shuiwang. Structpool: structured graph pooling via conditional random fields[C] //Proceedings of the 8th International Conference on Learning Representations. Addis Ababa: IEEE, 2020. [15] MA Yao, WANG Suhang, TANG Liliang, et al. Graph convolutional networks with eigenpooling[C] //Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. New York: ACM, 2019:723-731. [16] GAO Hongyang, JI Shuiwang. Graph U-nets[C] //International Conference on Machine Learning. California: PMLR, 2019:2083-2092. [17] LEE J, LEE I, KANG J. Self-attention graph pooling[C] //International Conference on Machine Learning. California: PMLR, 2019:3734-3743. [18] GAO Xing, DAI Wenrui, LI Chenglin, et al. Ipool-information-based pooling in hierarchical graph neural networks[J]. IEEE Transactions on Neural Networks and Learning Systems, 2021, 33(9):5032-5044. [19] ZHANG Zhen, BU Jiajun, MARTIN E, et al. Hierarchical multi-view graph pooling with structure learning[J]. IEEE Transactions on Knowledge and Data Engineering, 2021, 35(1):545-559. [20] LI Maosen, CHEN Siheng, ZHANG Ya, et al. Graph cross networks with vertex infomax pooling[J]. Advances in Neural Information Processing Systems. Red Hook: Curran Associates Incoporation, 2020, 33:14093-14105. [21] KIPF T N, WELLING M. Semi-supervised classification with graph convolutional networks[C] //International Conference on Learning Representations. Toulon: OpenReview.net, 2017. [22] VELICKOVIC P, CUCURULL G, CASANOVA A, et al. Graph attention networks[C] //International Conference on Learning Representations. Vancouver: OpenReview.net, 2018. [23] HAMILTON W L, YING Zhitao, LESKOVEC J. Inductive representation learning on large graphs[C] //Proceedings of the 31st International Conference on Neural Information Processing Systems. Long Beach: Curran Associates Incoporation, 2017:1025-1035. [24] ZHONG Zhiqiang, LI Chengte, PANG Jun. Multi-grained semantics-aware graph neural networks[J]. IEEE Transactions on Knowledge and Data Engineering, 2022, 35(7):7251-7262. [25] ZHANG Xu, XU Yonghui, HE Wei, et al. A comprehensive review of the oversmoothing in graph neural networks[C] //CCF Conference on Computer Supported Cooperative Work and Social Computing. Singapore: Springer, 2023:451-465. |
[1] | Qian WANG,Xianyong ZHANG. Incomplete neighborhood weighted multi-granularity decision-theoretic rough sets and three-way decision [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2023, 58(9): 94-104. |
[2] | QIAN Jin, TANG Da-wei, HONG Cheng-xin. Research on multi-granularity hierarchical sequential three-way decision model [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2022, 57(9): 33-45. |
[3] | SUN Wen-xin, LIU Yu-feng. Generalized multi-granularity rough sets based on parameter granular [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2022, 57(5): 11-19. |
[4] | LI Jin-hai, HE Jian-jun, WU Wei-zhi. Optimization of class-attribute block in multi-granularity formal concept analysis [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2020, 55(5): 1-12. |
[5] | LU Qing-ping1, SU Shou-bao1,2*, YU Shu-hao1,3,4, YANG Liu1. An expanded RBAC model of multi-granularity based on trust hierarchies [J]. J4, 2013, 48(7): 51-55. |
|