14 August 2024 in Knowledge-Based Systems
29 April 2024 in ACM Transactions on Information Systems
Casting sequential recommendation (SR) as a reinforcement learning (RL) problem is promising and some RL-based methods have been proposed for SR. However, these models are sub-optimal due to the following limitations: (a) they fail to leverage the supervision signals in the RL training to capture users’ explicit preferences, leading to slow convergence; and (b) they do not utilize auxiliary information (e.g., knowledge graph) to avoid blindness when exploring users’ potential interests. To address the above-mentioned limitations, we propose a multiplex information-guided RL model (MELOD), which employs a novel RL training framework with Teach and Explore components for SR. We adopt a Teach component to accurately capture users’ explicit preferences and speed up RL convergence. Meanwhile, we design a dynamic intent induction network (DIIN) as a policy function to generate diverse predictions. We utilize the DIIN for the Explore component to mine users’ potential interests by conducting a sequential and knowledge information joint-guided exploration. Moreover, a sequential and knowledge-aware reward function is designed to achieve stable RL training. These components significantly improve MELOD’s performance and convergence against existing RL algorithms to achieve effectiveness and efficiency. Experimental results on seven real-world datasets show that our model significantly outperforms state-of-the-art methods.
2 January 2025 in IEEE Transactions on Computational Social Systems
Fake news detection on social media is crucial to purifying the online environment and protecting public safety. Many existing methods explore the news propagation structures through graph neural networks (GNNs) to determine the truthfulness of news. End-to-end supervised GNNs notoriously depend on large amounts of labels. Recently, self-supervised graph pretraining has been a promising solution to alleviate the dependence on labels. However, the application of graph pretraining in fake news detection still suffers from two challenges: 1) the missing and unreliable interactions intrinsic in the news propagation structures seriously damage the pretraining performance. 2) There is an inherent gap between pretraining and downstream fake news detection tasks due to inconsistency in optimization objectives, which hinders the efficient transfer of pretrained prior knowledge and causes suboptimal detection results. To address the above two challenges, we propose RGCP, a structure redefined graph pretraining with contrastive prompting for fake news detection. Specifically, we design a propagation structure refinement module that adds potential implicit interactions and removes noisy interactions according to the connection probabilities between posts estimated under the guidance of self-supervised contrastive learning. Thereby, the redefined structures provide reliable news propagation patterns to generate robust pretrained news representations. Moreover, we propose a novel prompt tuning based on the contrastive learning module that reformulates the downstream fake news detection task in a similar form as the graph contrastive pretraining, bridging the optimization objective gap. The extensive experiments on benchmark datasets demonstrate the superiority of RGCP, achieving an average improvement of 10.15% in few-shot classification.