Latent mutual feature extraction for cross-domain recommendation
- Authors
- Park, Hoon; Jung, Jason J.
- Issue Date
- Jun-2024
- Publisher
- SPRINGER LONDON LTD
- Keywords
- Cross-domain recommendation; Transfer learning; Heterogeneous CDR; Privacy-preserving CDR
- Citation
- KNOWLEDGE AND INFORMATION SYSTEMS, v.66, no.6, pp 3337 - 3354
- Pages
- 18
- Journal Title
- KNOWLEDGE AND INFORMATION SYSTEMS
- Volume
- 66
- Number
- 6
- Start Page
- 3337
- End Page
- 3354
- URI
- https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/72981
- DOI
- 10.1007/s10115-024-02065-y
- ISSN
- 0219-1377
0219-3116
- Abstract
- The aim of this paper is to propose a Cross-domain Recommendation (CDR) model targeting heterogeneous domains. Previous studies have mainly focused on homogeneous domains and pose limitations when applied to heterogeneous domains without common users, items, and metadata. To overcome this challenge, we propose a heterogeneous CDR model called latent features cross-domain recommendation (LFCDR). Our model leverages latent features (LF), which construct the correlations between user and item features based on domain categories, where a category represents the domain attributes. By extracting the LF of each domain, we find similar domain latent features and improve the performance of the sparsity domain through transfer learning. We performed experiments on latent features recommendation (LFR), a recommendation system using LF, and LFCDR, a CDR using LF of heterogeneous domains, using three heterogeneous domain datasets, and compared their performances with a factorization machine (FM). Our results illustrated that the performance of the LFR improved by up to 1.65, as measured by mean absolute error (MAE), compared to the FM. Additionally, the performance of the LFCDR improved by up to 1.66, depending on the relevance of the domain's category.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Software > School of Computer Science and Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.