Zhiwei Zhang

Zhiwei Zhang


Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
27 April 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
WWWenqi Wang
Wenqi Wang
ZZZhiwei Zhang
Zhiwei Zhang
GWGuoren Wang
Guoren Wang
YYYe Yuan
Ye Yuan
Blockchain has received great attention in academia and industry due to its decentralization and immutability. From the perspective of transaction processing, blockchain is a distributed shared ledger and database with the characteristics of decentralization, traceability, and transparency. These features ensure the security of blockchain’s reliability. However, because a blockchain network requires complex consensus verification between users, it causes problems such as a high cost of data exchange and a low system throughput. Such problems are aggravated when executing a cross-chain transaction, as it is particularly important to ensure the atomicity and isolation of transactions across the blockchain. Considering this, in this paper, we propose the cross-chain transaction processing flow of EOVPC and efficient transaction processing based on version control. Different from the existing cross-chain transaction approaches based on locking, we propose optimistic approaches in which the updated data can be used immediately, with a rolling back procedure that guarantees atomicity. We conducted extensive experiments, which show that our approaches can improve the throughput and success rate significantly.

16 June 2021 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
KZKangfei Zhao
Kangfei Zhao
ZZZhiwei Zhang
Zhiwei Zhang
YRYu Rong
Yu Rong
JYJeffrey Xu Yu
Jeffrey Xu Yu
JHJunzhou Huang
Junzhou Huang
Finding critical users in social networks is an important issue. The criticalness of a user can be measured by the number of followers who will leave the community together when the user leaves. By taking a social community as a k-core, the problem of finding critical users is to find a set of nodes, U, of size b in a k-core that maximizes the number of nodes to be deleted from the k-core when all nodes in U are deleted. This problem is NP-hard. The state-of-the-art greedy algorithm is with no guarantee on the set of nodes U found. In this paper, we propose a neural network model, called Self-attentive Core Graph Convolution Network (SCGCN), to capture the hidden structure of the criticalness among node combinations that break the engagement of a specific social community. Supervised by sampling node combinations, SCGCN has the ability to inference the criticalness of unseen combinations of nodes. To further reduce the sampling and inference space, we propose a deterministic strategy to prune unpromising nodes on the graph. Our experiments conducted on many real-world graphs show that SCGCN significantly improves the quality of the solution compared with the state-of-the-art greedy algorithm.

12 January 2023 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
LZLingling Zhang
Lingling Zhang
ZZZhiwei Zhang
Zhiwei Zhang
GWGuoren Wang
Guoren Wang
YYYe Yuan
Ye Yuan
KZKangfei Zhao
Kangfei Zhao
Hypergraph streams provide an efficient model to express and preserve complex connections in various applications. Triangles in a hypergraph can be formed by vertices and hyperedges. The specific counts of triangles are important to analyze various applications. Due to the huge costs of counting triangles based on the whole datasets, a sampling-and-estimating framework has low overhead while obtaining a relatively accurate result. However, existing sampling algorithms focus on pairwise graph streams, they estimate the counts of triangles formed by vertices with large estimation errors and can not be applied to count triangles formed by hyperedges. Therefore, this paper first proposes a sampling-and-estimating framework that produces hyperedge samples using a reservoir with static capacity to estimate the total counts of triangles by inferring the probabilities of forming the triangles respectively. Furthermore, to improve the estimation accuracy, this paper proposes another sampling-and-estimating framework to produce samples in the form of hyperedge pairs which can be used to compute the probabilities of the formations of triangles more accurately and then estimate the total triangle counts with smaller estimation variances. The extensive experiments based on real-world datasets confirm the efficiency and accuracy of our proposed frameworks for counting triangles in different types of hypergraphs at a small sampling ratio.

18 August 2025 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
LZLingling Zhang
Lingling Zhang
TLTiancheng Lu
Tiancheng Lu
ZSZhiping Shi
Zhiping Shi
ZZZhiwei Zhang
Zhiwei Zhang
YYYe Yuan
Ye Yuan
GWGuoren Wang
Guoren Wang
Influence maximization (IM) aims to identify $k$ vertices that maximize influence spread across a network. While well-studied in regular graphs, IM in hypergraphs presents unique challenges: conventional graph-based IM methods fail to capture hypergraph-specific structural properties, and existing hypergraph IM algorithms lack theoretical guarantees for time complexity and approximation quality. We address these gaps with HyperIM, a novel algorithm leveraging stratified sampling to generate random reversible reachable sets for efficient seed selection. Our key innovation lies in dual-perspective stratified sampling: assigning sampling probabilities based on vertex structural properties while applying size-adaptive sampling strategies. This approach optimizes seed selection, reduces computational costs, and provides rigorous theoretical guarantees. We further propose HyperIM_BRR, which optimizes the required number of reversible reachable sets, achieving substantial cost reduction without sacrificing accuracy. Extensive experiments on real-world hypergraphs demonstrate that our algorithms significantly outperform state-of-the-art methods, delivering faster execution times and superior influence spread.

7 November 2022
Verified
Book Chapter
Closed access
PDF file
XWXinzhou Wang
Xinzhou Wang
YCYinjia Chen
Yinjia Chen
ZZZhiwei Zhang
Zhiwei Zhang
PQPengPeng Qiao
PengPeng Qiao
GWGuoren Wang
Guoren Wang

2 September 2022 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
LZLingling Zhang
Lingling Zhang
ZZZhiwei Zhang
Zhiwei Zhang
GWGuoren Wang
Guoren Wang
YYYe Yuan
Ye Yuan
SZShuai Zhao
Shuai Zhao
JXJianliang Xu
Jianliang Xu
Searching subgraph containment, also called subgraph matching in hypergraphs, is to enumerate all the embeddings of a data hypergraph with a given query hypergraph, which plays an important role in the analysis of hypergraph-modeled applications. However, existing subgraph matching frameworks mainly focus on pairwise graphs and the existing techniques can not efficiently be applied to search subgraph containment at low costs. Therefore, this paper proposes HyperISO to efficiently search subgraph containment that consists of three parts: 1) new filtering techniques driven by exploring the properties and connections of hyperedges to reduce unpromising products for the sake of low matching costs, 2) a novel ordering strategy that is able to generate an optimized matching process by considering both the sizes of hyperedge candidates and the unmatched vertices of the hyperedges, and 3) a dual enumeration algorithm to list both the vertex and hyperedge mappings. Extensive experiments on both real and synthetic data show that HyperISO outperforms the best among the sophisticated subgraph matching frameworks and meanwhile verify the efficiency of HyperISO in various types of hypergraphs.