Bo Zhou

Bo Zhou

Auto-generated profile, based on publicly available information

Bo Zhou

Institute of Cyberspace Security, College of Information Engineering, Zhejiang University of Technology, Hangzhou, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
13 July 2022 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
BZBo Zhou
Bo Zhou
YLYuqian Lv
Yuqian Lv
JWJinhuan Wang
Jinhuan Wang
JZJian Zhang
Jian Zhang
QXQi Xuan
Qi Xuan
The concept of $k$ -core in complex networks plays a key role in many applications, e.g., understanding the global structure or identifying central/critical nodes, of a network. A malicious attacker with a jamming ability can exploit the vulnerability of the $k$ -core structure to attack the network and invalidate the network analysis methods, e.g., reducing the $k$ -shell values of nodes can deceive graph algorithms, leading to the wrong decisions. In this article, we investigate the robustness of the $k$ -core structure under adversarial attacks by deleting edges, for the first time. First, we give the general definition of the targeted $k$ -core attack, map it to the set cover problem, which is NP-hard, and further introduce a series of evaluation metrics to measure the performance of attack methods. Then, we propose the $Q$ index theoretically as the probability that the terminal node of an edge does not belong to the innermost core, which is further used to guide the design of our heuristic attack methods, namely, COREATTACK and GreedyCOREATTACK. The experiments on a variety of real-world networks demonstrate that our methods behave much better than a series of baselines, in terms of much smaller edge change rate (ECR) and false attack rate (FAR), achieving state-of-the-art attack performance. More impressively, for certain real-world networks, only deleting one edge from the $k$ -core may lead to the collapse of the innermost core, even if this core contains dozens of nodes. Such a phenomenon indicates that the $k$ -core structure could be extremely vulnerable under adversarial attacks, and its robustness, thus, should be carefully addressed to ensure the security of many graph algorithms. An open-source implementation is available at https://github.com/Yocenly/COREATTACCK.

30 November 2023 in IEEE Transactions on Circuits and Systems II: Express Briefs
Verified
Journal Article
Closed access
BZBo Zhou
Bo Zhou
XYXiudi Yan
Xiudi Yan
YLYuqian Lv
Yuqian Lv
QXQi Xuan
Qi Xuan
The clustering coefficient is a crucial characteristic of networks, providing insights into their local compactness. However, concerns arise regarding the clustering coefficient’s robustness when networks are subjected to adversarial attacks. In this paper, we introduce and formalize the concept of clustering coefficient attack and propose an efficient strategy to attack it by rewiring a small number of links. Our approach leverages Simulated Annealing (SA) to create a clustering coefficient attack method. We conduct extensive experiments on five real-world networks to validate the vulnerability of the clustering coefficient under adversarial attacks. Surprisingly, we find that disturbing as little as 1% of the edges can lead to an increase of over 50% in the clustering coefficient. These results underscore the pressing need to explore ways to enhance the clustering coefficient’s robustness against such attacks in future research. Addressing this challenge could be an intriguing avenue for further investigation.

15 September 2021 in IEEE Transactions on Circuits and Systems II: Express Briefs
Verified
Journal Article
Closed access
BZBo Zhou
Bo Zhou
YLYuqian Lv
Yuqian Lv
YMYongchao Mao
Yongchao Mao
JWJinhuan Wang
Jinhuan Wang
SYShanqing Yu
Shanqing Yu
QXQi Xuan
Qi Xuan
The ${k}$ -shell decomposition plays an important role in unveiling the structural properties of a network. However, there arises concern about the robustness of the ${k}$ -shell structure when networks suffer from adversarial attacks. Here, we introduce and formalize the problem of ${k}$ -shell attack and develop an efficient strategy to attack the ${k}$ -shell structure by rewiring a small number of links. In particular, we propose a Simulated Annealing (SA) based ${k}$ -shell attack method and testify it on five real-world networks. The extensive experiments validate that the ${k}$ -shell structure of a network is robust under random perturbation, but it is quite vulnerable under adversarial attack. Therefore, it could be an interesting topic to improve the robustness of various network properties against adversarial attack in the future.

2 April 2024 in Physica A: Statistical Mechanics and its Applications
Verified
Journal Article
Closed access
YLYuqian Lv
Yuqian Lv
BZBo Zhou
Bo Zhou
JWJinhuan Wang
Jinhuan Wang
QXQi Xuan
Qi Xuan

15 April 2022
Verified
Conference Paper
Closed access
BZBo Zhou
Bo Zhou
JXJun Xu
Jun Xu
CFCheng Fang
Cheng Fang
YZYiRu Zhang
YiRu Zhang
In view of the production process, it is necessary to master the running state of industrial robots in real time. Firstly, the current research status of equipment diagnostic prediction is investigated. Secondly, based on the hidden Markov model, the theoretical model of state prediction of industrial robot is derived. The model includes two calculations. The operation states of industrial robot are divided into three states. The three states are hidden states. The probability of occurrence of the explicit state current and voltage value in each hidden state accords with the mixture Gaussian distribution. Using EM algorithm, the iterative parameters of the observed state Gaussian mixture model of industrial robot are derived, and the observed state Gaussian mixture model is trained by using the historical current and voltage data of industrial robot joints. Finally, according to the current and voltage data collected at different times, the state prediction model of industrial robot is verified.

22 January 2024 in IEEE Transactions on Circuits and Systems II: Express Briefs
Verified
Journal Article
Closed access
YLYuqian Lv
Yuqian Lv
BZBo Zhou
Bo Zhou
JWJinhuan Wang
Jinhuan Wang
SYShanqing Yu
Shanqing Yu
QXQi Xuan
Qi Xuan
The concept of k-core plays an important role in measuring the cohesiveness and engagement of a network. And recent studies have shown the vulnerability of k-core under adversarial attacks. However, there are few researchers concentrating on the vulnerability of individual nodes within k-core. Therefore, in this paper, we attempt to study Targeted k-Nodes Collapse Problem (TNsCP), which focuses on removing a minimal size set of edges to make multiple target k-nodes collapse. For this purpose, we first propose a novel algorithm named MOD for candidate reduction. Then we introduce an efficient strategy named MONA, based on MOD, to address TNsCP. Extensive experiments validate the effectiveness and scalability of MONA compared to several baselines. An open-source implementation is available at https://github.com/Yocenly/MONA.