Addressing the cold start problem in privacy preserving content-based recommender systems using hypercube graphs

The initial interaction of a user with a recommender system is problematic because, in such a so-called cold start situation, the recommender system has very little information about the user, if any. Moreover, in collaborative filtering, users need to share their preferences with the service provider by rating items while in content-based filtering there is no need for such information sharing. A content-based model using hypercube graphs has recently been proposed and appears to be able to estimate user profiles based on a very limited number of ratings while preserving user privacy. In this paper, we confirm these findings on the basis of experiments with more than 1000 users in the restaurant and movie domains. We show that the proposed method outperforms standard machine learning algorithms when the number of available ratings is at most 10, which often happens, and is competitive with larger training sets. In addition, training is simple and doesn’t require large computational efforts.

Publication Details

Journal
Springer Link (Chiba Institute of Technology)
Published
2026-01-07
DOI
https://doi.org/10.1051/ro/2025151/pdf
Primary Topic
Recommender Systems and Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Addressing the cold start problem in privacy preserving content-based recommender systems using hypercube graphs

Springer Link (Chiba Institute of Technology)
Recommender Systems and Techniques
article

Addressing the cold start problem in privacy preserving content-based recommender systems using hypercube graphs

article en

Abstract

The initial interaction of a user with a recommender system is problematic because, in such a so-called cold start situation, the recommender system has very little information about the user, if any. Moreover, in collaborative filtering, users need to share their preferences with the service provider by rating items while in content-based filtering there is no need for such information sharing. A content-based model using hypercube graphs has recently been proposed and appears to be able to estimate user profiles based on a very limited number of ratings while preserving user privacy. In this paper, we confirm these findings on the basis of experiments with more than 1000 users in the restaurant and movie domains. We show that the proposed method outperforms standard machine learning algorithms when the number of available ratings is at most 10, which often happens, and is competitive with larger training sets. In addition, training is simple and doesn’t require large computational efforts.

Springer Link (Chiba Institute of Technology)
Openalex Percentile: Top 100%
Recommender Systems and Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Addressing the cold start problem in privacy preserving content-based recommender systems using hypercube graphs · Springer Link (Chiba Institute of Technology) (2026) | TGRS Research Map | TGRS