EDBT 2026 Demo / reviewers in the wild / expert
Shike Du
dblp:426/1930
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, 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.
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › single-cell analysis
cell clustering |
0.9 | 1 | 2025 | Differentiable graph clustering with structural grouping for single-cell RNA-seq data · Bioinform. 2025 |
Bioinformatics and computational biology › single-cell analysis › single-cell RNA sequencing
single-cell RNA-seq analysis |
0.9 | 1 | 2025 | Differentiable graph clustering with structural grouping for single-cell RNA-seq data · Bioinform. 2025 |
Methods — techniques the papers use, named apart from their topics
spectral relaxation · 0.9self-supervised learning · 0.9graph neural network · 0.9autoencoder · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Differentiable graph clustering with structural grouping for single-cell RNA-seq dataabstractMOTIVATION: Clustering cells into subpopulations is one of the most crucial tasks in single-cell RNA sequencing (scRNA-seq) data analysis, which provides support for biological research at cellular level. With the development of graph neural networks, deep graph clustering approaches have achieved excellent performance by modeling the topological relationships between cells. However, existing approaches rely on cell node and its neighbors to obtain the cell feature representation, which ignore the graph cluster structure hidden in scRNA-seq data. Besides, how to bridge the heterogeneous gap between cell node feature and its structural information remains a highly challenging problem. RESULTS: Here, we propose a novel differentiable graph clustering with structural grouping (DGCSG) for scRNA-seq data, which incorporates graph cluster information into deep graph clustering model by designing a differentiable clustering mechanism to learn clustering-friendly representation. Firstly, an interactive module is devised to dynamically transfer node representations learned by autoencoder (AE) to graph attention autoencoder (GATE) in layer-by-layer manner. Then, to characterize graph cluster information, a differentiable clustering mechanism is proposed to transform K-way normalized cuts from a discrete optimization problem into differentiable learning objective through spectral relaxation, which jointly optimizes the GATE by allocating more attention scores to nodes in the same graph cluster. Finally, a decoupled self-supervised optimization is proposed, which guides the representation learning of AE and GATE in the interactive module. Extensive evaluations on 14 scRNA-seq benchmarks verify the superiority of DGCSG compared with state-of-the-art baselines. AVAILABILITY AND IMPLEMENTATION: The code associated with this work is available on GitHub (https://github.com/Xiaoqiang-Yan/DGCSG). Shike Du, Quan Zou 0001, Zhen Tian 0004 |
Bioinform. | 2 |