Recommender systems based on Graph Neural Networks (GNN) have become the state-of-the-art approach in recommendation, but they struggle with in extreme cold-start settings, where most users or items lack interaction data. This paper proposes a novel framework to address this challenge in four steps: (i) a propensity model to predict item purchase behaviour, with associated explainability to identify the most relevant features, (ii) a link augmentation module to connect users based on previously obtained similarities, (iii) a GNN-based link prediction step on the obtained dense graph and (iv) a final re-ranking stage to increase diversity in predictions leveraging users embeddings. By exploiting the enriched graph structure, the framework generates embeddings for cold-start users and items, enabling diverse recommendations, containing long tail and unsold items, for both established and new users. We validate the framework's effectiveness on real-world industrial data from TIM S.p.A.

Mitigating Extreme Cold Start in Graph-based RecSys through Re-ranking / Sbandi, Alessandro; Siciliano, Federico; Silvestri, Fabrizio. - (2024), pp. 4844-4851. (Intervento presentato al convegno 33rd ACM International Conference on Information and Knowledge Management tenutosi a Boise; Idaho; USA) [10.1145/3627673.3680069].

Mitigating Extreme Cold Start in Graph-based RecSys through Re-ranking

Alessandro Sbandi
;
Federico Siciliano
;
Fabrizio Silvestri
2024

Abstract

Recommender systems based on Graph Neural Networks (GNN) have become the state-of-the-art approach in recommendation, but they struggle with in extreme cold-start settings, where most users or items lack interaction data. This paper proposes a novel framework to address this challenge in four steps: (i) a propensity model to predict item purchase behaviour, with associated explainability to identify the most relevant features, (ii) a link augmentation module to connect users based on previously obtained similarities, (iii) a GNN-based link prediction step on the obtained dense graph and (iv) a final re-ranking stage to increase diversity in predictions leveraging users embeddings. By exploiting the enriched graph structure, the framework generates embeddings for cold-start users and items, enabling diverse recommendations, containing long tail and unsold items, for both established and new users. We validate the framework's effectiveness on real-world industrial data from TIM S.p.A.
2024
33rd ACM International Conference on Information and Knowledge Management
cold start; graph neural networks; recommender systems
04 Pubblicazione in atti di convegno::04b Atto di convegno in volume
Mitigating Extreme Cold Start in Graph-based RecSys through Re-ranking / Sbandi, Alessandro; Siciliano, Federico; Silvestri, Fabrizio. - (2024), pp. 4844-4851. (Intervento presentato al convegno 33rd ACM International Conference on Information and Knowledge Management tenutosi a Boise; Idaho; USA) [10.1145/3627673.3680069].
File allegati a questo prodotto
File Dimensione Formato  
Sbandi_postprint_Mitigating_2024.pdf

solo gestori archivio

Tipologia: Documento in Post-print (versione successiva alla peer review e accettata per la pubblicazione)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 1.72 MB
Formato Adobe PDF
1.72 MB Adobe PDF   Contatta l'autore
Sbandi_Mitigating_2024.pdf

accesso aperto

Note: https://dl.acm.org/doi/pdf/10.1145/3627673.3680069
Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Creative commons
Dimensione 1.77 MB
Formato Adobe PDF
1.77 MB Adobe PDF

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/1726620
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? 0
social impact