Skip to main content
archive
Search Submit Donate Log in
Press Enter to search · Advanced search

Computer Science > Information Retrieval

arXiv:2403.20298 (cs)
[Submitted on 29 Mar 2024 (v1), last revised 19 Mar 2025 (this version, v3)]

Title:Review-Based Hyperbolic Cross-Domain Recommendation

Authors:Yoonhyuk Choi, Jiho Choi, Taewook Ko, Chong-Kwon Kim
View a PDF of the paper titled Review-Based Hyperbolic Cross-Domain Recommendation, by Yoonhyuk Choi and 3 other authors
View PDF HTML (experimental)
Abstract:The issue of data sparsity poses a significant challenge to recommender systems. In response to this, algorithms that leverage side information such as review texts have been proposed. Furthermore, Cross-Domain Recommendation (CDR), which captures domain-shareable knowledge and transfers it from a richer domain (source) to a sparser one (target), has received notable attention. Nevertheless, the majority of existing methodologies assume a Euclidean embedding space, encountering difficulties in accurately representing richer text information and managing complex interactions between users and items. This paper advocates a hyperbolic CDR approach based on review texts for modeling user-item relationships. We first emphasize that conventional distance-based domain alignment techniques may cause problems because small modifications in hyperbolic geometry result in magnified perturbations, ultimately leading to the collapse of hierarchical structures. To address this challenge, we propose hierarchy-aware embedding and domain alignment schemes that adjust the scale to extract domain-shareable information without disrupting structural forms. The process involves the initial embedding of review texts in hyperbolic space, followed by feature extraction incorporating degree-based normalization and structure alignment. We conducted extensive experiments to substantiate the efficiency, robustness, and scalability of our proposed model in comparison to state-of-the-art baselines.
Comments: WSDM '25
Subjects: Information Retrieval (cs.IR); Machine Learning (cs.LG)
Cite as: arXiv:2403.20298 [cs.IR]
  (or arXiv:2403.20298v3 [cs.IR] for this version)
  https://doi.org/10.48550/arXiv.2403.20298
arXiv-issued DOI via DataCite
Related DOI: https://doi.org/10.1145/3701551.3703486
DOI(s) linking to related resources

Submission history

From: YoonHyuk Choi [view email]
[v1] Fri, 29 Mar 2024 17:15:21 UTC (3,152 KB)
[v2] Thu, 23 Jan 2025 05:48:39 UTC (3,109 KB)
[v3] Wed, 19 Mar 2025 07:11:37 UTC (3,109 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled Review-Based Hyperbolic Cross-Domain Recommendation, by Yoonhyuk Choi and 3 other authors
  • View PDF
  • HTML (experimental)
  • TeX Source
view license

Additional Features

  • Audio Summary

Current browse context:

cs.IR
< prev   |   next >
new | recent | 2024-03
Change to browse by:
cs
cs.LG

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
Loading...

BibTeX formatted citation

Data provided by:

Bookmark

BibSonomy Reddit

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
We gratefully acknowledge support from our major funders, member institutions, , and all contributors.
About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab)
Major funding support from
Simons Foundation Simons Foundation International Schmidt Sciences