Harsha, S.S.Mishra, D.2026-02-062024Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2024, Vol.13102 LNCS, , p. 171-1803029743https://doi.org/10.1007/978-3-031-12700-7_18https://idr.nitk.ac.in/handle/123456789/29000Tasks such as graph classification, require graph pooling to learn graph-level representations from constituent node representations. In this work, we propose two novel methods using fully connected neural network layers for graph pooling, namely Neural Pooling Method 1 and 2. Our proposed methods have the ability to handle variable number of nodes in different graphs, and are also invariant to the isomorphic structures of graphs. In addition, compared to existing graph pooling methods, our proposed methods are able to capture information from all nodes, collect second-order statistics, and leverage the ability of neural networks to learn relationships among node representations, making them more powerful. We perform experiments on graph classification tasks in the bioinformatics and social network domains to determine the effectiveness of our proposed methods. Experimental results show that our methods lead to an increase in graph classification accuracy over previous works and a general decrease in standard deviation across multiple runs indicating greater reliability. Experimental results also indicate that this improvement in performance is consistent across several datasets. © Springer Nature Switzerland AG 2024.Graph Neural NetworksGraph PoolingMachine LearningRepresentation Learning