Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3432291.3432294acmotherconferencesArticle/Chapter ViewAbstractPublication PagesspmlConference Proceedingsconference-collections
research-article

Information-aware Message Passing Neural Networks for Graph Node Classification

Published: 04 December 2020 Publication History

Abstract

In this paper, we present an information-aware message passing neural network (MPNN) to improve the effectiveness of weight calculation in the message passing process for node classification problems on a graph. Related researches are theoretically analyzed to introduce a special information interchanging scheme with precise weight generation. Compared to fix weighted message passing in convolutional networks (GCN) and neural network computed message coefficient in graph attention networks (GAT), the proposed information-aware message passing neural network takes advantage of node feature and its hidden representations, which indicate the amount of information should be passed and how to absorb the message between node neighbours. This exact message-passing method with self-learning for weight on each dimension of feature achieves better accuracy for node classification tasks in graph neural networks. The proposed method is evaluated by semi-supervised graph node classification task on citation network dataset. Obtained results show the correctness of the proposed method which are more accurate than that of GCN and GAT result.

References

[1]
Franco S, Ah Chung T, Marco G, and Markus H. 2004. Graphical-Based Learning Environments for Pattern Recognition. Lecture Notes in Computer Science Structural, Syntactic, and Statistical Pattern Recognition (2004), 42--56.
[2]
Kipf, T, and Welling, M. 2017. Semi-supervised classification with graph convolutional networks. In Proceedings of the International Conference on Learning Representations (ICLR 2017), April 24-26, 2017, Toulon, France.
[3]
Petar V, Guillem C, Arantxa C, Adriana R, Pietro L, and Yoshua B. 2018. Graph Attention Networks. In Proceedings of the International Conference on Learning Representations (ICLR 2018), April 30 - May 3, 2018, Vancouver, BC, Canada.
[4]
Gilmer, J, Schoenholz, S. S, Riley, P, Vinyals, O, and Dahl, G. E. 2017. Neural Message Passing for Quantum Chemistry. In Proceedings of the International Conference on Machine Learning, June 9-15, 2019, Long Beach, California, USA.
[5]
Weisfeiler B and Lehman A A. 1968. A reduction of a graph to a canonical form and an algebra arising during this reduction. Nauchno-Technicheskaya Informatsia, 2, 9 (1968), 12--16.
[6]
Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2019. How Powerful are Graph Neural Networks? In Proceedings of the International Conference on Learning Representations (ICLR 2018), May 6-9, 2019, New Orleans, LA, USA.
[7]
Hamilton, W L, Ying, R, and Leskovec, J. 2017. Inductive representation learning on large graphs. In Proceedings of the Advances in Neural Information Processing Systems (NIPS 2017), December 4, 2017, Long Beach, CA, USA.
[8]
Yifan Hou, Jian Zhang, James Cheng, Kaili Ma, Richard T. B. Ma, Hongzhi Chen, and Ming-Chang Yang. 2020. Measuring and Improving the Use of Graph Information in Graph Neural Networks. In Proceedings of the International Conference on Learning Representations (ICLR 2020), April 26-30, 2020 Addis Ababa, Ethiopia.
[9]
Randal D. 2006. Rapidly mixing Markov chains with applications in computer science and physics. Computing in Science & Engineering, 8, 2 (2006), 30--41.
[10]
Lovasz L., et al. 1993. Random walks on graphs: A survey. Combinatorics, Paul erdos is eighty, 2, 1 (1993): 1--46.
[11]
Clevert, Djork-Arné, Unterthiner T, and Hochreiter S. 2015. Fast and accurate deep network learning by exponential linear units (ELUs). In Proceedings of the International Conference on Learning Representations (ICLR 2016), May 2-4, 2016, San Juan, Puerto Rico.
[12]
Prithviraj Sen, Galileo Namata, Mustafa Bilgic, Lise Getoor, Brian Galligher, and Tina Eliassi-Rad. 2008. Collective classification in network data. AI magazine, 29, 3 (2008): 93--106.
[13]
Jie Hu, Li Shen, and Gang Sun. 2018. Squeeze-and-Excitation Networks. In Proceedings of IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2018), June 18-22, 2018, Salt Lake City, UT, USA.

Cited By

View all
  • (2023)DGL-Routing: One Routing Optimization Model Based on Deep Graph Learning2023 IEEE International Conference on Communications Workshops (ICC Workshops)10.1109/ICCWorkshops57953.2023.10283762(891-896)Online publication date: 28-May-2023

Index Terms

  1. Information-aware Message Passing Neural Networks for Graph Node Classification

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    SPML '20: Proceedings of the 2020 3rd International Conference on Signal Processing and Machine Learning
    October 2020
    141 pages
    ISBN:9781450375733
    DOI:10.1145/3432291
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 04 December 2020

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. Information-aware message passing
    2. graph attention networks
    3. node classification

    Qualifiers

    • Research-article
    • Research
    • Refereed limited

    Funding Sources

    Conference

    SPML 2020

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)8
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 20 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2023)DGL-Routing: One Routing Optimization Model Based on Deep Graph Learning2023 IEEE International Conference on Communications Workshops (ICC Workshops)10.1109/ICCWorkshops57953.2023.10283762(891-896)Online publication date: 28-May-2023

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media