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

Chuan Yuan

dblp:222/1204 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · conflict

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

Databases, data management, data science and information retrieval · 2 · 1 since 2021Artificial 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
3 papers
Recommender systems · 80% Information retrieval · 20%
Artificial intelligence
1 paper
Representation and self-supervised learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning
contrastive learning
0.912025
DOGR: Leveraging Document-Oriented Contrastive Learning in Generative Retrieval · AAAI 2025
Recommender systems › click-through rate prediction
feature interaction
0.912025
A Learnable Fully Interacted Two-Tower Model for Pre-Ranking System · SIGIR 2025
Information retrieval › retrieval models
generative retrieval
0.912025
DOGR: Leveraging Document-Oriented Contrastive Learning in Generative Retrieval · AAAI 2025
Recommender systems › large-scale recommendation › multi-stage recommender systems
pre-ranking
0.912025
A Learnable Fully Interacted Two-Tower Model for Pre-Ranking System · SIGIR 2025
Recommender systems › neural recommendation
two-tower model
0.912025
A Learnable Fully Interacted Two-Tower Model for Pre-Ranking System · SIGIR 2025
Recommender systems
context-aware recommendation
0.312018
Taxi or Hitchhiking: Predicting Passenger's Preferred Service on Ride Sharing Platforms · SIGIR 2018
Recommender systems
point-of-interest recommendation
0.312018
Taxi or Hitchhiking: Predicting Passenger's Preferred Service on Ride Sharing Platforms · SIGIR 2018
Recommender systems › context-aware recommendation
spatio-temporal recommendation
0.312018
Taxi or Hitchhiking: Predicting Passenger's Preferred Service on Ride Sharing Platforms · SIGIR 2018
Smart cities and intelligent transportation
ridesharing
0.112018
Taxi or Hitchhiking: Predicting Passenger's Preferred Service on Ride Sharing Platforms · SIGIR 2018

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

negative sampling · 1.7contrastive learning · 1.7similarity scoring · 0.9mixture of experts · 0.9offline simulation · 0.7feature-based recommendation · 0.7
YearPublicationVenuePosition
2025 DOGR: Leveraging Document-Oriented Contrastive Learning in Generative Retrieval
abstract
Generative retrieval constitutes an innovative approach in information retrieval, leveraging generative language models(LM) to generate a ranked list of document identifiers (docid) for a given query. It simplifies the retrieval pipeline by replacing the large external index with model parameters. However, existing works merely learned the relationship between queries and document identifiers, which is unable to directly represent the relevance between queries and documents. To address the above problem, we propose a novel and general generative retrieval framework, namely Leveraging Document-Oriented Contrastive Learning in Generative Retrieval (DOGR), which leverages contrastive learning to improve generative retrieval tasks. It adopts a two-stage learning strategy that captures the relationship between queries and documents comprehensively through direct interactions. Furthermore, negative sampling methods and corresponding contrastive learning objectives are implemented to enhance the learning of semantic representations, thereby promoting a thorough comprehension of the relationship between queries and documents. Experimental results demonstrate that DOGR achieves state-of-the-art performance compared to existing generative retrieval methods on two public benchmark datasets. Further experiments have shown that our framework is generally effective for common identifier construction techniques.
Penghao Lu, Xin Dong 0012, Yuansheng Zhou, Lei Cheng 0005, Chuan Yuan, Linjian Mo
AAAI5
2025 A Learnable Fully Interacted Two-Tower Model for Pre-Ranking System
abstract
Pre-ranking plays a crucial role in large-scale recommender systems by significantly improving the efficiency and scalability within the constraints of providing high-quality candidate sets in real time. The two-tower model is widely used in pre-ranking systems due to a good balance between efficiency and effectiveness with decoupled architecture, which independently processes user and item inputs before calculating their interaction (e.g. dot product or similarity measure). However, this independence also leads to the lack of information interaction between the two towers, resulting in less effectiveness. In this paper, a novel architecture named learnable Fully Interacted Two-tower Model (FIT) is proposed, which enables rich information interactions while ensuring inference efficiency. FIT mainly consists of two parts: Meta Query Module (MQM) and Lightweight Similarity Scorer (LSS). Specifically, MQM introduces a learnable item meta matrix to achieve expressive early interaction between user and item features. Moreover, LSS is designed to further obtain effective late interaction between the user and item towers. Finally, experimental results on several public datasets show that our proposed FIT significantly outperforms the state-of-the-art baseline pre-ranking models.
Xianwen Yu, Lei Cheng 0005, Chuan Yuan, Linjian Mo
SIGIR5
2018 Taxi or Hitchhiking: Predicting Passenger's Preferred Service on Ride Sharing Platforms
abstract
Ride sharing apps like Uber and Didi Chuxing have played an important role in addressing the users' transportation needs, which come not only in huge volumes, but also in great variety. While some users prefer low-cost services such as carpooling or hitchhiking, others prefer more pricey options like taxi or premier services. Further analyses suggest that such preference may also be associated with different time and location. In this paper, we empirically analyze the preferred services and propose a recommender system which provides service recommendation based on temporal, spatial, and behavioral features. Offline simulations show that our system achieves a high prediction accuracy and reduces the user's effort in finding the desired service. Such a recommender system allows a more precise scheduling for the platform, and enables personalized promotions.
Lingyu Zhang 0001, Wei Ai 0002, Chuan Yuan, Jieping Ye
SIGIR3