LGRPool: Hierarchical Graph Pooling Via Local-Global Regularisation
원문 초록
Hierarchical graph pooling(HGP) are designed to consider the fact that conventional graph neural networks(GNN) are inherently flat and are also not multiscale. However, most HGP methods suffer not only from lack of considering global topology of the graph and focusing on the feature learning aspect, but also they do not align local and global features since graphs should inherently be analyzed in a multiscale way. LGRPool is proposed in the present paper as a HGP in the framework of expectation maximization in machine learning that aligns local and global aspects of message passing with each other using a regularizer to force the global topological information to be inline with the local message passing at different scales through the representations at different layers of HGP. Experimental results on some graph classification benchmarks show that it slightly outperforms some baselines.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Density-aware Walks for Coordinated Campaign Detection
Positional Encoding meets Persistent Homology on Graphs
Improving the Effective Receptive Field of Message-Passing Neural Networks
Graph Style Transfer for Counterfactual Explainability
Scalable Graph Generative Modeling via Substructure Sequences
Addressing the Scarcity of Benchmarks for Graph XAI
토론
이 논문과 연결된 포럼 글이 아직 없습니다.