The study, published in the journal Cluster Computing, was conducted by Shu-Run Zuo, Heng-Ru Zhang and Yuan-Yuan Xu of the School of Computer Science and Software Engineering. Their approach, presented in a paper titled “Graph-based social recommendation with redundant information suppression,” introduces two complementary loss functions that work together to prune away the misleading influence of weak, redundant social links. The results are striking: when tested against nine state-of-the-art baseline models across three real-world datasets, the new algorithm delivered average improvements of 7.977 percent in Recall@20 and 8.180 percent in NDCG@20, two standard metrics that measure how well a system places relevant items at the top of a user’s recommendation list.

To understand why redundant social connections are so damaging, it helps to look at how graph-based social recommenders actually work. These systems represent users, items and their relationships as a graph — a mathematical structure of nodes and edges. Users are nodes, and the edges encode both user-user social ties and user-item interactions such as purchases, ratings or clicks. Graph neural networks then propagate information along these edges, refining each user’s and each item’s embedding, a vector of numbers that encodes the essence of that user’s preferences or that item’s characteristics. When two users are connected, the model assumes their embeddings should influence one another, blending their preferences together. This mechanism works beautifully when the connection reflects true shared taste or mutual influence.

The problem is that many online social ties do not reflect any of this. Users accumulate followers, add acquaintances and follow celebrities or brands out of politeness, curiosity or habit. These relationships carry little or no preference information. When a graph neural network propagates signals along such edges anyway, it mixes in preferences that have nothing to do with the target user’s actual tastes. Over multiple layers of message passing, this noise compounds, degrading the quality of the learned embeddings and, ultimately, the accuracy of the recommendations. Previous research has attacked this problem with various denoising strategies, including diffusion models, adversarial training and graph structure learning, but the Southwest Petroleum team took a more direct route: teach the model itself to dynamically re-weight its social connections during training.

The first of the two proposed techniques is a social relationship adjustment loss function. Rather than treating every social edge as equally trustworthy, this loss function dynamically adjusts the weights assigned to individual social connections as the model learns. Connections that consistently help predict a user’s preferences gain weight; connections that contribute little, or that actively conflict with observed user-item interactions, are down-weighted. In effect, the model learns a softened, data-driven version of its social graph — one that preserves genuinely informative relationships while suppressing those that are redundant. Crucially, this adjustment is not a one-time preprocessing step but an ongoing optimization process integrated into the model’s training loop, allowing the weights to evolve alongside the embeddings themselves.

The second technique addresses a subtler problem. Once social relationship weights have been adjusted, there is a risk that the effect of that adjustment will be diluted: the embeddings produced before and after the social adjustment might end up looking very similar, meaning the adjusted relationships are not actually steering the learned representations in a meaningful new direction. To prevent this, the researchers introduce a loss function based on the Hilbert-Schmidt independence criterion, or HSIC — a statistical measure borrowed from kernel methods that quantifies the dependence between two sets of variables. By minimizing dependence between pre-adjustment and post-adjustment user and item embeddings, the HSIC loss forces the adjustment to produce genuinely different, more informative representations. In other words, it amplifies the effect of the re-weighted social relationships on the final embeddings, ensuring the denoising effort actually changes what the model has learned rather than leaving it functionally unchanged.

The combination of these two mechanisms forms the core of the proposed framework, which the authors call GRIS — short for graph-based social recommendation with redundant information suppression. The framework is designed to be model-agnostic, meaning it can be layered onto different underlying recommendation architectures rather than being locked to a single design. In their experiments, the team demonstrated that GRIS significantly improved the performance of multiple base models, confirming that the benefits of social relationship adjustment and independence-based amplification are not artifacts of one particular network design but a general principle applicable across the graph-based social recommendation landscape.

The evaluation was conducted on three real-world datasets, providing a demanding test of the method under realistic conditions of sparse interactions and noisy social networks. The team compared their approach against nine state-of-the-art models, including graph convolutional recommendation architectures such as LightGCN and social recommendation networks such as SocialLGN and DiffNet++. The consistent gains in Recall@20 — which measures the fraction of relevant items captured in the top twenty recommendations — and NDCG@20 — which rewards placing the most relevant items higher in the ranked list — indicate that the improvements are both broad and well-placed. A system that retrieves more relevant items and ranks them higher is, in practical terms, a system better at cutting through the noise to surface what a user genuinely wants.

The work builds on a substantial body of prior research. Social recommendation traces back to probabilistic matrix factorization approaches such as SoRec, introduced in 2008, and trust-aware models like TrustSVD. More recently, graph neural networks have transformed the field, with models like GraphRec pioneering the use of graph structures for social recommendation, and subsequent work exploring adversarial graph convolutional networks, hypergraph convolution, and neural influence diffusion. A parallel thread of research has focused on denoising, recognizing that both interaction data and social data contain noise. Methods such as robust preference-guided denoising, graph bottlenecked social recommendation, and diffusion-based social network refinement all share with the new study the goal of making recommenders resilient to imperfect social signals. What distinguishes GRIS is its two-pronged strategy of explicit relationship re-weighting combined with an independence criterion that guarantees the re-weighting leaves a measurable imprint on the learned representations.

The practical implications extend well beyond academic benchmarks. Recommender systems drive a substantial fraction of engagement on e-commerce platforms, streaming services and social networks, and even modest percentage improvements in ranking quality can translate into significantly better user experiences and business outcomes. More fundamentally, the research offers a corrective to a simplistic view of online social ties. Homophily — the tendency of similar people to connect — is real, but it is not uniform. Social networks are heterogeneous in the strength and meaning of their connections, and systems that ignore this heterogeneity pay a price in accuracy. By learning which connections carry preference information and which do not, GRIS-style approaches point toward recommenders that treat social data with the same critical scrutiny that users themselves intuitively apply.

The researchers have made their code openly available on GitHub, allowing other teams to reproduce their results and integrate the redundant information suppression framework into their own systems. The work was supported by the Sichuan Provincial Natural Science Foundation of China. As online social graphs continue to grow in size and complexity, techniques that can separate signal from noise in human relationships are likely to become increasingly essential — and this study offers a mathematically principled template for how to do exactly that.