TasksSotADatasetsPapersMethodsSubmitAbout
Papers With Code 2

A community resource for machine learning research: papers, code, benchmarks, and state-of-the-art results.

Explore

Notable BenchmarksAll SotADatasetsPapersMethods

Community

Submit ResultsAbout

Data sourced from the PWC Archive (CC-BY-SA 4.0). Built by the community, for the community.

Papers/Multi-Task Feature Learning for Knowledge Graph Enhanced R...

Multi-Task Feature Learning for Knowledge Graph Enhanced Recommendation

Hongwei Wang, Fuzheng Zhang, Miao Zhao, Wenjie Li, Xing Xie, Minyi Guo

2019-01-23Knowledge GraphsKnowledge Graph EmbeddingNews RecommendationCollaborative FilteringMulti-Task LearningRecommendation SystemsGraph Embedding
PaperPDFCodeCodeCode(official)

Abstract

Collaborative filtering often suffers from sparsity and cold start problems in real recommendation scenarios, therefore, researchers and engineers usually use side information to address the issues and improve the performance of recommender systems. In this paper, we consider knowledge graphs as the source of side information. We propose MKR, a Multi-task feature learning approach for Knowledge graph enhanced Recommendation. MKR is a deep end-to-end framework that utilizes knowledge graph embedding task to assist recommendation task. The two tasks are associated by cross&compress units, which automatically share latent features and learn high-order interactions between items in recommender systems and entities in the knowledge graph. We prove that cross&compress units have sufficient capability of polynomial approximation, and show that MKR is a generalized framework over several representative methods of recommender systems and multi-task learning. Through extensive experiments on real-world datasets, we demonstrate that MKR achieves substantial gains in movie, book, music, and news recommendation, over state-of-the-art baselines. MKR is also shown to be able to maintain a decent performance even if user-item interactions are sparse.

Results

TaskDatasetMetricValueModel
Click-Through Rate PredictionMovieLens 1MAUC0.917MKR
Click-Through Rate PredictionMovieLens 1MAccuracy84.3MKR
Click-Through Rate PredictionLast.FMAUC0.689MKR
Click-Through Rate PredictionLast.FMAccuracy64.5MKR
Click-Through Rate PredictionChildren's Book Test Common nounAUC0.734MKR
Click-Through Rate PredictionChildren's Book Test Common nounAccuracy70.4MKR

Related Papers

IP2: Entity-Guided Interest Probing for Personalized News Recommendation2025-07-18A Reproducibility Study of Product-side Fairness in Bundle Recommendation2025-07-18SMART: Relation-Aware Learning of Geometric Representations for Knowledge Graphs2025-07-17SGCL: Unifying Self-Supervised and Supervised Learning for Graph Recommendation2025-07-17Similarity-Guided Diffusion for Contrastive Sequential Recommendation2025-07-16Looking for Fairness in Recommender Systems2025-07-16Robust-Multi-Task Gradient Boosting2025-07-15Journalism-Guided Agentic In-Context Learning for News Stance Detection2025-07-15