WGDPool: A broad scope extraction for weighted graph data.

Graph pooling is a commonly used operation in graph neural networks to reduce the size of graph representation. To extract key information, pooling and representation need to be coupled. We propose a graph pooling method for weighted graphs called WGDPool (Weighted Graph Dual Pooling). Unlike traditional graph representation learning methods, the weight information of edges is also fed into convolutional graph neural networks (ConvGNN) to obtain graph representations. Dual branch convolutional graph neural networks is designed to learn the nodes' and edges' embeddings independently, and they are fused into a comprehensive representation of graph data. Pooling, as a tool of feature extraction and scale reduction of graph representation, adopts a differentiable version of k-means clustering and a multi-item parameterized loss function. Cut loss, orthogonality loss, clustering loss, and reconstruction loss are simultaneously considered. By parameterization, WGDPool is competent for diverse graph tasks. WGDPool outperformed other graph pooling methods in such common supervised and unsupervised tasks as biological or chemical classification, bibliography clustering and integrated circuit partition, demonstrating the effectiveness of our proposed pooling method. • Dual branch representation is proposed for weighted graphs. • Differentiable k-means and assembled loss function are designed for pooling. • Weighted Graph Dual Pooling model is implemented and validated. [ABSTRACT FROM AUTHOR]