pith. sign in

arxiv: 2312.04071 · v1 · pith:ILR6TEAPnew · submitted 2023-12-07 · 💻 cs.IR · cs.AI

Synergistic Signals: Exploiting Co-Engagement and Semantic Links via Graph Neural Networks

classification 💻 cs.IR cs.AI
keywords graphentitiessemanticco-engagementdataedgesnovelcollaborative
0
0 comments X
read the original abstract

Given a set of candidate entities (e.g. movie titles), the ability to identify similar entities is a core capability of many recommender systems. Most often this is achieved by collaborative filtering approaches, i.e. if users co-engage with a pair of entities frequently enough, the embeddings should be similar. However, relying on co-engagement data alone can result in lower-quality embeddings for new and unpopular entities. We study this problem in the context recommender systems at Netflix. We observe that there is abundant semantic information such as genre, content maturity level, themes, etc. that complements co-engagement signals and provides interpretability in similarity models. To learn entity similarities from both data sources holistically, we propose a novel graph-based approach called SemanticGNN. SemanticGNN models entities, semantic concepts, collaborative edges, and semantic edges within a large-scale knowledge graph and conducts representation learning over it. Our key technical contributions are twofold: (1) we develop a novel relation-aware attention graph neural network (GNN) to handle the imbalanced distribution of relation types in our graph; (2) to handle web-scale graph data that has millions of nodes and billions of edges, we develop a novel distributed graph training paradigm. The proposed model is successfully deployed within Netflix and empirical experiments indicate it yields up to 35% improvement in performance on similarity judgment tasks.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Graph Neural Network based Hierarchy-Aware Embeddings of Knowledge Graphs: Applications to Yeast Phenotype Prediction

    cs.LG 2026-05 unverdicted novelty 6.0

    GNNs with ontology-derived semantic loss create hierarchy-aware box embeddings of a yeast knowledge graph that raise double-knockout growth prediction R² to 0.377 and generalize to triple knockouts while identifying a...

  2. Graph Neural Network based Hierarchy-Aware Embeddings of Knowledge Graphs: Applications to Yeast Phenotype Prediction

    cs.LG 2026-05 unverdicted novelty 5.0

    GNNs with ontology-derived semantic loss create hierarchy-aware KG embeddings that predict yeast double gene knockout phenotypes with mean R²=0.360 (improved to 0.377 with semantic loss), outperforming baselines, gene...