mlsanityData to 14 Oct 2026

Effective Edge-wise Representation Learning in Edge-Attributed Bipartite Graphs

arXiv 2406.13369 ↗First posted 19 Jun 2024cs.LG cs.SIcited by 3

Not on the map. Why?

Abstract (arXiv)

Graph representation learning (GRL) is to encode graph elements into informative vector representations, which can be used in downstream tasks for analyzing graph-structured data and has seen extensive applications in various domains. However, the majority of extant studies on GRL are geared towards generating node representations, which cannot be readily employed to perform edge-based analytics tasks in edge-attributed bipartite graphs (EABGs) that pervade the real world, e.g., spam review detection in customer-product reviews and identifying fraudulent transactions in user-merchant networks. Compared to node-wise GRL, learning edge representations (ERL) on such graphs is challenging due to the need to incorporate the structure and attribute semantics from the perspective of edges while considering the separate influence of two heterogeneous node sets U and V in bipartite graphs. To our knowledge, despite its importance, limited research has been devoted to this frontier, and existing workarounds all suffer from sub-par results. Motivated by this, this paper designs EAGLE, an effective ERL method for EABGs. Building on an in-depth and rigorous theoretical analysis, we propose the factorized feature propagation (FFP) scheme for edge representations with adequate incorporation of long-range dependencies of edges/features without incurring tremendous computation overheads. We further ameliorate FFP as a dual-view FFP by taking into account the influences from nodes in U and V severally in ERL. Extensive experiments on 5 real datasets showcase the effectiveness of the proposed EAGLE models in semi-supervised edge classification tasks. In particular, EAGLE can attain a considerable gain of at most 38.11% in AP and 1.86% in AUC when compared to the best baselines.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 27 of its 68 references that are in the map. First posted on arXiv 19 Jun 2024.

Builds on

27 of 68 references.

References · 27

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  3. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
  4. 2017Graph Attention Networkscited by 8,923
  5. 2017Inductive Representation Learning on Large Graphscited by 6,320
  6. 2016node2vec: Scalable Feature Learning for Networkscited by 1,918
  7. 2014DeepWalk: Online Learning of Social Representationscited by 1,547
  8. 2019Simplifying Graph Convolutional Networkscited by 1,477
  9. 2018Deep Graph Infomaxcited by 1,106
  10. 2015LINE: Large-scale Information Network Embeddingcited by 582
  11. 2017Representation Learning on Graphs: Methods and Applicationscited by 457
  12. 2022Representing Long-Range Context for Graph Neural Networks with Global Attentioncited by 195
15 more
  1. 2021Interpreting and Unifying Graph Neural Networks with An Optimization Frameworkcited by 131
  2. 2020A Unified View on Graph Neural Networks as Graph Signal Denoisingcited by 110
  3. 2021Edge Representation Learning with Hypergraphscited by 37
  4. 2022UCTopic: Unsupervised Contrastive Learning for Phrase Representations and Topic Miningcited by 33
  5. 2022Personalized Showcases: Generating Multi-Modal Explanations for Recommendationscited by 30
  6. 2020Bipartite Graph Embedding via Mutual Information Maximizationcited by 29
  7. 2019Homogeneous Network Embedding for Massive Graphs via Reweighted Personalized PageRankcited by 25
  8. 2023Node-wise Diffusion for Scalable Graph Learningcited by 17
  9. 2021Multiplex Bipartite Network Embedding using Dual Hypergraph Convolutional Networkscited by 13
  10. 2023Efficient High-Quality Clustering for Large Bipartite Graphscited by 11
  11. 2021Effective and Scalable Clustering on Massive Attributed Graphscited by 10
  12. 2020AttrE2vec: Unsupervised Attributed Edge Representation Learningcited by 5
  13. 2023Efficient and Effective Similarity Search over Bipartite Graphscited by 5
  14. 2020ADSAGE: Anomaly Detection in Sequences of Attributed Graph Edges applied to insider threat detection at fine-grained levelcited by 4
  15. 2022EEGNN: Edge Enhanced Graph Neural Network with a Bayesian Nonparametric Graph Modelcited by 3

Built on by

Cited by year

Citing papers per year: 2025: 3.

3 papers.