TFPS: A Temporal Filtration-enhanced Positive Sample Set Construction Method for Implicit Collaborative Filtering
Not on the map. Why?
Abstract (arXiv)
The negative sampling strategy can effectively train collaborative filtering (CF) recommendation models based on implicit feedback by constructing positive and negative samples. However, existing methods primarily optimize the negative sampling process while neglecting the exploration of positive samples. Some denoising recommendation methods can be applied to denoise positive samples within negative sampling strategies, but they ignore temporal information. Existing work integrates sequential information during model aggregation but neglects time interval information, hindering accurate capture of users' current preferences. To address this problem, from a data perspective, we propose a novel temporal filtration-enhanced approach to construct a high-quality positive sample set. First, we design a time decay model based on interaction time intervals, transforming the original graph into a weighted user-item bipartite graph. Then, based on predefined filtering operations, the weighted user-item bipartite graph is layered. Finally, we design a layer-enhancement strategy to construct a high-quality positive sample set for the layered subgraphs. We provide theoretical insights into why TFPS can improve Recall@k and NDCG@k, and extensive experiments on three real-world datasets demonstrate the effectiveness of the proposed method. Additionally, TFPS can be integrated with various implicit CF recommenders or negative sampling methods to enhance its performance.
Key facts. No citing papers in the map yet (data through 13 Oct 2026). Builds on 25 of its 47 references that are in the map. First posted on arXiv 26 Feb 2026.
Builds on
25 of 47 references.
References · 25
- 2014Adam: A Method for Stochastic Optimizationcited by 37,093
- 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,467
- 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,135
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,135
- 2017Neural Collaborative Filteringcited by 1,110
- 2019BERT4Rec: Sequential Recommendation with Bidirectional Encoder Representations from Transformercited by 958
- 2015Session-based Recommendations with Recurrent Neural Networkscited by 688
- 2019Neural Graph Collaborative Filteringcited by 660
- 2020Graph Neural Networks in Recommender Systems: A Surveycited by 493
- 2020S^3-Rec: Self-Supervised Learning for Sequential Recommendation with Mutual Information Maximizationcited by 311
- 2019Learning Disentangled Representations for Recommendationcited by 110
- 2020Denoising Implicit Feedback for Recommendationcited by 80
13 more
- 2017IRGAN: A Minimax Game for Unifying Generative and Discriminative Information Retrieval Modelscited by 75
- 2023Frequency Enhanced Hybrid Attention Network for Sequential Recommendationcited by 52
- 2019Temporal Network Embedding with Micro- and Macro-dynamicscited by 51
- 2022Self-Guided Learning to Denoise for Robust Recommendationcited by 24
- 2024LinRec: Linear Attention Mechanism for Long-term Sequential Recommender Systemscited by 21
- 2024Double Correction Framework for Denoising Recommendationcited by 19
- 2023On the Theories Behind Hard Negative Sampling for Recommendationcited by 18
- 2021Learning Robust Recommenders through Cross-Model Agreementcited by 15
- 2019A framework for fake review detection in online consumer electronics retailerscited by 12
- 2024Diffusion-based Negative Sampling on Graphs for Link Predictioncited by 9
- 2024Adaptive Hardness Negative Sampling for Collaborative Filteringcited by 8
- 2023Augmented Negative Sampling for Collaborative Filteringcited by 7
- 2025Personalized Denoising Implicit Feedback for Robust Recommender Systemcited by 3
Built on by
Not cited yet.