Breaking the Information Silo: Semantic Personas for Cross-Domain Recommendation

• URL: http://arxiv.org/abs/2606.01783v1
• Date: Mon, 01 Jun 2026 07:04:10 GMT
• Title: Breaking the Information Silo: Semantic Personas for Cross-Domain Recommendation
• Abstract summary: Cross-domain recommender systems seek to overcome limitations by transferring knowledge from a source domain to a target domain.<n>We propose SPHERE, a design artifact that enables recommendation knowledge transfer across strictly disjoint domains.<n> SPHERE uses large language models to induce a shared behavioral vocabulary, generate structured semantic personas for users, and retrieve behaviorally similar source-domain communities.
• Score: 0.5225254533678074
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Digital platforms increasingly operate as isolated information silos, limiting their ability to construct comprehensive user representations across domains. Cross-domain recommender systems seek to overcome this limitation by transferring knowledge from a source domain to a target domain, yet most existing approaches depend on shared users, shared items, or structurally similar interaction graphs. These assumptions are often unrealistic across independent platforms. We propose SPHERE (Semantic Personas for Heterogeneous cross-domain Recommendation), a design artifact that enables recommendation knowledge transfer across strictly disjoint domains with no shared users or items. Rather than aligning domains through identity or graph structure, SPHERE uses large language models to induce a shared behavioral vocabulary, generate structured semantic personas for users, and retrieve behaviorally similar source-domain communities that form a Community Source Persona. This semantic signal is integrated with collaborative signals through a dual-tower architecture and dynamic fusion gate, allowing SPHERE to augment standard recommender backbones. Empirical evaluation across Amazon Books, Goodreads, and Steam demonstrates consistent improvements over NCF, SVD++, and LightGCN baselines under full-ranking evaluation. The results show that cross-domain transfer effectiveness is not determined solely by semantic proximity between domains; rather, it depends critically on the structural density and native predictive strength of the target domain. The study contributes to information systems research by reframing cross-domain personalization as behavior-based semantic alignment, offering a practical mechanism for overcoming information silos while preserving interpretability and modularity.

Related papers

• ATLAS: Learning to Recommend Across Unseen Domains [2.134948383299948]
  ATLAS is a multi-source recommendation domain generalization framework.<n>It learns a shared, domain-invariant user-item representation from disjoint source domains, enabling zero-shot recommendation on unseen domains.<n>Trained on five Amazon domains, ATLAS outperforms state-of-the-art sequential, graph-based, cross-domain, quantization-based, and LLM-based baselines on most unseen domains.
  arXiv  Detail & Related papers  (2026-08-04T16:29:02Z)
• FedCRF: A Federated Cross-domain Recommendation Method with Semantic-driven Deep Knowledge Fusion [11.371836852388205]
  This paper proposes a Federated Cross-domain Recommendation method with deep knowledge Fusion (FedCRF)<n>Using textual semantics as a cross-domain bridge, FedCRF achieves cross-domain knowledge transfer via federated semantic learning under the non-overlapping scenario.<n> Experimental results on multiple real-world datasets show that FedCRF significantly outperforms existing methods in terms of Recall@20 and NDCG@20.
  arXiv  Detail & Related papers  (2026-04-20T00:37:40Z)
• From Clues to Generation: Language-Guided Conditional Diffusion for Cross-Domain Recommendation [8.759054108541394]
  Cross-domain Recommendation (CDR) exploits multi-domain correlations to alleviate data sparsity.<n>This paper proposes Language-Guided Conditional Diffusion for CDR (LGCD), a novel framework that integrates Large Language Models (LLMs) and diffusion models for inter-domain sequential recommendation.
  arXiv  Detail & Related papers  (2026-04-07T03:05:22Z)
• DisCo: Graph-Based Disentangled Contrastive Learning for Cold-Start Cross-Domain Recommendation [11.61586672399166]
  Cross-domain recommendation (CDR) has emerged as a promising solution.<n>However, users with similar preferences in the source domain may exhibit different interests in the target domain.<n>We propose a novel graph-based disentangled contrastive learning framework to capture fine-grained user intent.
  arXiv  Detail & Related papers  (2024-12-19T16:20:42Z)
• Exploring User Retrieval Integration towards Large Language Models for Cross-Domain Sequential Recommendation [66.72195610471624]
  Cross-Domain Sequential Recommendation aims to mine and transfer users' sequential preferences across different domains. We propose a novel framework named URLLM, which aims to improve the CDSR performance by exploring the User Retrieval approach.
  arXiv  Detail & Related papers  (2024-06-05T09:19:54Z)
• StyDeSty: Min-Max Stylization and Destylization for Single Domain Generalization [85.18995948334592]
  Single domain generalization (single DG) aims at learning a robust model generalizable to unseen domains from only one training domain. State-of-the-art approaches have mostly relied on data augmentations, such as adversarial perturbation and style enhancement, to synthesize new data. We propose emphStyDeSty, which explicitly accounts for the alignment of the source and pseudo domains in the process of data augmentation.
  arXiv  Detail & Related papers  (2024-06-01T02:41:34Z)
• Cross-domain Recommender Systems via Multimodal Domain Adaptation [2.306402684958048]
  Collaborative Filtering (CF) has emerged as one of the most prominent implementation strategies for building recommender systems.<n>Cross-domain CF alleviates the problem of data sparsity by finding a common set of entities (users or items) across the domains.<n>This paper introduces a domain adaptation technique to align the embeddings of entities across domains.
  arXiv  Detail & Related papers  (2023-06-24T07:27:43Z)
• Unsupervised Domain Adaptation via Style-Aware Self-intermediate Domain [52.783709712318405]
  Unsupervised domain adaptation (UDA) has attracted considerable attention, which transfers knowledge from a label-rich source domain to a related but unlabeled target domain.<n>We propose a novel style-aware feature fusion method (SAFF) to bridge the large domain gap and transfer knowledge while alleviating the loss of class-discnative information.
  arXiv  Detail & Related papers  (2022-09-05T10:06:03Z)
• Domain-Agnostic Prior for Transfer Semantic Segmentation [197.9378107222422]
  Unsupervised domain adaptation (UDA) is an important topic in the computer vision community. We present a mechanism that regularizes cross-domain representation learning with a domain-agnostic prior (DAP) Our research reveals that UDA benefits much from better proxies, possibly from other data modalities.
  arXiv  Detail & Related papers  (2022-04-06T09:13:25Z)
• Cluster, Split, Fuse, and Update: Meta-Learning for Open Compound Domain Adaptive Semantic Segmentation [102.42638795864178]
  We propose a principled meta-learning based approach to OCDA for semantic segmentation. We cluster target domain into multiple sub-target domains by image styles, extracted in an unsupervised manner. A meta-learner is thereafter deployed to learn to fuse sub-target domain-specific predictions, conditioned upon the style code. We learn to online update the model by model-agnostic meta-learning (MAML) algorithm, thus to further improve generalization.
  arXiv  Detail & Related papers  (2020-12-15T13:21:54Z)
• Learning to Combine: Knowledge Aggregation for Multi-Source Domain Adaptation [56.694330303488435]
  We propose a Learning to Combine for Multi-Source Domain Adaptation (LtC-MSDA) framework. In the nutshell, a knowledge graph is constructed on the prototypes of various domains to realize the information propagation among semantically adjacent representations. Our approach outperforms existing methods with a remarkable margin.
  arXiv  Detail & Related papers  (2020-07-17T07:52:44Z)

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.