EDBT 2026 Demo / reviewers in the wild / expert
Xuewei Li 0001
dblp:43/3869-1
· DBLP profile ↗
12ranked-venue papers in the field
3as first author
11since 2021 · last 2026
0000-0002-5330-7298ORCID · conflict
Domains — venue-derived; a paper can count in several
Knowledge Engineering, Semantic Web & Information Systems · 5 (1 first)Data Mining & Knowledge Discovery · 4 (2 first)Information Retrieval & Web Search · 2Database Systems & Data Management · 1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | LieT- H2K: Temporal Homogeneous and Heterogeneous Knowledge Joint Representation Driven by Lie Group
Mei Yu 0004, Mankun Zhao, Jiujiang Guo, Xuewei Li 0001, Jian Yu 0003 |
DASFAA (6) | 6 |
| 2024 | A Causal View for Multi-Interest User Modeling in News RecommendationabstractPersonalized news recommendations are challenging due to the huge number of daily articles. While deep learning has achieved success in news recommendations, methods in the past often overlook the diversity of users' preferences. Recent works have explored multi-interest models to address this limitation. However, interests have different effects on click behavior, and directly modeling the matching between interests and candidates leads to the issue of spurious correlations. Specifically, when highly correlated interests obscure the true motivation for clicking, the model is unable to distinguish the interest that actually caused the click. To address this problem, this paper re-models the relationship between interests and click behavior from a causal perspective. Our proposed Counterfactual Weighted method for user M ulti-Interest modeling (CWMI) consists of a disentangled multi-interest extractor and an interest re-weighting module. Specifically, we first model the effect of interest on click behavior from a causal perspective. Then, we learn the disentangled user interests that only incorporate information from the currently clustered news. Finally, in the counterfactual world, we intervene with the current interest and re-weight it by comparing the changes in the ranking of candidates. We learned about the evolution of interest over time additionally. Experimental results on real-world news datasets demonstrate the effectiveness of the proposed methods, including disentangling interests and identifying the real interest that motivates clicks. Mei Yu 0004, Xiaoxi Zhou, Mankun Zhao, Xuewei Li 0001 |
ICMR | 7 |
| 2024 | Two-Stage Knowledge Graph Completion Based on Semantic Features and High-Order Structural Features
Xiang Ying, Shimei Luo, Mei Yu 0004, Mankun Zhao, Jian Yu 0003, Jiujiang Guo, Xuewei Li 0001 |
PAKDD (1) | 7 |
| 2024 | Global Heterogeneous Graph and Target Interest Denoising for Multi-behavior Sequential RecommendationabstractMulti-behavior sequential recommendation (MBSR) predicts a user's next item of interest based on their interaction history across different behavior types. Although existing studies have proposed capturing the correlation between different types of behavior, two important challenges have not been explored: i) Dealing with heterogeneous item transitions (both global and local perspectives). ii) Mitigating the issue of noise that arises from the incorporation of auxiliary behaviors. To address these issues, we propose a novel solution, Global Heterogeneous Graph and Target Interest Denoising for Multi-behavior Sequential Recommendation (GHTID). In particular, we view the transitions between behavior types of items as different relationships and propose two heterogeneous graphs. By considering the relationship between items under different behavioral types of transformations, we propose two heterogeneous graph convolution modules and explicitly learn heterogeneous item transitions. Moreover, we utilize two attention networks to integrate long-term and short-term interests associated with the target behavior to alleviate the noisy interference of auxiliary behaviors. Extensive experiments on four real-world datasets demonstrate that our method outperforms other state-of-the-art methods. Xuewei Li 0001, Jian Yu 0003, Mankun Zhao, Wenbin Zhang 0010, Mei Yu 0004 |
WSDM | 1 |
| 2024 | Learning Neighbor User Intention on User-Item Interaction Graphs for Better Sequential RecommendationabstractThe task of sequential recommendation aims to predict a user’s preference by analyzing the user’s historical behaviours. Existing methods model item transitions through leveraging sequential patterns. However, they mainly consider the target user’s behaviours and dynamic characteristics, while often ignoring high-order collaborative connections when modelling user preferences. Some recent works try to use graph-based methods to introduce high-order collaborative signals for sequential recommendation. However, these methods are flawed by two problems: the sequential patterns cannot be effectively mined and their way of introducing high-order collaborative signals is not suitable for sequential recommendation. To address these problems, we propose to fully exploit sequence features and model high-order collaborative signals for sequential recommendation. We propose a N eighbor user I ntention-based S equential Rec ommender (NISRec), which utilizes the intentions of high-order connected neighbor users as high-order collaborative signals in order to improve recommendation performance for the target user. The NISRec contains two main modules: the neighbor user intention embedding module (NIE) and the fusion module. The NIE module describes both the long-term and short-term intentions of neighbor users and aggregates them separately. The fusion module uses these two types of aggregated intentions to model high-order collaborative signals in both the embedding process and user preference modelling phase for recommendations of the target user. Experimental results show that our new approach outperforms the state-of-the-art methods on both sparse and dense datasets. Extensive studies further show the effectiveness of the diverse neighbor intentions introduced by the NISRec. Mei Yu 0004, Kun Zhu 0006, Mankun Zhao, Jian Yu 0003, Di Jin 0001, Xuewei Li 0001 |
ACM Trans. Web | 7 |
| 2023 | Multi-Intention Oriented Contrastive Learning for Sequential RecommendationabstractSequential recommendation aims to capture users' dynamic preferences, in which data sparsity is a key problem. Most contrastive learning models leverage data augmentation to address this problem, but they amplify noises in original sequences. Contrastive learning has the assumption that two views (positive pairs) obtained from the same user behavior sequence must be similar. However, noises typically disturb the user's main intention, which results in the dissimilarity of two views. Xuewei Li 0001, Aitong Sun, Mankun Zhao, Jian Yu 0003, Kun Zhu 0006, Di Jin 0001, Mei Yu 0004 |
WSDM | 1 |
| 2023 | BDRI: block decomposition based on relational interaction for knowledge graph completion
Mei Yu 0004, Jiujiang Guo, Jian Yu 0003, Mankun Zhao, Xuewei Li 0001 |
Data Min. Knowl. Discov. | 7 |
| 2023 | A structure-enhanced generative adversarial network for knowledge graph zero-shot relational learning
Xuewei Li 0001, Jian Yu 0003, Mankun Zhao, Mei Yu 0004, Weiping Ding 0001 |
Inf. Sci. | 1 |
| 2023 | RFI-GAN: A reference-guided fuzzy integral network for ultrasound image augmentation
Wenhuan Lu, Jie Gao 0008, Xi Wei 0002, Chenhan Wang, Xuewei Li 0001, Mei Yu 0004 |
Inf. Sci. | 7 |
| 2022 | Text-Enhanced and Relational Context Based Hyperbolic Knowledge Graph Embedding
Xiang Ying, Jian Yu 0003, Mankun Zhao, Mei Yu 0004, Xuewei Li 0001 |
KSEM (1) | 8 |
| 2022 | Knowledge Graph Embedding with Direct and Disentangled Neighborhood Representation Attention Network
Siyao Gao, Jian Yu 0003, Mankun Zhao, Jie Gao 0008, Xuewei Li 0001 |
KSEM (1) | 8 |
| 2019 | Paper Recommendation with Item-Level Collaborative Memory Network
Mei Yu 0004, Xuewei Li 0001, Mankun Zhao, Linying Xu |
KSEM (1) | 3 |