Robust enhanced collaborative filtering without explicit noise filtering
Journal of Supercomputing, ISSN: 1573-0484, Vol: 80, Issue: 11, Page: 15763-15782
2024
- 10Captures
Metric Options: Counts1 Year3 YearSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Metrics Details
- Captures10
- Readers10
- 10
Article Description
Graph convolutional neural networks have been successfully applied to collaborative filtering to capture high-quality user-item representations. Despite their remarkable performance, there are still limitations that hinder further improvement of recommender systems. Most existing recommendation systems utilize implicit feedback data for model training, but such data inevitably contains adversarial interaction noise. The conventional graph-based collaborative filtering method fails to effectively filter out this noise, and instead amplifies its impact, resulting in degraded model performance. To address this issue, we propose a robustness-enhanced collaborative filtering graph neural network model that does not rely on explicit noise filtering. Our approach involves simulating user-item interactions that do not exist in practice as adversarial interaction noise using random noise. To mitigate the impact of this noise in hidden feedback, we replace them with randomly selected partial nodes based on the principle of mutual information maximization. Our model has been extensively experimented on three public datasets (MovieLens-1 M, Yelp, and Ta-feng) and achieves performance improvements of about 5%, 10%, and 14%, respectively, compared to the state-of-the-art baseline model. In particular, in model robustness experiments, our model achieves significant performance improvements of about 13% and 17% in Yelp and Ta-feng. A comprehensive experimental study shows that our proposed method is reasonably effective and interpretable.
Bibliographic Details
Springer Science and Business Media LLC
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know