Search

Graphs have been widely adopted in various fields, where many graph models are developed. Most of previous research focuses on unipartite or homogeneous graph analysis. In this graphs, the relationships between the same type of entities are preserved in the graphs. Meanwhile, the bipartite graphs that model the complex relationships among different entities with vertices partitioned into two disjoint sets, are becoming increasing popular and ubiquitous in many real life applications. Though several graph classification methods on unipartite and homogenous graphs have been proposed by using kernel method, graph neural network, etc. However, these methods are unable to effectively capture the hidden information in bipartite graphs. In this paper, we propose the first bipartite graph-based capsule network, namely Bipartite Capsule Graph Neural Network (BCGNN), for the bipartite graph classification task. BCGNN exploits the capsule network and obtains information between the same type vertices in the bipartite graphs by constructing the one-mode projection. Extensive experiments are conducted on real-world datasets to demonstrate the effectiveness of our proposed method. [ABSTRACT FROM AUTHOR]

Structured entities analysis is the basis of the modern science, such as chemical science, biological science, environmental science and medical science. Recently, a huge amount of computational models have been proposed to analyze structured entities such as chemical molecules and proteins. However, the problem becomes complex when local structural entity graphs and a global entity interaction graph are both involved. The unique graph of graphs structure cannot be properly exploited by most existing works for structural entity analysis. Some works that build neural networks on the graph of graphs cannot preserve the local graph structure effectively, hence, reducing the expressive power of the model. In this paper, we propose a Powerful Graph Of graphs neural Network, namely PGON, which has 3-Weisfeiler-Lehman expressive power and captures the attributes and structural information from both structured entity graphs and entity interaction graph hierarchically. Extensive experiments are conducted on real-world datasets, which show that PGON outperforms other state-of-the-art methods on both graph classification and graph interaction prediction tasks. [ABSTRACT FROM AUTHOR]