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

Jiuqiang Li 0002

dblp:353/6875-2 · DBLP profile ↗
in reviewer pool ← Back
3ranked-venue papers
3as first author
3since 2021 · last 2026
0009-0008-6642-091XORCID · conflict

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

Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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 · 100%
Artificial intelligence
2 papers
Representation and self-supervised learning · 57% Graph learning · 43%

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

TopicWeightPapersLastEvidence papers
Recommender systems
multimodal recommendation
1.012026
Multi-view Semantic Contrastive Alignment for Multimodal Recommendation · WWW 2026
Recommender systems › set recommendation
bundle recommendation
0.912025
Disentangled Contrastive Bundle Recommendation with Conditional Diffusion · AAAI 2025
Recommender systems › representation learning for recommendation
contrastive learning for recommendation
0.812024
Graph Diffusive Self-Supervised Learning for Social Recommendation · SIGIR 2024
Recommender systems › social recommendation
graph-based social recommendation
0.812024
Graph Diffusive Self-Supervised Learning for Social Recommendation · SIGIR 2024
Recommender systems
social recommendation
0.812024
Graph Diffusive Self-Supervised Learning for Social Recommendation · SIGIR 2024
Machine learning › Representation and self-supervised learning
contrastive learning
0.312026
Multi-view Semantic Contrastive Alignment for Multimodal Recommendation · WWW 2026
Machine learning › Graph learning
graph diffusion
0.212024
Graph Diffusive Self-Supervised Learning for Social Recommendation · SIGIR 2024

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

contrastive learning · 4.4multi-view representation learning · 2.0self-supervised learning · 1.5graph diffusion · 1.5graph learning · 0.9disentangled representation learning · 0.9conditional diffusion model · 0.9
YearPublicationVenuePosition
2026 Multi-view Semantic Contrastive Alignment for Multimodal Recommendation
abstract
Multimodal recommendation advocates integrating the multimodal features of items with historical user behaviors to enhance recommendation accuracy across various online media platforms. The majority of existing methods concentrate on leveraging cross-modal learning over multimodal features to augment node representations. However, these approaches are confronted with two key challenges: i) augmented representations offer limited information gain for interactive prediction in the collaborative view, and ii) semantic discrepancy between the collaborative view and modality-augmented features remains inadequately addressed. To overcome these obstacles, we present a new Multi-view Semantic Contrastive Alignment (MSCA) approach for multimodal recommendation, which models and aligns node representations from multiple views. Specifically, we introduce a multi-view semantic pattern encoder that learns basic embeddings from the collaborative view and independently captures augmented semantic patterns from the item-item structural view and intra-modal view. Furthermore, a semantic contrastive alignment task is designed to mitigate the semantic divergence between collaborative embeddings and augmented representations by maximizing the mutual consistency between them, thereby facilitating an effective integration of both. Comprehensive experiments on three benchmark datasets confirm that the proposed MSCA consistently excels over diverse state-of-the-art baselines.
Jiuqiang Li 0002, Hongjun Wang 0002
WWW1
2025 Disentangled Contrastive Bundle Recommendation with Conditional Diffusion
abstract
Bundle recommendation aims to improve user experience by suggesting complementary items that users are likely to purchase together. Although recent advances in recommendation systems have shown promise, there are still significant challenges: i) The dynamic nature of user preferences and interactions introduces noise that can distort the effectiveness of recommendations. ii) Existing methods frequently exhibit limited robustness when addressing the sparsity of user interactions with bundles in real-world scenarios. To tackle these issues, we introduce a disentangled contrastive bundle recommendation (DCBR) framework with conditional diffusion. First, we propose a conditional bundle diffusion model for denoising the user-bundle interaction graph, introducing a bundle latent consistency constraint during the optimization process to mitigate the degradation of original interaction information. Subsequently, we design a triple-view denoised graph learning module to obtain effective representations from multiple views. Furthermore, we present a dual-level disentangled contrastive learning paradigm, which addresses the latent relationships at two levels: between views (inter-view) and within each view (intra-view). By maximizing the consistency between positive samples in these contrastive views, we generate disentangled contrastive signals, overcoming interaction sparsity and alleviating noise issues. Our experimental evaluations on three benchmark datasets reveal that DCBR significantly outperforms state-of-the-art methods.
Jiuqiang Li 0002
AAAI1
2024 Graph Diffusive Self-Supervised Learning for Social Recommendation
abstract
Social recommendation aims at augmenting user-item interaction relationships and boosting recommendation quality by leveraging social information. Recently, self-supervised learning (SSL) has gained widespread adoption for social recommender. However, most existing methods exhibit poor robustness when faced with sparse user behavior data and are susceptible to inevitable social noise. To overcome the aforementioned limitations, we introduce a new Graph Diffusive Self-Supervised Learning (GDSSL) paradigm for social recommendation. Our approach involves the introduction of a guided social graph diffusion model that can adaptively mitigate the impact of social relation noise commonly found in real-world scenarios. This model progressively introduces random noise to the initial social graph and then iteratively restores it to recover the original structure. Additionally, to enhance robustness against noise and sparsity, we propose graph diffusive self-supervised learning, which utilizes the denoised social relation graph generated by our diffusion model for contrastive learning. The extensive experimental outcomes consistently indicate that our proposed GDSSL outmatches existing advanced solutions in social recommendation.
Jiuqiang Li 0002, Hongjun Wang 0002
SIGIR1