Mitigating Filter Bubble from the Perspective of Community Detection: A Universal Framework

• URL: http://arxiv.org/abs/2508.11239v1
• Date: Fri, 15 Aug 2025 05:57:38 GMT
• Title: Mitigating Filter Bubble from the Perspective of Community Detection: A Universal Framework
• Authors: Ming Tang, Xiaowen Huang, Jitao Sang,
• Abstract summary: This paper proposes a universal framework called CD-CGCN to address the filter bubble issue in recommender systems.<n>By analyzing user-item interaction histories with a community detection algorithm, we reveal that state-of-the-art recommendations often focus on intra-community items, worsening the filter bubble effect.
• Score: 19.047790323760935
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In recent years, recommender systems have primarily focused on improving accuracy at the expense of diversity, which exacerbates the well-known filter bubble effect. This paper proposes a universal framework called CD-CGCN to address the filter bubble issue in recommender systems from a community detection perspective. By analyzing user-item interaction histories with a community detection algorithm, we reveal that state-of-the-art recommendations often focus on intra-community items, worsening the filter bubble effect. CD-CGCN, a model-agnostic framework, integrates a Conditional Discriminator and a Community-reweighted Graph Convolutional Network which can be plugged into most recommender models. Using adversarial learning based on community labels, it counteracts the extracted community attributes and incorporates an inference strategy tailored to the user's specific filter bubble state. Extensive experiments on real-world datasets with multiple base models validate its effectiveness in mitigating filter bubbles while preserving recommendation quality. Additionally, by applying community debiasing to the original test set to construct an unbiased test set, we observe that CD-CGCN demonstrates superior performance in capturing users' inter-community preferences.

Related papers

• Towards Reliable Negative Sampling for Recommendation with Implicit Feedback via In-Community Popularity [8.257297407777555]
  We propose textbfICPNS (In-Community Popularity Negative Sampling) to identify reliable and informative negative samples.<n>Our approach is grounded in the insight that item exposure is driven by latent user communities.<n>ICPNS yields consistent improvements on graph-based recommenders and competitive performance on MF-based models.
  arXiv  Detail & Related papers  (2026-02-21T08:53:10Z)
• Rethinking Popularity Bias in Collaborative Filtering via Analytical Vector Decomposition [37.76421221387847]
  Popularity bias is an intrinsic geometric artifact of Bayesian Pairwise Ranking (BPR) optimization.<n>We propose Directional Decomposition and Correction (DDC) to correct this embedding geometry.<n>DDC guides positive interactions along personalized preference directions while steering negative interactions away from the global popularity direction.
  arXiv  Detail & Related papers  (2025-12-11T14:35:13Z)
• Quantifying the Potential to Escape Filter Bubbles: A Behavior-Aware Measure via Contrastive Simulation [82.74100448579857]
  We introduce Bubble Escape Potential (BEP), a behavior-aware measure that quantifies how easily users can escape from filter bubbles.<n>We conduct extensive experiments across multiple recommendation models to examine the relationship between predictive accuracy and bubble escape potential across different groups.
  arXiv  Detail & Related papers  (2025-11-27T07:21:04Z)
• RecGPT Technical Report [57.84251629878726]
  We propose RecGPT, a next-generation framework that places user intent at the center of the recommendation pipeline.<n> RecGPT integrates large language models into key stages of user interest mining, item retrieval, and explanation generation.<n>Online experiments demonstrate that RecGPT achieves consistent performance gains across stakeholders.
  arXiv  Detail & Related papers  (2025-07-30T17:55:06Z)
• Towards Anomaly-Aware Pre-Training and Fine-Tuning for Graph Anomaly Detection [59.042018542376596]
  Graph anomaly detection (GAD) has garnered increasing attention in recent years, yet remains challenging due to two key factors.<n>Anomaly-Aware Pre-Training and Fine-Tuning (APF) is a framework to mitigate the challenges in GAD.<n> Comprehensive experiments on 10 benchmark datasets validate the superior performance of APF in comparison to state-of-the-art baselines.
  arXiv  Detail & Related papers  (2025-04-19T09:57:35Z)
• Unveiling Contrastive Learning's Capability of Neighborhood Aggregation for Collaborative Filtering [16.02820746003461]
  graph contrastive learning (GCL) has gradually become a dominant approach in recommender systems.<n>In this paper, we reveal via theoretical derivation that the gradient descent process of the CL objective is formally equivalent to graph convolution.<n>We propose a novel neighborhood aggregation objective to bring users closer to all interacted items while pushing them away from other positive pairs.
  arXiv  Detail & Related papers  (2025-04-14T11:22:41Z)
• Online Clustering of Dueling Bandits [59.09590979404303]
  We introduce the first "clustering of dueling bandit algorithms" to enable collaborative decision-making based on preference feedback.<n>We propose two novel algorithms: (1) Clustering of Linear Dueling Bandits (COLDB) which models the user reward functions as linear functions of the context vectors, and (2) Clustering of Neural Dueling Bandits (CONDB) which uses a neural network to model complex, non-linear user reward functions.
  arXiv  Detail & Related papers  (2025-02-04T07:55:41Z)
• Hypergraph Diffusion for High-Order Recommender Systems [5.71357784811215]
  We introduce WaveHDNN, an innovative wavelet-enhanced hypergraph diffusion framework.<n>WaveHDNN integrates a Heterophily-aware Collaborative, designed to capture user-item interactions across diverse categories, with a Multi-scale Group-wise Structure.<n>Cross-view contrastive learning is employed to maintain robust and consistent representations.
  arXiv  Detail & Related papers  (2025-01-28T05:59:29Z)
• Exploring the Escalation of Source Bias in User, Data, and Recommender System Feedback Loop [65.23044868332693]
  We explore how AI-generated content (AIGC) affects the performance and dynamics of recommender systems.<n>In the short term, bias toward AIGC encourages LLM-based content creation, increasing AIGC content, and causing unfair traffic distribution.<n>We propose a debiasing method based on L1-loss optimization to maintain long-term content ecosystem balance.
  arXiv  Detail & Related papers  (2024-05-28T09:34:50Z)
• BHEISR: Nudging from Bias to Balance -- Promoting Belief Harmony by Eliminating Ideological Segregation in Knowledge-based Recommendations [5.795636579831129]
  The main objective is to strike a belief balance for users while minimizing the detrimental influence caused by filter bubbles. The BHEISR model amalgamates principles from nudge theory while upholding democratic and transparent principles.
  arXiv  Detail & Related papers  (2023-07-06T06:12:37Z)
• Hypergraph Contrastive Collaborative Filtering [44.8586906335262]
  We propose a new self-supervised recommendation framework Hypergraph Contrastive Collaborative Filtering (HCCF) HCCF captures local and global collaborative relations with a hypergraph-enhanced cross-view contrastive learning architecture. Our model effectively integrates the hypergraph structure encoding with self-supervised learning to reinforce the representation quality of recommender systems.
  arXiv  Detail & Related papers  (2022-04-26T10:06:04Z)
• Broad Recommender System: An Efficient Nonlinear Collaborative Filtering Approach [56.12815715932561]
  We propose a new broad recommender system called Broad Collaborative Filtering (BroadCF) Instead of Deep Neural Networks (DNNs), Broad Learning System (BLS) is used as a mapping function to learn the complex nonlinear relationships between users and items. Extensive experiments conducted on seven benchmark datasets have confirmed the effectiveness of the proposed BroadCF algorithm.
  arXiv  Detail & Related papers  (2022-04-20T01:25:08Z)
• Adversarial Feature Augmentation and Normalization for Visual Recognition [109.6834687220478]
  Recent advances in computer vision take advantage of adversarial data augmentation to ameliorate the generalization ability of classification models. Here, we present an effective and efficient alternative that advocates adversarial augmentation on intermediate feature embeddings. We validate the proposed approach across diverse visual recognition tasks with representative backbone networks.
  arXiv  Detail & Related papers  (2021-03-22T20:36:34Z)
• CRACT: Cascaded Regression-Align-Classification for Robust Visual Tracking [97.84109669027225]
  We introduce an improved proposal refinement module, Cascaded Regression-Align- Classification (CRAC) CRAC yields new state-of-the-art performances on many benchmarks. In experiments on seven benchmarks including OTB-2015, UAV123, NfS, VOT-2018, TrackingNet, GOT-10k and LaSOT, our CRACT exhibits very promising results in comparison with state-of-the-art competitors.
  arXiv  Detail & Related papers  (2020-11-25T02:18:33Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.