Yujie Wang

Yujie Wang

Auto-generated profile, based on publicly available information

Yujie Wang

Beijing University of Posts and Telecommunications, Beijing, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 October 2024
Verified
Conference Paper
Open access
YWYujie Wang
Yujie Wang
SZShuo Zhang
Shuo Zhang
JYJunda Ye
Junda Ye
HPHao Peng
Hao Peng
Li SunLi Sun
Li Sun
Graph generation plays a vital role in a wide range of applications such as traffic analysis, drug discovery and more, for its rapid and efficient generation speed coupled with its precise and stable generation capabilities. And the diffusion model, which is the dominant solution in image generation domain, has shown its potential in graph generation recently. In the literature, existing graph diffusion models trivialize the graph structure, and prioritize the Euclidean space for graph generation, ignoring the intrinsic difference between non-Euclidean graph structures and Euclidean grid-like image/text data. The few graph diffusion models in hyperbolic space separate the embedding and diffusion process, and loose the geometric constraints in the diffusion process. The problem of generating graph structure in a generic Riemannian space largely remains open. It faces several fundamental challenges. On the one hand, navigating and structuring graphs within Riemannian spaces poses greater difficulty. In other words, how to preserve adherence to the constraints of Riemannian geometry has not been touched in the literature. On the other hand, Riemannian operators for graph diffusion models are not available so far, which is inherently different from that in Euclidean space. In light of the aforementioned issues, we restore the notion of product space, and propose a generic graph generation method, called mixed-curvature Product Space Graph Diffusion Model (ProGDM). Specifically, ProGDM includes a Riemannian embedding module based on contrastive learning and a geometric diffusion models across multiple Riemannian sub-spaces. We evaluate the proposed ProGDM with extensive experiments on benchmark datasets, and the empirical results show that ProGDM has achieved superior performance to the state-of-the-art methods.

6 February 2026 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
Li SunLi Sun
Li Sun
ZHZhenhao Huang
Zhenhao Huang
YWYujie Wang
Yujie Wang
HLHongbo Lv
Hongbo Lv
CLChunyang Liu
Chunyang Liu
PYPhilip S. Yu
Philip S. Yu
Graph clustering is a longstanding topic in machine learning. In recent years, deep learning methods have achieved encouraging results, but they still require predefined cluster numbers $K$, and typically struggle with imbalanced graphs, especially in identifying minority clusters. The limitations motivate us to study a challenging yet practical problem: deep graph clustering without $K$ considering the imbalance in reality. We approach this problem from a fresh perspective of information theory (i.e., structural information). In the literature, structural information has rarely been touched in deep clustering, and the classic definition falls short in its discrete formulation, neglecting node attributes and exhibiting prohibitive complexity. In this paper, we first establish a differentiable structural information, generalizing the discrete formalism to continuous realm, so that we design a hyperbolic deep model (LSEnet) to learn the neural partitioning tree in the Lorentz model of hyperbolic space. Theoretically, we demonstrate its capability in clustering without requiring $K$ and identifying minority clusters in imbalanced graphs. Second, we refine hyperbolic representations of the partitioning tree, enhancing graph semantics, for better clustering. Contrastive learning for tree structures is non-trivial and costs quadratic complexity. Instead, we further advance our theory by discovering an interesting fact that structural entropy indeed bounds the tree contrastive loss. Finally, with an efficient reformulation, we approach graph clustering through a novel augmented structural information learning (ASIL), which offers a simple yet effective objective of augmented structural entropy to seamlessly integrates hyperbolic partitioning tree construction and contrastive learning. With a provable improvement in graph conductance, ASIL achieves effective debiased graph clustering in linear complexity with respect to the graph size. Extensive experiments show the ASIL outperforms 20 strong baselines by an average of $+12.42\%$ in NMI on Citeseer dataset.

3 November 2023 in Antimicrobial Resistance & Infection Control
Verified
Journal Article
Open access
PDF file
QWQianxing Wu
Qianxing Wu
NSNiloofar Sabokroo
Niloofar Sabokroo
YWYujie Wang
Yujie Wang
MHMarzieh Hashemian
Marzieh Hashemian
SKSomayeh Karamollahi
Somayeh Karamollahi
EKEbrahim Kouhsari
Ebrahim Kouhsari

12 April 2026
Verified
Conference Paper
Open access
QZQimin Zhou
Qimin Zhou
HLHaibo Liu
Haibo Liu
YWYujie Wang
Yujie Wang
Li SunLi Sun
Li Sun
Chuan ShiChuan Shi
Chuan Shi