Cheng Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Cheng Li has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Xin He
School of Computer and Information, Anhui Normal University, Wuhu, China
5 shared publications - Jinde Cao
School of Mathematics, Southeast University, Nanjing 210096, People’s Republic of China
4 shared publications - Yujun Zhu
School of Computer and Information, Anhui Normal University, Wuhu, China
3 shared publications - Qun Fang
Anhui Normal University
2 shared publications - Suhua Tang
The University of Electro-Communications, Tokyo, Japan
2 shared publications - Yong Xu
Anhui Normal University
2 shared publications
Latest Publications
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1016-1026
Inferring Targets from Calibrated Hesitations via Mutual Information Maximization in Multi-Behavior Recommendation
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1016-1026
Open AccessInferring Targets from Calibrated Hesitations via Mutual Information Maximization in Multi-Behavior Recommendation
- 17 November 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 300
LT4Rec: Long-tail contrastive learning for knowledge-enhanced recommendation
- 17 November 2025
- Published by Elsevier in Expert Systems with Applications
- Vol. 300
LT4Rec: Long-tail contrastive learning for knowledge-enhanced recommendation
- 14 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Big Data
- Vol. 12 (2) , 362-375
Long-Tail Inductive Feature Transfer for Knowledge-Aware Multi-Behavior Recommendation
Multi-Behavior recommendation captures fine- grained user intents by jointly modeling multiple interaction behaviors, significantly improving recommendation accuracy and diversity. However, existing methods often overlook complex semantic relations between items and entities. Moreover, constructing separate subgraphs for different interaction types frequently results in sparse graph structures, which exacerbates the long-tail problem. To address these challenges, we propose Long-tail Inductive Feature Transfer (LIFT), a method for knowledge-aware multi-behavior recommendation. To mitigate uneven node distribution in graph structures, we introduce a knowledge transfer-based feature reconstruction mechanism. Specifically, we first drop a portion of the neighbors of head nodes to construct proxy representations for tail nodes, training a reconstructor on the tail proxy to reconstruct the original head node features. The trained reconstructor is then used to backfill missing neighbor information for tail nodes, thereby achieving a more balanced feature distribution across nodes. Furthermore, we integrate multi-behavior and semantic contrastive learning to jointly optimize the representations. Extensive experiments on four datasets demonstrate that LIFT outperforms state-of-the-art methods, with further analysis validating its uniformity in representation learning.
- 14 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Big Data
- Vol. 12 (2) , 362-375
Long-Tail Inductive Feature Transfer for Knowledge-Aware Multi-Behavior Recommendation
Multi-Behavior recommendation captures fine- grained user intents by jointly modeling multiple interaction behaviors, significantly improving recommendation accuracy and diversity. However, existing methods often overlook complex semantic relations between items and entities. Moreover, constructing separate subgraphs for different interaction types frequently results in sparse graph structures, which exacerbates the long-tail problem. To address these challenges, we propose Long-tail Inductive Feature Transfer (LIFT), a method for knowledge-aware multi-behavior recommendation. To mitigate uneven node distribution in graph structures, we introduce a knowledge transfer-based feature reconstruction mechanism. Specifically, we first drop a portion of the neighbors of head nodes to construct proxy representations for tail nodes, training a reconstructor on the tail proxy to reconstruct the original head node features. The trained reconstructor is then used to backfill missing neighbor information for tail nodes, thereby achieving a more balanced feature distribution across nodes. Furthermore, we integrate multi-behavior and semantic contrastive learning to jointly optimize the representations. Extensive experiments on four datasets demonstrate that LIFT outperforms state-of-the-art methods, with further analysis validating its uniformity in representation learning.
- 6 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 13 (2) , 1960-1975
Motif-Guided Multiview Contrastive Learning for Knowledge Graph-Enhanced Recommendation
Contrastive learning (CL) has demonstrated exceptional capability in extracting supervised signals and mitigating noise, increasingly attracting interest for its application in knowledge graph-enhanced (KG) recommendation. Nevertheless, existing approaches predominantly rely on a single augmentation strategy to construct contrastive views, often failing to effectively balance feature perturbation with semantic preservation. To overcome this limitation, we propose motif-guided multiview contrastive learning (MMCL), a unified framework for contrastive augmentation. MMCL leverages diverse view generation strategies across the user–item bipartite graph and the KG, perturbing graph structures while preserving essential semantics to the greatest extent possible. Specifically, for collaborative signals, we devise a data augmentation mechanism to model the interaction dynamics between users and items. For semantic information, we introduce a novel graph augmentation technique by constructing an interactive motif KG, enabling semantic contrastive learning within localized views. Furthermore, joint enhancement of graph and interaction data allows the model to capture global topological features of nodes. MMCL integrates contrastive learning at both local and global levels, effectively embedding local semantics and global topology into the learned representations. Extensive experiments conducted on three publicly available datasets reveal that MMCL outperforms advanced methods, particularly in scenarios with sparse interactions and noisy KG, while significantly alleviating popularity bias in recommendation.
- 6 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 13 (2) , 1960-1975
Motif-Guided Multiview Contrastive Learning for Knowledge Graph-Enhanced Recommendation
Contrastive learning (CL) has demonstrated exceptional capability in extracting supervised signals and mitigating noise, increasingly attracting interest for its application in knowledge graph-enhanced (KG) recommendation. Nevertheless, existing approaches predominantly rely on a single augmentation strategy to construct contrastive views, often failing to effectively balance feature perturbation with semantic preservation. To overcome this limitation, we propose motif-guided multiview contrastive learning (MMCL), a unified framework for contrastive augmentation. MMCL leverages diverse view generation strategies across the user–item bipartite graph and the KG, perturbing graph structures while preserving essential semantics to the greatest extent possible. Specifically, for collaborative signals, we devise a data augmentation mechanism to model the interaction dynamics between users and items. For semantic information, we introduce a novel graph augmentation technique by constructing an interactive motif KG, enabling semantic contrastive learning within localized views. Furthermore, joint enhancement of graph and interaction data allows the model to capture global topological features of nodes. MMCL integrates contrastive learning at both local and global levels, effectively embedding local semantics and global topology into the learned representations. Extensive experiments conducted on three publicly available datasets reveal that MMCL outperforms advanced methods, particularly in scenarios with sparse interactions and noisy KG, while significantly alleviating popularity bias in recommendation.
- 10 June 2025
- Published by Elsevier in Knowledge-Based Systems
- Vol. 324
Enhancing recommendation via knowledge transfer contrastive in global path networks
- 10 June 2025
- Published by Elsevier in Knowledge-Based Systems
- Vol. 324
Enhancing recommendation via knowledge transfer contrastive in global path networks