GegenNet: Spectral Convolutional Neural Networks for Link Sign Prediction in Signed Bipartite Graphs
Hewen Wang, Renchi Yang, Xiaokui Xiao

TL;DR
GegenNet is a spectral convolutional neural network designed for link sign prediction in signed bipartite graphs, leveraging Gegenbauer polynomial filters to improve accuracy over existing methods.
Contribution
The paper introduces GegenNet, a novel spectral CNN with Gegenbauer polynomial filters and sign-aware convolutional layers tailored for signed bipartite graphs.
Findings
Achieves up to 4.28% higher AUC than competitors
Improves F1 score by up to 11.69%
Outperforms 11 strong baseline methods on benchmark datasets
Abstract
Given a signed bipartite graph (SBG) G with two disjoint node sets U and V, the goal of link sign prediction is to predict the signs of potential links connecting U and V based on known positive and negative edges in G. The majority of existing solutions towards link sign prediction mainly focus on unipartite signed graphs, which are sub-optimal due to the neglect of node heterogeneity and unique bipartite characteristics of SBGs. To this end, recent studies adapt graph neural networks to SBGs by introducing message-passing schemes for both inter-partition (UxV) and intra-partition (UxU or VxV) node pairs. However, the fundamental spectral convolutional operators were originally designed for positive links in unsigned graphs, and thus, are not optimal for inferring missing positive or negative links from known ones in SBGs. Motivated by this, this paper proposes GegenNet, a novel and…
Click any figure to enlarge with its caption.
Figure 1Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
