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

Zhe Li 0071

dblp:11/751-71 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
0009-0002-1692-6783ORCID · verified

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

Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 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
1 paper
Data mining · 83% Recommender systems · 17%

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

TopicWeightPapersLastEvidence papers
Data mining › clustering › graph clustering › deep graph clustering
contrastive graph clustering
1.012026
Structure-Semantic Synergized Deep Contrastive Graph Clustering · WWW 2026
Recommender systems › representation learning for recommendation
contrastive learning for recommendation
1.012026
Structure-Semantic Synergized Deep Contrastive Graph Clustering · WWW 2026
Data mining › clustering › graph clustering
deep graph clustering
1.012026
Structure-Semantic Synergized Deep Contrastive Graph Clustering · WWW 2026
Data mining › clustering
graph clustering
1.012026
Structure-Semantic Synergized Deep Contrastive Graph Clustering · WWW 2026
Data mining › structured data mining › graph mining
graph learning
1.012026
Structure-Semantic Synergized Deep Contrastive Graph Clustering · WWW 2026
Data mining › representation learning
graph representation learning
1.012026
Structure-Semantic Synergized Deep Contrastive Graph Clustering · WWW 2026

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

soft-alignment strategy · 1.0semantic confidence-guided contrastive learning · 1.0curriculum negative sampling · 1.0
YearPublicationVenuePosition
2026 Structure-Semantic Synergized Deep Contrastive Graph Clustering
abstract
Current contrastive graph clustering approaches suffer from insufficient integration of structural and semantic information, coupled with the absence of reliable sample selection strategies. To address these dual limitations, we introduce Structure-Semantic Synergized Deep Contrastive Graph Clustering (S³-DCGC), a novel framework that jointly models topological structure and semantic features through two synergistic mechanisms. First, a structure-aware curriculum negative sampling strategy progressively identifies hard negative samples using dynamic-range masking, enhancing discriminative structural learning. Second, a semantic confidence-guided contrastive mechanism quantifies node reliability via composite confidence scores—integrating cluster affinity and cross-view consistency—to select high-confidence positive/negative pairs. Dynamically coordinated by a soft-alignment strategy that shifts optimization focus from structural to semantic dominance during training, these components achieve balanced synergy. Comprehensive experiments conducted on five benchmark datasets demonstrate S³-DCGC's superiority, achieving significant performance gains. Ablation studies and visual analyses further corroborate the critical importance of structure-semantic synergy in achieving robust clustering performance.
Shifei Ding, Zhe Li 0071, Xiao Xu 0006, Chao Li 0102
WWW2
2025 Triple-view graph clustering network based on high-confidence contrastive learning strategy
Shifei Ding, Zhe Li 0071, Xiao Xu 0006, Lili Guo 0001, Ling Ding 0001
Knowl. Based Syst.2