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.

Yunwen Xia

dblp:342/1458 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2024
0009-0000-9493-7213ORCID · corroborated

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

Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems › interactive recommendation
conversational recommendation
0.812024
Meta-CRS: A Dynamic Meta-Learning Approach for Effective Conversational Recommender System · ACM Trans. Inf. Syst. 2024
Recommender systems › cold-start recommendation
meta-learning for recommendation
0.812024
Meta-CRS: A Dynamic Meta-Learning Approach for Effective Conversational Recommender System · ACM Trans. Inf. Syst. 2024
Machine learning › Reinforcement learning
meta-reinforcement learning
0.212024
Meta-CRS: A Dynamic Meta-Learning Approach for Effective Conversational Recommender System · ACM Trans. Inf. Syst. 2024

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

transformer · 1.5graph structure · 1.5meta-reinforcement learning · 0.8meta reinforcement learning · 0.8
YearPublicationVenuePosition
2024 Meta-CRS: A Dynamic Meta-Learning Approach for Effective Conversational Recommender System
abstract
Conversational recommender system (CRS) enhances the recommender system by acquiring the latest user preference through dialogues, where an agent needs to decide “whether to ask or recommend”, “which attributes to ask”, and “which items to recommend” in each round. To explore these questions, reinforcement learning is adopted in most CRS frameworks. However, existing studies somewhat ignore to consider the connection between the previous rounds and the current round of the conversation, which might lead to the lack of prior knowledge and inaccurate decisions. In this view, we propose to facilitate the connections between different rounds of conversations in a dialogue session through deep transformer-based multi-channel meta-reinforcement learning, so that the CRS agent can decide each action/decision based on previous states, actions, and their rewards. Besides, to better utilize a user’s historical preferences, we propose a more dynamic and personalized graph structure to support the conversation module and the recommendation module. Experiment results on five real-world datasets and an online evaluation with real users in an industrial environment validate the improvement of our method over the state-of-the-art approaches and the effectiveness of our designs.
Yuxin Ni, Yunwen Xia, Hui Fang 0002, Chong Long, Xinyu Kong, Daqian Li, Jie Zhang 0002
ACM Trans. Inf. Syst.2
2023 Neural Airport Ground Handling
abstract
Airport ground handling (AGH) offers necessary operations to flights during their turnarounds and is of great importance to the efficiency of airport management and the economics of aviation. Such a problem involves the interplay among the operations that leads to NP-hard problems with complex constraints. Hence, existing methods for AGH are usually designed with massive domain knowledge but still fail to yield high-quality solutions efficiently. In this paper, we aim to enhance the solution quality and computation efficiency for solving AGH. Particularly, we first model AGH as a multiple-fleet vehicle routing problem (VRP) with miscellaneous constraints including precedence, time windows, and capacity. Then we propose a construction framework that decomposes AGH into sub-problems (i.e., VRPs) in fleets and present a neural method to construct the routing solutions to these sub-problems. In specific, we resort to deep learning and parameterize the construction heuristic policy with an attention-based neural network trained with reinforcement learning, which is shared across all sub-problems. Extensive experiments demonstrate that our method significantly outperforms classic meta-heuristics, construction heuristics and the specialized methods for AGH. Besides, we empirically verify that our neural method generalizes well to instances with large numbers of flights or varying parameters, and can be readily adapted to solve real-time AGH with stochastic flight arrivals. Our code is publicly available at:https://github.com/RoyalSkye/AGH.
Yaoxin Wu, Jianan Zhou 0002, Yunwen Xia, Xianli Zhang, Zhiguang Cao, Jie Zhang 0002
IEEE Trans. Intell. Transp. Syst.3
2023 Conversation-Based Adaptive Relational Translation Method for Next POI Recommendation With Uncertain Check-Ins
abstract
The uncertain check-ins bring challenges for current static next point-of-interest (POI) recommendation methods. Fortunately, the conversation-based recommendation has been shown the merit of integrating immediate user preference for more accurate recommendations. We, therefore, propose a conversation-based adaptive relational translation (CART) approach for the next POI recommendation over uncertain check-ins. It is equipped with recommender and conversation modules to interactively acquire users' immediate preferences and make dynamic recommendations. Specifically, the recommender built upon the adaptive relational translation method performs location prediction via modeling both users' historical sequential behaviors and the immediate preference received from conversations; the conversation module aims to achieve successful recommendations in fewer conversation turns by learning a conversational strategy, whereby the recommender can be updated via the user response. Extensive experiments on four real-world datasets show the superiority of our proposed CART over the state of the arts.
Lu Zhang 0063, Zhu Sun 0001, Jie Zhang 0002, Yunwen Xia
IEEE Trans. Neural Networks Learn. Syst.5