EDBT 2026 Demo / reviewers in the wild / expert
Yu Tian 0008
dblp:15/4658-8
· DBLP profile ↗
5ranked-venue papers
3as first author
5since 2021 · last 2024
0009-0002-2228-1619ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 5 · 3 first-author · 5 since 2021Artificial intelligence and machine learning · 2 · 2 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Unified Visual Preference Learning for User Intent UnderstandingabstractIn the world of E-Commerce, the core task is to understand the personalized preference from various kinds of heterogeneous information, such as textual reviews, item images and historical behaviors. In current systems, these heterogeneous information are mainly exploited to generate better item or user representations. For example, in scenario of visual search, the importance of modeling query image has been widely acknowledged. But, these existing solutions focus on improving the representation quality of the query image, overlooking the personalized visual preference of the user. Note that the visual features affect the user's decision significantly, e.g., the user could be more likely to click the items with her preferred design. Hence, it is fruitful to exploit the visual preference to deliver better capacity for personalization. Yihua Wen, Si Chen 0010, Yu Tian 0008, Wanxian Guan, Pengjie Wang 0002, Hongbo Deng, Jian Xu 0015, Bo Zheng 0007, Zihao Li 0005, Lixin Zou, Chenliang Li 0005 |
WSDM | 3 |
| 2023 | Multi-Scenario Ranking with Adaptive Feature LearningabstractRecently, Multi-Scenario Learning (MSL) is widely used in recommendation and retrieval systems in the industry because it facilitates transfer learning from different scenarios, mitigating data sparsity and reducing maintenance cost. These efforts produce different MSL paradigms by searching more optimal network structure, such as Auxiliary Network, Expert Network, and Multi-Tower Network. It is intuitive that different scenarios could hold their specific characteristics, activating the user's intents quite differently. In other words, different kinds of auxiliary features would bear varying importance under different scenarios. With more discriminative feature representations refined in a scenario-aware manner, better ranking performance could be easily obtained without expensive search for the optimal network structure. Unfortunately, this simple idea is mainly overlooked but much desired in real-world systems. Yu Tian 0008, Bofang Li, Si Chen 0010, Xubin Li, Hongbo Deng, Jian Xu 0015, Bo Zheng 0007, Qian Wang 0002, Chenliang Li 0005 |
SIGIR | 1 |
| 2022 | When Multi-Level Meets Multi-Interest: A Multi-Grained Neural Model for Sequential RecommendationabstractSequential recommendation aims at identifying the next item that is preferred by a user based on their behavioral history. Compared to conventional sequential models that leverage attention mechanisms and RNNs, recent efforts mainly follow two directions for improvement: multi-interest learning and graph convolutional aggregation. Specifically, multi-interest methods such as ComiRec and MIMN, focus on extracting different interests for a user by performing historical item clustering, while graph convolution methods including TGSRec and SURGE elect to refine user preferences based on multilevel correlations between historical items. Unfortunately, neither of them realizes that these two types of solutions can mutually complement each other, by aggregating multi-level user preference to achieve more precise multi-interest extraction for a better recommendation. To this end, in this paper, we propose a unified multi-grained neural model (named MGNM) via a combination of multi-interest learning and graph convolutional aggregation. Concretely, MGNM first learns the graph structure and information aggregation paths of the historical items for a user. It then performs graph convolution to derive item representations in an iterative fashion, in which the complex preferences at different levels can be well captured. Afterwards, a novel sequential capsule network is proposed to inject the sequential patterns into the multi-interest extraction process, leading to a more precise interest learning in a multi-grained manner. Experiments on three real-world datasets from different scenarios demonstrate the superiority of MGNM against several state-of-the-art baselines. The performance gain over the best baseline is up to 27.10% and 25.17% in terms of [email protected] and [email protected] respectively, which is one of the largest gains in recent development of sequential recommendation. Further analysis also demonstrates that MGNM is robust and effective at user preference understanding at multi-grained levels. Yu Tian 0008, Jianxin Chang, Yanan Niu, Yang Song 0008, Chenliang Li 0005 |
SIGIR | 1 |
| 2021 | Concept-Aware Denoising Graph Neural Network for Micro-Video RecommendationabstractRecently, micro-video sharing platforms such as Kuaishou and Tiktok have become a major source of information for people's lives. Thanks to the large traffic volume, short video lifespan and streaming fashion of these services, it has become more and more pressing to improve the existing recommender systems to accommodate these challenges in a cost-effective way. In this paper, we propose a novel concept-aware denoising graph neural network (named Conde) for micro-video recommendation. Conde consists of a three-phase graph convolution process to derive user and micro-video representations: warm-up propagation, graph denoising and preference refinement. A heterogeneous tripartite graph is constructed by connecting user nodes with video nodes, and video nodes with associated concept nodes, extracted from captions and comments of the videos. To address the noisy information in the graph, we introduce a user-oriented graph denoising phase to extract a subgraph which can better reflect the user's preference. Despite the main focus of micro-video recommendation in this paper, we also show that our method can be generalized to other types of tasks. Therefore, we also conduct empirical studies on a well-known public E-commerce dataset. The experimental results suggest that the proposed Conde achieves significantly better recommendation performance than the existing state-of-the-art solutions. Yiyu Liu, Yu Tian 0008, Changping Wang, Yanan Niu, Yang Song 0008, Chenliang Li 0005 |
CIKM | 3 |
| 2021 | Joint Knowledge Pruning and Recurrent Graph Convolution for News RecommendationabstractRecently, exploiting a knowledge graph (KG) to enrich the semantic representation of a news article have been proven to be effective for news recommendation. These solutions focus on the representation learning for news articles with additional information in the knowledge graph, where the user representations are mainly derived based on these news representations later. However, different users would hold different interests on the same news article. In other words, directly identifying the entities relevant to the user's interest and deriving the resultant user representation could enable a better news recommendation and explanation. Yu Tian 0008, Yuhao Yang 0002, Xudong Ren, Pengfei Wang 0009, Fangzhao Wu, Qian Wang 0002, Chenliang Li 0005 |
SIGIR | 1 |