PGCF: Perception graph collaborative filtering for recommendation

Extensive studies have fully proved the effectiveness of collaborative filtering(CF)recommen dation models based on graph convolutional networks(GCNs).As an advanced interaction encoder,however,GCN-based CF models do not differentiate neighboring nodes,which will lead to suboptimal recommendation performance.In addition,most GCN-based CF studies pay insufficient attention to the loss function and they simply select the Bayesian personalized ranking(BPR)loss function to train the model.However,we believe that the loss function is as important as the interaction encoder and deserves more attentions.To address the above issues,we propose a novel GCN-based CF model,named perception graph collaborative filtering(PGCF).Specifically,for the interaction encoder,we design a neighborhood-perception GCN to enhance the aggregation of interest-related information of the target node during the information aggregation process,while weakening the propagation of noise and irrelevant information to help the model learn better embedding representation.For the loss function,we design a margin-perception Bayesian personalized ranking(MBPR)loss function,which introduces a self-perception margin,requiring the predicted score of the user-positive sample to be greater than that of the user-negative sample,and also greater than the sum of the predicted score of the user-negative sample and the margin.The experimental results on five benchmark datasets show that PGCF is significantly superior to multiple existing CFmodels.