Zhenyu Li

Zhenyu Li


Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
19 February 2024 in Scientific Reports
Verified
Journal Article
Open access
PDF file
FLFeng Liu
Feng Liu
ZLZhenyu Li
Zhenyu Li
CYChunfang Yang
Chunfang Yang
DGDaofu Gong
Daofu Gong
HLHaoyu Lu
Haoyu Lu
FLFenlin Liu
Fenlin Liu
Message passing neural networks such as graph convolutional networks (GCN) can jointly consider various types of features for social bot detection. However, the expressive power of GCN is upper-bounded by the 1st-order Weisfeiler–Leman isomorphism test, which limits the detection performance for the social bots. In this paper, we propose a subgraph encoding based GCN model, SEGCN, with stronger expressive power for social bot detection. Each node representation of this model is computed as the encoding of a surrounding induced subgraph rather than encoding of immediate neighbors only. Extensive experimental results on two publicly available datasets, Twibot-20 and Twibot-22, showed that the proposed model improves the accuracy of the state-of-the-art social bot detection models by around 2.4%, 3.1%, respectively.

26 April 2024 in Knowledge and Information Systems
Verified
Journal Article
Closed access
PDF file
YLYan Li
Yan Li
ZLZhenyu Li
Zhenyu Li
DGDaofu Gong
Daofu Gong
QHQian Hu
Qian Hu
HLHaoyu Lu
Haoyu Lu

1 June 2020 in Information Sciences
Verified
Journal Article
Closed access
ZLZhenyu Li
Zhenyu Li
ABAdrian G. Bors
Adrian G. Bors

25 April 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
HLHaoyu Lu
Haoyu Lu
DGDaofu Gong
Daofu Gong
ZLZhenyu Li
Zhenyu Li
FLFeng Liu
Feng Liu
FLFenlin Liu
Fenlin Liu
Worries about the increasing number of Sybils in online social networks (OSNs) are amplified by a range of security issues; thus, Sybil detection has become an urgent real-world problem. Lightweight and limited data-friendly, LBP (Loopy Belief Propagation)-based Sybil-detection methods on the social graph are extensively adopted. However, existing LBP-based methods that do not utilize node attributes often assume a global or predefined homophily strength of edges in the social graph, while different user’s discrimination and preferences may vary, resulting in local homogeneity differences. Another issue is that the existing message-passing paradigm uses the same edge potential when propagating belief to both sides of a directed edge, which does not agree with the trust interaction in one-way social relationships. To bridge these gaps, we present SybilHP, a Sybil-detection method optimized for directed social networks with adaptive homophily prediction. Specifically, we incorporate an iteratively updated edge homophily estimation into the belief propagation to better adapt to the personal preferences of real-world social network users. Moreover, we endow message passing on edges with directionality by a direction-sensitive potential function design. As a result, SybilHP can better capture the local homophily and direction pattern in real-world social networks. Experiments show that SybilHP works with high detection accuracy on synthesized and real-world social graphs. Compared with various state-of-the-art graph-based methods on a large-scale Twitter dataset, SybilHP substantially outperforms existing methods.

18 February 2019 in IEEE Access
Verified
Journal Article
Open access
JLJicang Lu
Jicang Lu
GZGang Zhou
Gang Zhou
CYChunfang Yang
Chunfang Yang
ZLZhenyu Li
Zhenyu Li
MLMingjing Lan
Mingjing Lan
For current steganalysis of image content-adaptive steganography, there are multiple problems to be improved, such as high difficulty and low accuracy when detecting images with various content and texture. For this problem, an improved steganalytic method is proposed in this paper based on pre-classification and feature selection. Firstly, using the features extracted based on dependency analysis of image adjacent data, the images with various content and texture complexities are pre-classified as multiple clusters by K-means algorithms. Then, the performance of existing various steganalytic features are analyzed for different clusters of images, and the optimal feature for each cluster are selected for final classification. Experimental results show that, the detection accuracy could be improved by the proposed method, and the rationality and availability are also verified. At the same time, the analysis and experimental results in this paper also show that, the images with rich content and complex texture should be paid more attention both in steganography and steganalysis.

25 December 2023 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
FLFeng Liu
Feng Liu
CYChunfang Yang
Chunfang Yang
ZLZhenyu Li
Zhenyu Li
DGDaofu Gong
Daofu Gong
RMRui Ma
Rui Ma
FLFenlin Liu
Fenlin Liu
Various malicious activities performed by the social bots have brought a crisis of trust to the online social networks. In this paper, we propose a social bot detection method, named Accou2vec, based on community walk. First, in order to cut off the attacking edges between the human and bot accounts, the deep autoencoder-like non-negative matrix factorization community detection algorithm is leveraged to divide the social graph into multiple subgraphs. Then, we design the community walk rule that controls the intra-community walk and inter-community walk differently, considering both the number of nodes and edges in the community. Subsequently, the graph representation learning is used to learn the representation vector of each account. Finally, the representation vectors of labeled social bots and human accounts are used to train the classifier for social bots detection. Extensive experimental results on two real-world datasets show the superior performance of the proposed method over the state-of-the-art.