Pith. sign in

REVIEW

Graph Attention Collaborative Similarity Embedding for Recommender System

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2102.03135 v1 pith:LOBC3CYI submitted 2021-02-05 cs.IR

classification cs.IR
keywords collaborativegraphlossattentionembeddinginformationsimilaritiessimilarity
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We present Graph Attention Collaborative Similarity Embedding (GACSE), a new recommendation framework that exploits collaborative information in the user-item bipartite graph for representation learning. Our framework consists of two parts: the first part is to learn explicit graph collaborative filtering information such as user-item association through embedding propagation with attention mechanism, and the second part is to learn implicit graph collaborative information such as user-user similarities and item-item similarities through auxiliary loss. We design a new loss function that combines BPR loss with adaptive margin and similarity loss for the similarities learning. Extensive experiments on three benchmarks show that our model is consistently better than the latest state-of-the-art models.

Discussion (0). Sign in to comment.

Pith tools