Wanjie Tao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Wanjie Tao has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Zulong Chen
Alibaba Group, Hangzhou, China
7 shared publications - Qun Dai
Nanjing University of Aeronautics and Astronautics, Nanjing, China
6 shared publications - Ning Jiang
Mashang Consumer Finance Co., Ltd, Chongqing, China
4 shared publications - Quan Lu
Mashang Consumer Finance Co., Ltd, Chongqing, China
4 shared publications - Huihui Liu
Alibaba Group, Hangzhou, China
2 shared publications - Jia Xu
Cyberspace Institute of Advanced Technology, Guangzhou University, Guangzhou, 510555, GuangDong, China; Key Laboratory of Cyberspace Security Defense (Institute of Information Engineering, Chinese Academy of Sciences), Beijing, 100085, Beijing, China
2 shared publications
Latest Publications
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 8531-8538
Beyond End-to-End: A Low-Latency, Retrieval-Augmented Chain-of-Thought for Scalable and Explainable Industrial Recommendation
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 8531-8538
Open AccessBeyond End-to-End: A Low-Latency, Retrieval-Augmented Chain-of-Thought for Scalable and Explainable Industrial Recommendation
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 7874-7879
FailSafe-RAG: Evidence-State-Aware Generation under Retrieval Failures
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 7874-7879
Open AccessFailSafe-RAG: Evidence-State-Aware Generation under Retrieval Failures
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 4869-4873
NBA-Net: Next-Behavior-Aware Network for Intent Recommendation
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 4869-4873
Open AccessNBA-Net: Next-Behavior-Aware Network for Intent Recommendation
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 8609-8612
Rethinking MoE with Retrieval-Memory Synergy: Towards Efficient Expert Coordination
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 8609-8612
Open AccessRethinking MoE with Retrieval-Memory Synergy: Towards Efficient Expert Coordination
- Open Access
- 8 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 1172-1175
Dynamic Topic Segmentation in Dialogues: Enhancing Boundaries with Topic-Aware Propagation
- 8 May 2025
- Published by Association for Computing Machinery (ACM)
- p. 1172-1175
Open AccessDynamic Topic Segmentation in Dialogues: Enhancing Boundaries with Topic-Aware Propagation
- 6 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (12) , 19757-19769
Collaboration or Competition: An Infomax-Based Period-Aware Transformer for Ticket-Grabbing Prediction
Helping users to grab train tickets during a travel peak is a very important service provided by many mainstream online travel platforms (OTPs), e.g., booking.com, Ctrip.com, and Alibaba Fliggy, which greatly enriches the experience for platform users. To optimize such train ticket-grabbing service, a vital accompanying task is to predict the train ticket-grabbing success rates for users during their train ticket-grabbing process to help them make decisions. Although many endeavours have been made towards the traffic prediction problem, none of them was dedicated to solving the ticket-grabbing issue. That is, prior methods ignored the unique properties exhibited in the ticket-grabbing scenario, such as the specific spatial relationship between stations and trains, the collaboration and competition relationships between different routes, and the temporal periodic pattern in ticket-grabbing. In this paper, we propose a novel Infomax-based Period-aware Transformer () tailored for predicting the success rate of train ticket-grabbing that will be displayed on OTPs, which is to our best knowledge the first attempt along this line. contains three modules: +1) a multi-view node embedding module, which serves to model the special spatial relationships between stations and trains by employing the intra-and inter-graph aggregation layers; +2) an infomax-based graph representation learning module, which aims to learn a high-level node embedding by training a discriminator to distinguish different types of edges in the route graph; +3) a period-aware Transformer module, which intends to discover the ticket-grabbing temporal periodic dependencies by designing a periodic activation function. Extensive offline and online evaluations on a real-world dataset show that substantially outperforms state-of-the-art baselines.
- 6 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (12) , 19757-19769
Collaboration or Competition: An Infomax-Based Period-Aware Transformer for Ticket-Grabbing Prediction
Helping users to grab train tickets during a travel peak is a very important service provided by many mainstream online travel platforms (OTPs), e.g., booking.com, Ctrip.com, and Alibaba Fliggy, which greatly enriches the experience for platform users. To optimize such train ticket-grabbing service, a vital accompanying task is to predict the train ticket-grabbing success rates for users during their train ticket-grabbing process to help them make decisions. Although many endeavours have been made towards the traffic prediction problem, none of them was dedicated to solving the ticket-grabbing issue. That is, prior methods ignored the unique properties exhibited in the ticket-grabbing scenario, such as the specific spatial relationship between stations and trains, the collaboration and competition relationships between different routes, and the temporal periodic pattern in ticket-grabbing. In this paper, we propose a novel Infomax-based Period-aware Transformer () tailored for predicting the success rate of train ticket-grabbing that will be displayed on OTPs, which is to our best knowledge the first attempt along this line. contains three modules: +1) a multi-view node embedding module, which serves to model the special spatial relationships between stations and trains by employing the intra-and inter-graph aggregation layers; +2) an infomax-based graph representation learning module, which aims to learn a high-level node embedding by training a discriminator to distinguish different types of edges in the route graph; +3) a period-aware Transformer module, which intends to discover the ticket-grabbing temporal periodic dependencies by designing a periodic activation function. Extensive offline and online evaluations on a real-world dataset show that substantially outperforms state-of-the-art baselines.
- Open Access
- 4 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 5315-5326
PlanRanker: Towards Personalized Ranking of Train Transfer Plans
- 4 August 2023
- Published by Association for Computing Machinery (ACM)
- p. 5315-5326
Open AccessPlanRanker: Towards Personalized Ranking of Train Transfer Plans
- Open Access
- 18 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 1966-1970
Event-Aware Adaptive Clustering Uplift Network for Insurance Creative Ranking
In the classical e-commerce platforms, the personalized product-tying recommendation has proven to be of great added value, which improves users' purchase willingness to product-tying by displaying the suitable marketing creative. In this paper, we present a new recommendation problem, i.e., the Pop-up One-time Marketing (POM), where the product-tying marketing creative only pops up one time when the user pays for the main item. POM has become a ubiquitous application in e-commerce platforms, e.g., buy the mobile tying mobile case and buy flight ticket tying insurance. However, many existing recommendation methods are sub-optimal for the creative marketing in the POM scenario due to unconsidering the unique characteristics in the scenario. To tackle this problem, we propose a novel framework named Event-aware Adaptive Clustering Uplift Network (EACU-Net) for the POM scenario, which is to our best knowledge the first attempt along this line. EACU-Net contains three modules: (1) the event-aware graph cascading learning, which employs a heterogeneous graph network to comprehensively learn the embedding for the user attributes, event categories, and creative elements by stage. (2) an adaptive clustering uplift network, which learns the sensitivity of users to creatives under the same context. (3) an event-aware information gain network to learn more information from samples with event affection. Extensive offline and online evaluations on a real-world e-commerce platform demonstrate the superior performance of the proposed model compared with the state-of-the-art method.
- 18 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 1966-1970
Open AccessEvent-Aware Adaptive Clustering Uplift Network for Insurance Creative Ranking
In the classical e-commerce platforms, the personalized product-tying recommendation has proven to be of great added value, which improves users' purchase willingness to product-tying by displaying the suitable marketing creative. In this paper, we present a new recommendation problem, i.e., the Pop-up One-time Marketing (POM), where the product-tying marketing creative only pops up one time when the user pays for the main item. POM has become a ubiquitous application in e-commerce platforms, e.g., buy the mobile tying mobile case and buy flight ticket tying insurance. However, many existing recommendation methods are sub-optimal for the creative marketing in the POM scenario due to unconsidering the unique characteristics in the scenario. To tackle this problem, we propose a novel framework named Event-aware Adaptive Clustering Uplift Network (EACU-Net) for the POM scenario, which is to our best knowledge the first attempt along this line. EACU-Net contains three modules: (1) the event-aware graph cascading learning, which employs a heterogeneous graph network to comprehensively learn the embedding for the user attributes, event categories, and creative elements by stage. (2) an adaptive clustering uplift network, which learns the sensitivity of users to creatives under the same context. (3) an event-aware information gain network to learn more information from samples with event affection. Extensive offline and online evaluations on a real-world e-commerce platform demonstrate the superior performance of the proposed model compared with the state-of-the-art method.