A graph neural network with negative message passing and uniformity maximization for graph coloring

被引:0
|
作者
Xiangyu Wang
Xueming Yan
Yaochu Jin
机构
[1] Bielefeld University,Faculty of Technology
[2] Guangdong University of Foreign Studies,School of Information Science and Technology
[3] Westlake University,School of Engineering
来源
关键词
Negative message passing; Graph coloring problems; Uniformity maximization; Information entropy;
D O I
暂无
中图分类号
学科分类号
摘要
Graph neural networks have received increased attention over the past years due to their promising ability to handle graph-structured data, which can be found in many real-world problems such as recommender systems and drug synthesis. Most existing research focuses on using graph neural networks to solve homophilous problems, and not much attention has been paid to heterophily-type problems. In this paper, we propose a graph network model for graph coloring, which is a class of representative heterophilous problems. Different from the message passing in conventional graph networks, we introduce negative message passing into a physics-inspired graph neural network for more effective information exchange in handling graph coloring problems. Moreover, a new term in the objective function taking into account the information entropy of nodes is suggested to increase the uniformity of the color assignment of each node, giving the neural network more chance to choose suitable colors for each node. Therefore, it could avoid the final solution getting stuck into the local optimum. Experimental studies are carried out to compare the proposed graph model with five state-of-the-art algorithms on ten publicly available graph coloring problems and d-regular graphs with up to 104\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$10^4$$\end{document} nodes, demonstrating the effectiveness of the proposed graph neural network.
引用
收藏
页码:4445 / 4455
页数:10
相关论文
共 50 条
  • [1] A graph neural network with negative message passing and uniformity maximization for graph coloring
    Wang, Xiangyu
    Yan, Xueming
    Jin, Yaochu
    [J]. COMPLEX & INTELLIGENT SYSTEMS, 2024, 10 (03) : 4445 - 4455
  • [2] Cross Message Passing Graph Neural Network
    Zhang, Zeyu
    Liu, Zheng
    Zhou, Qiyun
    Qu, Yanwen
    [J]. 2020 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2020,
  • [3] Explicit Message-Passing Heterogeneous Graph Neural Network
    Xu, Lei
    He, Zhen-Yu
    Wang, Kai
    Wang, Chang-Dong
    Huang, Shu-Qiang
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (07) : 6916 - 6929
  • [4] Domain-adaptive message passing graph neural network
    Shen, Xiao
    Pan, Shirui
    Choi, Kup-Sze
    Zhou, Xi
    [J]. NEURAL NETWORKS, 2023, 164 : 439 - 454
  • [5] BeMap: Balanced Message Passing for Fair Graph Neural Network
    Lin, Xiao
    Kang, Jian
    Cong, Weilin
    Tong, Hanghang
    [J]. LEARNING ON GRAPHS CONFERENCE, VOL 231, 2023, 231
  • [6] Graph Neural Network with Virtual Edge Message Passing for Heterophilous Graphs
    Sun, Chengcheng
    Niu, Qiang
    Rui, Xiaobin
    Wang, Zhixiao
    [J]. 2023 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS, IJCNN, 2023,
  • [7] A Comparative Study of Marginalized Graph Kernel and Message-Passing Neural Network
    Xiang, Yan
    Tang, Yu-Hang
    Lin, Guang
    Sun, Huai
    [J]. JOURNAL OF CHEMICAL INFORMATION AND MODELING, 2021, 61 (11) : 5414 - 5424
  • [8] Breaking the Limits of Message Passing Graph Neural Networks
    Balcilar, Muhammet
    Heroux, Pierre
    Gauzere, Benoit
    Vasseur, Pascal
    Adam, Sebastien
    Honeine, Paul
    [J]. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139, 2021, 139
  • [9] Revisiting the Message Passing in Heterophilous Graph Neural Networks
    Zheng, Zhuonan
    Bei, Yuanchen
    Zhou, Sheng
    Ma, Yao
    Gu, Ming
    Xu, Hongjia
    Lai, Chengyu
    Chen, Jiawei
    Bu, Jiajun
    [J]. arXiv, 2024,
  • [10] Polarized message-passing in graph neural networks
    He, Tiantian
    Liu, Yang
    Ong, Yew-Soon
    Wu, Xiaohu
    Luo, Xin
    [J]. ARTIFICIAL INTELLIGENCE, 2024, 331