mlsanityData to 7 Oct 2026

SAFT: Structure-aware Transformers for Textual Interaction Classification

arXiv 2504.04861 ↗First posted 7 Apr 2025cs.CL cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Textual interaction networks (TINs) are an omnipresent data structure used to model the interplay between users and items on e-commerce websites, social networks, etc., where each interaction is associated with a text description. Classifying such textual interactions (TIC) finds extensive use in detecting spam reviews in e-commerce, fraudulent transactions in finance, and so on. Existing TIC solutions either (i) fail to capture the rich text semantics due to the use of context-free text embeddings, and/or (ii) disregard the bipartite structure and node heterogeneity of TINs, leading to compromised TIC performance. In this work, we propose SAFT, a new architecture that integrates language- and graph-based modules for the effective fusion of textual and structural semantics in the representation learning of interactions. In particular, line graph attention (LGA)/gated attention units (GAUs) and pretrained language models (PLMs) are capitalized on to model the interaction-level and token-level signals, which are further coupled via the proxy token in an iterative and contextualized fashion. Additionally, an efficient and theoretically-grounded approach is developed to encode the local and global topology information pertaining to interactions into structural embeddings. The resulting embeddings not only inject the structural features underlying TINs into the textual interaction encoding but also facilitate the design of graph sampling strategies. Extensive empirical evaluations on multiple real TIN datasets demonstrate the superiority of SAFT over the state-of-the-art baselines in TIC accuracy.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 22 of its 41 references that are in the map. First posted on arXiv 7 Apr 2025.

Builds on

22 of 41 references.

References · 22

  1. 2017Neural Message Passing for Quantum Chemistrycited by 3,460
  2. 2016node2vec: Scalable Feature Learning for Networkscited by 1,913
  3. 2019Simplifying Graph Convolutional Networkscited by 1,470
  4. 2018Representation Learning on Graphs with Jumping Knowledge Networkscited by 875
  5. 2020Simple and Deep Graph Convolutional Networkscited by 857
  6. 2016Ups and Downs: Modeling the Visual Evolution of Fashion Trends with One-Class Collaborative Filteringcited by 517
  7. 2020Towards Deeper Graph Neural Networkscited by 296
  8. 2023Exploring the Potential of Large Language Models (LLMs) in Learning on Graphscited by 271
  9. 2022Transformer Quality in Linear Timecited by 189
  10. 2021GraphFormers: GNN-nested Transformers for Representation Learning on Textual Graphcited by 143
  11. 2019Edge-labeling Graph Neural Network for Few-shot Learningcited by 114
  12. 2020Stance Detection on Social Media: State of the Art and Trendscited by 93
10 more
  1. 2021TextGNN: Improving Text Encoder via Graph Neural Network in Sponsored Searchcited by 54
  2. 2020On the Equivalence of Decoupled Graph Convolution Network and Label Propagationcited by 49
  3. 2021AdsGNN: Behavior-Graph Augmented Relevance Modeling in Sponsored Searchcited by 38
  4. 2021Edge Representation Learning with Hypergraphscited by 37
  5. 2020Item Tagging for Information Retrieval: A Tripartite Graph Neural Network based Approachcited by 12
  6. 2023Efficient Approximation Algorithms for Spanning Centralitycited by 6
  7. 2020AttrE2vec: Unsupervised Attributed Edge Representation Learningcited by 5
  8. 2023Efficient and Effective Similarity Search over Bipartite Graphscited by 5
  9. 2023Efficient Estimation of Pairwise Effective Resistancecited by 4
  10. 2024Effective Edge-wise Representation Learning in Edge-Attributed Bipartite Graphscited by 3

Built on by

Not cited yet.