Journal
WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS
Volume 24, Issue 3, Pages 825-848Publisher
SPRINGER
DOI: 10.1007/s11280-021-00878-3
Keywords
Graph neural network; Binarized neural network; Classification
Funding
- National Natural Science Foundation of China [61976198, 62022077]
- ARC [FT200100787, FT170100128, DP180103096]
- Australian Research Council [FT200100787] Funding Source: Australian Research Council
Ask authors/readers for more resources
By binarizing the network parameters and node embeddings, a novel BGN binary graph neural network approach has been proposed, which significantly improves efficiency and performance compared to existing methods.
Recently, there have been some breakthroughs in graph analysis by applying the graph neural networks (GNNs) following a neighborhood aggregation scheme, which demonstrate outstanding performance in many tasks. However, we observe that the parameters of the network and the embedding of nodes are represented in real-valued matrices in existing GNN-based graph embedding approaches which may limit the efficiency and scalability of these models. It is well-known that binary vector is usually much more space and time efficient than the real-valued vector. This motivates us to develop a binarized graph neural network to learn the binary representations of the nodes with binary network parameters following the GNN-based paradigm. Our proposed method can be seamlessly integrated into the existing GNN-based embedding approaches to binarize the model parameters and learn the compact embedding. Extensive experiments indicate that the proposed binarized graph neural network, namely BGN, is orders of magnitude more efficient in terms of both time and space while matching the state-of-the-art performance.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available