Xiaolei Liu
Xiaolei Liu has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Shaoshuai Li
MYbank, Ant Group, Beijing, China
4 shared publications - Xiaobo Guo
Institute of Information Science, Beijing Jiaotong University, Beijing, China and Data Management Department, China Minsheng Bank, Beijing, China
4 shared publications - Naicheng Guo
MYbank, Ant Group, Beijing, China
3 shared publications - Qiongxu Ma
MYbank, Ant Group, Beijing, China
3 shared publications - Mingming Ha
School of Intelligence Science and Technology, University of Science and Technology Beijing, Beijing, China
2 shared publications - Yunan Zhao
MYbank, Ant Group, Beijing, China
2 shared publications
Latest Publications
- Open Access
- 14 November 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 18 (2) , 1-27
Semi-Supervised Heterogeneous Graph Learning with Multi-Level Data Augmentation
In recent years, semi-supervised graph learning with data augmentation (DA) has been the most commonly used and best-performing method to improve model robustness in sparse scenarios with few labeled samples. However, most existing DA methods are based on the homogeneous graph, but none are specific for the heterogeneous graph. Differing from the homogeneous graph, DA in the heterogeneous graph faces greater challenges: heterogeneity of information requires DA strategies to effectively handle heterogeneous relations, which considers the information contribution of different types of neighbors and edges to the target nodes. Furthermore, over-squashing of information is caused by the negative curvature formed by the non-uniformity distribution and the strong clustering in a complex graph. To address these challenges, this article presents a novel method named HG-MDA (Semi-Supervised Heterogeneous Graph Learning with Multi-Level Data Augmentation). For the problem of heterogeneity of information in DA, node and topology augmentation strategies are proposed for the characteristics of the heterogeneous graph. Additionally, meta-relation-based attention is applied as one of the indexes for selecting augmented nodes and edges. For the problem of over-squashing of information, triangle-based edge adding and removing are designed to alleviate the negative curvature and bring the gain of topology. Finally, the loss function consists of the cross-entropy loss for labeled data and the consistency regularization for unlabeled data. To effectively fuse the prediction results of various DA strategies, sharpening is used. Existing experiments on public datasets (i.e., ACM, DBLP, and OGB) and the industry dataset MB show that HG-MDA outperforms current SOTA models. Additionally, HG-MDA is applied to user identification in internet finance scenarios, helping the business to add 30% key users, and increase loans and balances by 3.6%, 11.1%, and 9.8%.
- 14 November 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Knowledge Discovery From Data
- Vol. 18 (2) , 1-27
Open AccessSemi-Supervised Heterogeneous Graph Learning with Multi-Level Data Augmentation
In recent years, semi-supervised graph learning with data augmentation (DA) has been the most commonly used and best-performing method to improve model robustness in sparse scenarios with few labeled samples. However, most existing DA methods are based on the homogeneous graph, but none are specific for the heterogeneous graph. Differing from the homogeneous graph, DA in the heterogeneous graph faces greater challenges: heterogeneity of information requires DA strategies to effectively handle heterogeneous relations, which considers the information contribution of different types of neighbors and edges to the target nodes. Furthermore, over-squashing of information is caused by the negative curvature formed by the non-uniformity distribution and the strong clustering in a complex graph. To address these challenges, this article presents a novel method named HG-MDA (Semi-Supervised Heterogeneous Graph Learning with Multi-Level Data Augmentation). For the problem of heterogeneity of information in DA, node and topology augmentation strategies are proposed for the characteristics of the heterogeneous graph. Additionally, meta-relation-based attention is applied as one of the indexes for selecting augmented nodes and edges. For the problem of over-squashing of information, triangle-based edge adding and removing are designed to alleviate the negative curvature and bring the gain of topology. Finally, the loss function consists of the cross-entropy loss for labeled data and the consistency regularization for unlabeled data. To effectively fuse the prediction results of various DA strategies, sharpening is used. Existing experiments on public datasets (i.e., ACM, DBLP, and OGB) and the industry dataset MB show that HG-MDA outperforms current SOTA models. Additionally, HG-MDA is applied to user identification in internet finance scenarios, helping the business to add 30% key users, and increase loans and balances by 3.6%, 11.1%, and 9.8%.
- 29 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. PP (10414347) , 1-15
Hyperbolic Contrastive Graph Representation Learning for Session-based Recommendation
Session-based recommendation (SBR) learns users' preferences by capturing the short-term and sequential patterns from the evolution of user behaviors. Among the studies in the SBR field, graph-based approaches are a relatively powerful technique, which generally extract item information by message aggregation under Euclidean space. However, such methods cannot effectively extract the hierarchical information contained among consecutive items in a session, which is critical to represent users' preferences. In this paper, we present a hyperbolic contrastive graph recommender (HCGR), a principled session-based recommendation framework involving Lorentz hyperbolic space to efficiently capture the coherence and hierarchical representations of the items. Within this framework, an adaptive hyperbolic attention computation is designed to aggregate the graph message of each user's preference in a session-based behavior sequence. In addition, a contrastive ranking loss with the hyperbolic distance is used to separate the positive and negative items. Compared with the Euclidean distance, the advantage of the hyperbolic distance in the contrastive ranking loss is analyzed. The results of extensive experiments on four real-world datasets demonstrate that HCGR consistently outperforms state-of-the-art baselines by 0.43 $\%$ -14.44 $\%$ in terms of $HitRate$ , $NDCG$ and $MRR$ .
- 29 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. PP (10414347) , 1-15
Hyperbolic Contrastive Graph Representation Learning for Session-based Recommendation
Session-based recommendation (SBR) learns users' preferences by capturing the short-term and sequential patterns from the evolution of user behaviors. Among the studies in the SBR field, graph-based approaches are a relatively powerful technique, which generally extract item information by message aggregation under Euclidean space. However, such methods cannot effectively extract the hierarchical information contained among consecutive items in a session, which is critical to represent users' preferences. In this paper, we present a hyperbolic contrastive graph recommender (HCGR), a principled session-based recommendation framework involving Lorentz hyperbolic space to efficiently capture the coherence and hierarchical representations of the items. Within this framework, an adaptive hyperbolic attention computation is designed to aggregate the graph message of each user's preference in a session-based behavior sequence. In addition, a contrastive ranking loss with the hyperbolic distance is used to separate the positive and negative items. Compared with the Euclidean distance, the advantage of the hyperbolic distance in the contrastive ranking loss is analyzed. The results of extensive experiments on four real-world datasets demonstrate that HCGR consistently outperforms state-of-the-art baselines by 0.43 $\%$ -14.44 $\%$ in terms of $HitRate$ , $NDCG$ and $MRR$ .
- Open Access
- 23 March 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 41 (4) , 1-27
Disentangled Representations Learning for Multi-target Cross-domain Recommendation
Data sparsity has been a long-standing issue for accurate and trustworthy recommendation systems (RS). To alleviate the problem, many researchers pay much attention to cross-domain recommendation (CDR), which aims at transferring rich knowledge from related source domains to enhance the recommendation performance of sparse target domain. To reach the knowledge transferring purpose, recent CDR works always focus on designing different pairwise directed or undirected information transferring strategies between source and target domains. However, such pairwise transferring idea is difficult to adapt to multi-target CDR scenarios directly, e.g., transferring knowledge between multiple domains and improving their performance simultaneously, as such strategies may lead the following issues: (1) When the number of domains increases, the number of transferring modules will grow exponentially, which causes heavy computation complexity. (2) A single pairwise transferring module could only capture the relevant information of two domains, but ignores the correlated information of other domains, which may limit the transferring effectiveness. (3) When a sparse domain serves as the source domain during the pairwise transferring, it would easily leads the negative transfer problem, and the untrustworthy information may hurt the target domain recommendation performance. In this article, we consider the key challenge of the multi-target CDR task: How to identify the most valuable trustworthy information over multiple domains and transfer such information efficiently to avoid the negative transfer problem? To fulfill the above challenge, we propose a novel end-to-end model termed as DR-MTCDR , standing for D isentangled R epresentations learning for M ulti- T arget CDR . DR-MTCDR aims at transferring the trustworthy domain-shared information across domains, which has the two major advantages in both efficiency and effectiveness: (1) For efficiency, DR-MTCDR utilizes a unified module on all domains to capture disentangled domain-shared information and domain-specific information, which could support all domain recommendation and be insensitive to the number of domains. (2) For effectiveness, based on the disentangled domain-shared and domain-specific information, DR-MTCDR has the capability to lead positive effect and make trustworthy recommendation for each domain. Empirical evaluations on datasets from both public datasets and real-world large-scale financial datasets have shown that the proposed framework outperforms other state-of-the-art baselines.
- 23 March 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 41 (4) , 1-27
Open AccessDisentangled Representations Learning for Multi-target Cross-domain Recommendation
Data sparsity has been a long-standing issue for accurate and trustworthy recommendation systems (RS). To alleviate the problem, many researchers pay much attention to cross-domain recommendation (CDR), which aims at transferring rich knowledge from related source domains to enhance the recommendation performance of sparse target domain. To reach the knowledge transferring purpose, recent CDR works always focus on designing different pairwise directed or undirected information transferring strategies between source and target domains. However, such pairwise transferring idea is difficult to adapt to multi-target CDR scenarios directly, e.g., transferring knowledge between multiple domains and improving their performance simultaneously, as such strategies may lead the following issues: (1) When the number of domains increases, the number of transferring modules will grow exponentially, which causes heavy computation complexity. (2) A single pairwise transferring module could only capture the relevant information of two domains, but ignores the correlated information of other domains, which may limit the transferring effectiveness. (3) When a sparse domain serves as the source domain during the pairwise transferring, it would easily leads the negative transfer problem, and the untrustworthy information may hurt the target domain recommendation performance. In this article, we consider the key challenge of the multi-target CDR task: How to identify the most valuable trustworthy information over multiple domains and transfer such information efficiently to avoid the negative transfer problem? To fulfill the above challenge, we propose a novel end-to-end model termed as DR-MTCDR , standing for D isentangled R epresentations learning for M ulti- T arget CDR . DR-MTCDR aims at transferring the trustworthy domain-shared information across domains, which has the two major advantages in both efficiency and effectiveness: (1) For efficiency, DR-MTCDR utilizes a unified module on all domains to capture disentangled domain-shared information and domain-specific information, which could support all domain recommendation and be insensitive to the number of domains. (2) For effectiveness, based on the disentangled domain-shared and domain-specific information, DR-MTCDR has the capability to lead positive effect and make trustworthy recommendation for each domain. Empirical evaluations on datasets from both public datasets and real-world large-scale financial datasets have shown that the proposed framework outperforms other state-of-the-art baselines.
- Open Access
- 7 February 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 41 (3) , 1-26
Poincaré Heterogeneous Graph Neural Networks for Sequential Recommendation
Sequential recommendation (SR) learns users’ preferences by capturing the sequential patterns from users’ behaviors evolution. As discussed in many works, user–item interactions of SR generally present the intrinsic power-law distribution, which can be ascended to hierarchy-like structures. Previous methods usually handle such hierarchical information by making user–item sectionalization empirically under Euclidean space, which may cause distortion of user–item representation in real online scenarios. In this article, we propose a Poincaré-based heterogeneous graph neural network named Poincaré Heterogeneous Graph Neural Networks for Sequential Recommendation (PHGR) to model the sequential pattern information as well as hierarchical information contained in the data of SR scenarios simultaneously. Specifically, for the purpose of explicitly capturing the hierarchical information, we first construct a weighted user–item heterogeneous graph by aliening all the user–item interactions to improve the perception domain of each user from a global view. Then the output of the global representation would be used to complement the local directed item–item homogeneous graph convolution. By defining a novel hyperbolic inner product operator, the global and local graph representation learning are directly conducted in Poincaré ball instead of commonly used projection operation between Poincaré ball and Euclidean space, which could alleviate the cumulative error issue of general bidirectional translation process. Moreover, for the purpose of explicitly capturing the sequential dependency information, we design two types of temporal attention operations under Poincaré ball space. Empirical evaluations on datasets from the public and financial industry show that PHGR outperforms several comparison methods.
- 7 February 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 41 (3) , 1-26
Open AccessPoincaré Heterogeneous Graph Neural Networks for Sequential Recommendation
Sequential recommendation (SR) learns users’ preferences by capturing the sequential patterns from users’ behaviors evolution. As discussed in many works, user–item interactions of SR generally present the intrinsic power-law distribution, which can be ascended to hierarchy-like structures. Previous methods usually handle such hierarchical information by making user–item sectionalization empirically under Euclidean space, which may cause distortion of user–item representation in real online scenarios. In this article, we propose a Poincaré-based heterogeneous graph neural network named Poincaré Heterogeneous Graph Neural Networks for Sequential Recommendation (PHGR) to model the sequential pattern information as well as hierarchical information contained in the data of SR scenarios simultaneously. Specifically, for the purpose of explicitly capturing the hierarchical information, we first construct a weighted user–item heterogeneous graph by aliening all the user–item interactions to improve the perception domain of each user from a global view. Then the output of the global representation would be used to complement the local directed item–item homogeneous graph convolution. By defining a novel hyperbolic inner product operator, the global and local graph representation learning are directly conducted in Poincaré ball instead of commonly used projection operation between Poincaré ball and Euclidean space, which could alleviate the cumulative error issue of general bidirectional translation process. Moreover, for the purpose of explicitly capturing the sequential dependency information, we design two types of temporal attention operations under Poincaré ball space. Empirical evaluations on datasets from the public and financial industry show that PHGR outperforms several comparison methods.