Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zhongcui Ma

dblp:402/1435 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%
Artificial intelligence
1 paper
Reinforcement learning · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems › context-aware recommendation
dynamic recommendation
0.912025
The Adaptive Q-Network for Recommendation Tasks with Dynamic Item Space · AAAI 2025
Recommender systems
reinforcement-learning-based recommendation
0.912025
The Adaptive Q-Network for Recommendation Tasks with Dynamic Item Space · AAAI 2025
Machine learning › Reinforcement learning › value-based reinforcement learning
q-learning
0.312025
The Adaptive Q-Network for Recommendation Tasks with Dynamic Item Space · AAAI 2025
Machine learning › Reinforcement learning
value-based reinforcement learning
0.312025
The Adaptive Q-Network for Recommendation Tasks with Dynamic Item Space · AAAI 2025

Methods — techniques the papers use, named apart from their topics

continuous action space mapping · 1.7adaptive q-network · 1.7action characteristic prediction · 1.7
YearPublicationVenuePosition
2025 The Adaptive Q-Network for Recommendation Tasks with Dynamic Item Space
abstract
Reinforcement learning (RL) algorithms can improve recommendation performance by capturing long-term user-system interaction. However, current RL-based recommendation tasks seldom consider the dynamism of the environment, and standard RL algorithms are ineffective in recommending items dynamically. In addressing these issues, we design a novel task termed dynamic recommendation, which takes the emergence of real-world recommendable items into consideration. Meanwhile, we propose Adaptive Q-Network (AdaQN) to tackle the dynamic recommendation task. Firstly, AdaQN predicts the value of different action characteristics, particularly during the testing phase, which can capture emerging new action characteristics. The above procedure helps AdaQN in effectively adapting to the dynamic action space. Secondly, AdaQN establishes a stable mapping that projects the discrete action space onto a continuous characteristic space. Finally, AdaQN employs a lightweight Q-network design, which mitigates the complexity of the optimization process. Extensive experiments demonstrate that our approach has achieved state-of-the-art performance in the dynamic recommendation task.
Jianxiang Zhu, Dandan Lai, Zhongcui Ma, Yaxin Peng
AAAI3