AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (9.3 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access | Just Accepted

Relational Diversification-based Anti-Mapping for Concealing User Preference

Shaokui Gu1Yang Zhang2Xiangguo Sun3Shuo Yu4Xu Yuan5Qiang Duan6Fenghua Tong7,8Qingyuan Gong9 ( )

1 School of Computer Science, Fudan University, Shanghai and 200438, China

2 Anuradha and Vikas Sinha Department of Data Science, University of North Texas, Denton and 76207, USA

3 Department of Systems Engineering and Engineering Management, Chinese University of Hong Kong, Hong Kong and 999077, China

4 School of Computer Science and Technology, Dalian University of Technology, Dalian and 116081, China

5 School of Software, Dalian University of Technology, Dalian and 116620, China

6 Department of Information Technology, Pennsylvania State University Abington College, Abington and 19001, USA

7 Key Laboratory of Computing Power Network and Information Security, Ministry of Education, Shandong Computer Science Center (National Supercomputer Center in Jinan), Qilu University of Technology, Jinan and 250353, China

8 Shandong Provincial Key Laboratory of Industrial Network and Information System Security, Shandong Fundamental Research Center for Computer Science, Jinan and 250014, China

9 Research Institute of Intelligent Complex Systems, Fudan University, Shanghai and 200438, China

Show Author Information

Abstract

Personalized recommendation engines often rely on preference mapping, which infers user interests from historical behaviors and social graph structures. Such mapping can trigger a content homogenization loop, gradually limiting users’ exposure to diverse content and resulting in information cocoons. While existing approaches focus on diversifying content recommendations, they often overlook the role of social topology in shaping information exposure. This paper seeks to examine how the structure of social connections shapes users’ exposure to diverse information and to develop measurable strategies for reducing information homogenization. We find that users with heterogeneous, strategically chosen links have diverse information exposure, which can break the information cocoon. To quantify the homogeneity of the environment, we introduce a Diversity-Scale score that quantifies both the diversity and the scope of content exposure by each user. We then establish a correlation between preference features and social connection structure, independent of explicit personal preference data, and demonstrate that strategies with diverse connections significantly weaken this correlation. We validate our approach on two real-world platforms with distinct interaction patterns (Yelp and Steam), showing that constructing diverse and dynamically heterogeneous graph structures as an anti-mapping approach is a practical and lightweight mechanism to resist preference fingerprinting and its resulting content homogeneity.

References

【1】
【1】
 
 
Tsinghua Science and Technology

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Gu S, Zhang Y, Sun X, et al. Relational Diversification-based Anti-Mapping for Concealing User Preference. Tsinghua Science and Technology, 2026, https://doi.org/10.26599/TST.2025.9010134

505

Views

34

Downloads

0

Crossref

0

Web of Science

0

Scopus

0

CSCD

Received: 11 May 2025
Revised: 18 August 2025
Accepted: 26 August 2025
Available online: 26 January 2026

© The author(s) 2026.

The articles published in this open access journal are distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/).