Beyond Relevance: Enhancing Serendipity in Content-Based Recommendations With Knowledge Graphs

Content-based recommender systems suffer from overspecialization, creating filter bubbles that limit user exploration. Serendipitous recommendations that are unexpected and novel yet relevant offer a solution to this problem. Thus, this paper proposes a novel approach to enhance both precision and serendipity in content-based recommender systems using Knowledge Graph (KG) representations by enhancing the distance-based recommendation combined with LDA topic enrichment strategy. Our method combines the MovieLens SAC dataset (which includes details like actors, directors, and genres) with the Movie Plot Synopses with Tags (MPST) dataset to enrich item details. Using Latent Dirichlet Allocation (LDA), we generate topics from plot synopsis and integrate them into the KG alongside other features. User profiles are developed from movies rated <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\ge 3.5$ </tex-math></inline-formula> and strengthened using INTERESTED_IN relationships for features with occurrence counts <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\ge 2$ </tex-math></inline-formula> in the KG. We implement a two-hop distance approach on the KG to identify items that are semantically related yet sufficiently distant from user preferences. The semantic richness of KGs enables the exploration of hidden relationships between items and user preferences overlooked by conventional systems. Experiments demonstrate that our method significantly outperforms five baseline models (TF-IDF, LDA, rTF-IDF, rLDA, and dTF-IDF) across precision and serendipity measures. Results show our approach successfully discovers novel and unexpected items without sacrificing relevance, addressing the overspecialization problem in traditional content-based recommender systems. Future work will focus on enhancing the graph by integrating it with more contextual data, providing recommendation explanations, and evaluating through real user interactions.

Authors

Institutions

Publication Details

Journal
IEEE Access
Published
2025-01-01
DOI
https://doi.org/10.1109/access.2025.3598342
Citations
1
Primary Topic
Advanced Graph Neural Networks
Type
article
Field-Weighted Citation Impact
2.48

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Beyond Relevance: Enhancing Serendipity in Content-Based Recommendations With Knowledge Graphs

Sumaia Mohammed Al-Ghuribi, Masnizah Mohd, Nur Izyan Yasmin Saat, Shahrul Azman Mohd Noah
1 citations
IEEE Access
Advanced Graph Neural Networks
2.48
article

Beyond Relevance: Enhancing Serendipity in Content-Based Recommendations With Knowledge Graphs

Sumaia Mohammed Al-Ghuribi, Masnizah Mohd, Nur Izyan Yasmin Saat, Shahrul Azman Mohd Noah
article en
1 citations

Abstract

Content-based recommender systems suffer from overspecialization, creating filter bubbles that limit user exploration. Serendipitous recommendations that are unexpected and novel yet relevant offer a solution to this problem. Thus, this paper proposes a novel approach to enhance both precision and serendipity in content-based recommender systems using Knowledge Graph (KG) representations by enhancing the distance-based recommendation combined with LDA topic enrichment strategy. Our method combines the MovieLens SAC dataset (which includes details like actors, directors, and genres) with the Movie Plot Synopses with Tags (MPST) dataset to enrich item details. Using Latent Dirichlet Allocation (LDA), we generate topics from plot synopsis and integrate them into the KG alongside other features. User profiles are developed from movies rated <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\ge 3.5$ </tex-math></inline-formula> and strengthened using INTERESTED_IN relationships for features with occurrence counts <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\ge 2$ </tex-math></inline-formula> in the KG. We implement a two-hop distance approach on the KG to identify items that are semantically related yet sufficiently distant from user preferences. The semantic richness of KGs enables the exploration of hidden relationships between items and user preferences overlooked by conventional systems. Experiments demonstrate that our method significantly outperforms five baseline models (TF-IDF, LDA, rTF-IDF, rLDA, and dTF-IDF) across precision and serendipity measures. Results show our approach successfully discovers novel and unexpected items without sacrificing relevance, addressing the overspecialization problem in traditional content-based recommender systems. Future work will focus on enhancing the graph by integrating it with more contextual data, providing recommendation explanations, and evaluating through real user interactions.

IEEE AccessVol. 13
Prince Sattam Bin Abdulaziz University (SA), National University of Malaysia (MY)
Universiti Kebangsaan Malaysia
Openalex Percentile: Top 9%
Advanced Graph Neural Networks
2.48
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.