Zhezheng Hao

Zhezheng Hao

Auto-generated profile, based on publicly available information

Zhezheng Hao

Zhejiang University, Hangzhou, 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
5 July 2023 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
ZHZhezheng Hao
Zhezheng Hao
ZLZhoumin Lu
Zhoumin Lu
GLGuoxu Li
Guoxu Li
FNFeiping Nie
Feiping Nie
RWRong Wang
Rong Wang
XLXuelong Li
Xuelong Li
Ensemble clustering has emerged as a powerful framework for analyzing heterogeneous and complex data. Despite the abundance of existing schemes, co-association matrix-based methods remain the mainstream approach. However, focusing solely on pairwise correlations falls short of fully capturing the intricate cluster relationships. Moreover, despite its potential, ensemble clustering has yet to effectively leverage the powerful representation capabilities of neural networks. To address these limitations, we propose a deep ensemble clustering method called Ensemble Clustering with Attentional Representation (ECAR). Our method considers the results of base partition as groups with related information to explore higher-order fusion information. ECAR captures the importance of each sample's association with its related group by employing an attentional network, and encodes this information into a low-dimensional representation. The attentional network is trained by jointly optimizing the clustering loss from soft assignments learned from the embeddings and the reconstruction loss from the weighted graph generated from ensemble clustering. During training, the weights of base partitions are adaptively refined to promote diversity and consistency while reducing the impact of low-quality and redundant base partitions. Extensive experimental results on real-world datasets demonstrate the substantial improvement of our method over existing baseline ensemble clustering methods and deep clustering methods.

11 February 2025 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
LMLu Ma
Lu Ma
ZSZeang Sheng
Zeang Sheng
XLXunkai Li
Xunkai Li
XGXinyi Gao
Xinyi Gao
ZHZhezheng Hao
Zhezheng Hao
BCBin Cui
Bin Cui
Graph Neural Networks have demonstrated remarkable effectiveness in various graph-based tasks, but their inefficiency in training and inference poses significant challenges for scaling to real-world, large-scale applications. To address these challenges, a plethora of algorithms have been developed to accelerate GNN training and inference, garnering substantial interest from the research community. This paper presents a systematic review of these acceleration algorithms, categorizing them into three main topics: training acceleration, inference acceleration, and execution acceleration. For training acceleration, we discuss techniques like graph sampling and GNN simplification. In inference acceleration, we focus on knowledge distillation, GNN quantization, and GNN pruning. For execution acceleration, we explore GNN binarization and graph condensation. Additionally, we review several libraries related to GNN acceleration, including our Scalable Graph Learning library, and propose future research directions.

22 April 2025
Verified
Conference Paper
Open access
SHShen Han
Shen Han
ZZZhiyao Zhou
Zhiyao Zhou
JCJiawei Chen
Jiawei Chen
ZHZhezheng Hao
Zhezheng Hao
SZSheng Zhou
Sheng Zhou
CWCan Wang
Can Wang

13 May 2024
Verified
Conference Paper
Open access
ZHZhezheng Hao
Zhezheng Hao
HXHaonan Xin
Haonan Xin
LWLong Wei
Long Wei
LTLiaoyuan Tang
Liaoyuan Tang
RWRong Wang
Rong Wang
FNFeiping Nie
Feiping Nie
Graph Neural Networks (GNNs) have emerged as the predominant approach for analyzing graph data on the web and beyond. Contrastive learning (CL), a self-supervised paradigm, not only mitigates reliance on annotations but also has potential in performance. The hard negative sampling strategy that benefits CL in other domains proves ineffective in the context of Graph Contrastive Learning (GCL) due to the message passing mechanism. Embracing the subspace hypothesis in clustering, we propose a method towards expansive and adaptive hard negative mining, referred to as G raph contR astive leA rning via subsP ace prE serving (GRAPE ). Beyond homophily, we argue that false negatives are prevalent over an expansive range and exploring them confers benefits upon GCL. Diverging from existing neighbor-based methods, our method seeks to mine long-range hard negatives throughout subspace, where message passing is conceived as interactions between subspaces. %Empirical investigations back up this strategy. Additionally, our method adaptively scales the hard negatives set through subspace preservation during training. In practice, we develop two schemes to enhance GCL that are pluggable into existing GCL frameworks. The underlying mechanisms are analyzed and the connections to related methods are investigated. Comprehensive experiments demonstrate that our method outperforms across diverse graph datasets and remains competitive across varied application scenarios\footnoteOur code is available at https://github.com/zz-haooo/WWW24-GRAPE. .

22 April 2026 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
HXHaonan Xin
Haonan Xin
HCHaoming Chen
Haoming Chen
ZHZhezheng Hao
Zhezheng Hao
DWDanyang Wu
Danyang Wu
RWRong Wang
Rong Wang
FNFeiping Nie
Feiping Nie
K-means algorithm divides samples into c classes based on their structural characteristics. However, due to the non convex nature of the clustering problem, algorithms are prone to converge to poor local minima. To address the aforementioned issues, we propose the Local Structure Preserving Clustering with Learnable Anchors (LSPC-LA) method. We assume that with a well-designed anchor selection strategy, samples near the same anchor tend to belong to the same cluster, which reveal high confidence Must-Link local structural information for clustering. Based on this observation, we first construct an anchor-based bipartite graph, transforming the sample clustering problem into anchor clustering problem by local structural information, thus reducing the solution space and minimizing the risk of poor local minima. Then we create an anchor guiding matrix to allow anchors to learn the sample structure, improving clustering performance. Subsequently, an alternating iterative algorithm is proposed to optimize the LSPC-LA model. Finally, extensive experiments demonstrate the accuracy of the local structural information and the effectiveness of LSPC-LA.

27 May 2026 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
HXHaonan Xin
Haonan Xin
ZHZhezheng Hao
Zhezheng Hao
ZCZhe Cao
Zhe Cao
ZZZihua Zhao
Zihua Zhao
RWRong Wang
Rong Wang
FNFeiping Nie
Feiping Nie
Tensor-based multi-view clustering algorithms have attracted considerable attention due to their superior clustering performance. However, these algorithms typically treat each view independently, failing to utilize the complementary information across all views, thus lacking globality. Additionally, employing low-rank tensor constraints to extract consistent information among views may result in the loss of important information due to weak consistency constraints. These limitations significantly hinder the clustering performance. To address these issues, we propose Simple Multi-view Tensor Clustering (SimMTC), which achieves globality and strong consistency. SimMTC first applies Fast Fourier Transform (FFT) to the bipartite graphs to obtain high-frequency and low-frequency information, which encode similarities between samples and anchors from all views, thereby capturing global information. Orthogonal tensor factorization is then conducted in the frequency domain. Moreover, a novel strong consistency constraint based on FFT is introduced, which enhances the extraction of consistent information in the frequency domain. What’s more, an efficient alternative optimization algorithm is designed to solve the optimization problem in SimMTC. Finally, extensive experiments on real-world datasets demonstrate that SimMTC achieves state-of-the-art clustering performance.