Kai Zhu

Kai Zhu

orcid

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

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

Representative Publications

View All Publications
17 January 2025 in Science Advances
Verified
Journal Article
Open access
LLLang Li
Lang Li
HTHao Tian
Hao Tian
LWLiulin Wu
Liulin Wu
NCNa Chen
Na Chen
QZQiao Zhang
Qiao Zhang
WZWen Zeng
Wen Zeng
The body weight–based thrombolytic medication strategy in clinical trials shows critical defects in recanalization rate and post-thrombolysis hemorrhage. Methods for perceiving thrombi heterogeneity of thrombolysis resistance is urgently needed for precise thrombolysis. Here, we revealed the relationship between the thrombin heterogeneity and the thrombolysis resistance in thrombi and created an artificial biomarker-based nano-patrol system with robotic functional logic to perceive and report the thrombolysis resistance of thrombi. The nano-patrols are contrallable and are able to accomplish thrombolysis resistance-matched personalized and precise therapy according to the feedback signal from artificial biomarkers. This nano-patrol system depicted more enhanced thrombolytic efficiency (elevated by 25%) than alteplase for mini pig model and clinical thrombi and achieved recanalization in thrombotic model where alteplase encountered failure. Moreover, the nano-patrol remarkably reduced the infarct volume and the hemorrhagic transformation risk (0.12-fold of alteplase) of cerebral thrombosis. Therefore, we developed a unique tool for diagnosing thrombolysis resistance and achieving personalized and precise thrombolysis.

21 May 2026 in Electronics
Verified
Journal Article
Open access
PDF file
YSYichen Sun
Yichen Sun
MWMin Wu
Min Wu
EZErhao Zhou
Erhao Zhou
SWShitong Wang
Shitong Wang
KZKai Zhu
Kai Zhu
Imbalanced classification remains a fundamental challenge in machine learning, where the Area Under the ROC Curve (AUC) is widely used for threshold-independent ranking evaluation, especially in AUC maximization studies. Existing AUC maximization methods suffer from two critical limitations: they rely on single fixed kernels that fail to capture complex data structures, and they incur prohibitive computational costs due to pairwise constraint construction. To address these issues, we propose the Generalized AUC Maximization Core Vector Machine (GAM-CVM), a fast imbalanced classification framework integrating multi-kernel learning with core vector machine optimization. Multiple affinity graphs are constructed from complementary perspectives and fused via cross-diffusion into a unified kernel matrix that respects the intrinsic data manifold. This fused kernel is embedded into a generalized AUC objective with a flexible ranking margin. Given the fused kernel matrix, the optimization stage of GAM-CVM achieves asymptotic linear time complexity with respect to the number of sample pairs under a fixed approximation accuracy by reformulating the learning objective as a center-constrained minimum enclosing ball problem. Extensive experiments demonstrate that GAM-CVM achieves the best overall average ranking and significantly outperforms most competing methods while maintaining the lowest optimization-stage running time.

15 September 2026 in Mathematics
Verified
Journal Article
Open access
PDF file
YSYichen Sun
Yichen Sun
MWMin Wu
Min Wu
EZErhao Zhou
Erhao Zhou
ZBZekang Bian
Zekang Bian
KZKai Zhu
Kai Zhu
Conventional clustering methods mainly characterize cluster structures using geometric proximity or pairwise similarities, which may be insufficient for data with complex higher-order dependencies. This paper proposes a Fuzzy Hypergraph Clustering (FHC) method that transforms ordinary feature data into a data-induced uniform hypergraph and performs clustering through higher-order modularity maximization. Specifically, local neighborhoods are first encoded as weighted hyperedges to represent multi-sample relations. A degree-corrected null model is then constructed, based on which fuzzy hypergraph modularity is defined to measure the excess concentration of observed higher-order relations within fuzzy clusters relative to random expectation. The proposed objective reduces to fuzzy graph modularity when the hyperedge order is two and, at unit resolution, further reduces to classical Newman–Girvan modularity under hard assignments. To optimize the resulting nonconvex objective, a simplex-constrained projected gradient ascent algorithm with Armijo backtracking is developed. The optimization is implemented directly over hyperedges without explicitly constructing the high-order adjacency tensor. Experiments on synthetic data and thirteen benchmark datasets show that FHC achieves the strongest overall ranking among the compared methods while maintaining stable performance over a broad parameter range and competitive computational cost. On the Alzheimer’s MRI dataset, FHC obtains the best NMI and ARI and the second-best ACC, further supporting the effectiveness of higher-order fuzzy modularity for clustering feature data with complex relational structures.