Saved in:
Bibliographic Details
Main Authors: Wang, Hongtao, Yang, Renchi, Wang, Hewen, Zheng, Haoran, Xu, Jianliang
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2504.04861
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866917979136983040
author Wang, Hongtao
Yang, Renchi
Wang, Hewen
Zheng, Haoran
Xu, Jianliang
author_facet Wang, Hongtao
Yang, Renchi
Wang, Hewen
Zheng, Haoran
Xu, Jianliang
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2504_04861
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle SAFT: Structure-aware Transformers for Textual Interaction Classification
Wang, Hongtao
Yang, Renchi
Wang, Hewen
Zheng, Haoran
Xu, Jianliang
Computation and Language
Artificial Intelligence
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.
title SAFT: Structure-aware Transformers for Textual Interaction Classification
topic Computation and Language
Artificial Intelligence
url https://arxiv.org/abs/2504.04861