9 June 2022 in Knowledge-Based Systems
1 December 2021 in Knowledge-Based Systems
30 November 2021 in ACM/IMS Transactions on Data Science
Due to its nature of learning from dynamic interactions and planning for long-run performance, Reinforcement Learning (RL) has attracted much attention in Interactive Recommender Systems (IRSs). However, most of the existing RL-based IRSs usually face large discrete action space problem, which severely limits their efficiency. Moreover, data sparsity is another problem that most IRSs are confronted with. The utilization of recommendation-related textual knowledge can tackle this problem to some extent, but existing RL-based recommendation methods either neglect to combine textual information or are not suitable for incorporating it. To address these two problems, in this article, we propose a T ext-based deep R einforcement learning framework using self-supervised G raph representation for I nteractive R ecommendation (TRGIR). Specifically, we leverage textual information to map items and users into a same feature space by a self-supervised embedding method based on the graph convolutional network, which greatly alleviates data sparsity problem. Moreover, we design an effective method to construct an action candidate set, which reduces the scale of the action space directly. Two types of representative reinforcement learning algorithms have been applied to implement TRGIR. Since the action space of IRS is discrete, it is natural to implement TRGIR with Deep Q-learning Network (DQN). In the TRGIR implementation with Deep Deterministic Policy Gradient (DDPG), denoted as TRGIR-DDPG, we design a policy vector, which can represent user’s preferences, to generate discrete actions from the candidate set. Through extensive experiments on three public datasets, we demonstrate that TRGIR-DDPG achieves state-of-the-art performance over several baselines in a time-efficient manner.
29 January 2025 in IEEE Transactions on Network Science and Engineering
In this article, a distributed probability density function (PDF)-consensus particle filter (PF) algorithm for a class of network systems with degradation is discussed. In order to consider the interaction between component-level degradation and system state, the degradation modelling framework is developed by combining the stochastic degradation process and the state transition model of the system. And the dynamics of the degradation model are described in terms of a Wiener-based process to emphasize the evolution of degradation over time. To reach consensus on the local posterior PDFs at each node in the sense of relative entropy and reduce the communication burden, the state space of the system is divided by a group of weighted grids. Then, the local PDFs are approximated with a combination of the indicator functions and exchange the parameters with neighboring nodes. In order to obtain the particle representation of the fused PDFs, a new importance sampling function is developed to fuse the local grid-based PDFs and to enhance the compatibility of particles with neighboring nodes. A numerical example on target tracking is provided to demonstrate the effectiveness of the proposed scheme.