Haibin Cai

Haibin Cai


Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
10 May 2016 in EURASIP Journal on Wireless Communications and Networking
Verified
Journal Article
Open access
PDF file
OOOpeyemi Osanaiye
Opeyemi Osanaiye
HCHaibin Cai
Haibin Cai
KCKim-Kwang Raymond Choo
Kim-Kwang Raymond Choo
ADAli Dehghantanha
Ali Dehghantanha
ZXZheng Xu
Zheng Xu
MDMqhele Dlodlo
Mqhele Dlodlo
Widespread adoption of cloud computing has increased the attractiveness of such services to cybercriminals. Distributed denial of service (DDoS) attacks targeting the cloud’s bandwidth, services and resources to render the cloud unavailable to both cloud providers, and users are a common form of attacks. In recent times, feature selection has been identified as a pre-processing phase in cloud DDoS attack defence which can potentially increase classification accuracy and reduce computational complexity by identifying important features from the original dataset during supervised learning. In this work, we propose an ensemble-based multi-filter feature selection method that combines the output of four filter methods to achieve an optimum selection. We then perform an extensive experimental evaluation of our proposed method using intrusion detection benchmark dataset, NSL-KDD and decision tree classifier. The findings show that our proposed method can effectively reduce the number of features from 41 to 13 and has a high detection rate and classification accuracy when compared to other classification techniques.

30 October 2017 in IEEE Transactions on Circuits and Systems I: Regular Papers
Verified
Journal Article
Closed access
KLKexin Liu
Kexin Liu
PDPeihu Duan
Peihu Duan
ZDZhisheng Duan
Zhisheng Duan
HCHaibin Cai
Haibin Cai
JLJinhu Lu
Jinhu Lu
This paper addresses the event-based leader-following consensus of a class of multi-agent systems with switching networks. Fully distributed event-triggered functions are proposed to select the sampling instants automatically. Detailed algorithms are given to design the feedback gains and coupling strength. The positive lower bound of the sampling intervals is captured to exclude Zeno behaviours. Finally, simulations are also carried out to verify the effectiveness of the event-triggered control scheme.

24 October 2023 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
Ting WangTing Wang
Ting Wang
YDYuxiang Deng
Yuxiang Deng
ZYZhao Yang
Zhao Yang
YWYang Wang
Yang Wang
HCHaibin Cai
Haibin Cai
Multiaccess edge computing (MEC) has emerged as a promising solution that can enable low-end terminal devices to run large complex applications by offloading their tasks to edge servers. The task offloading strategy, determining how to offload tasks, remains the most critical issue of MEC. Traditional offloading approaches either suffer from high computational complexity or poor self-adjustability to dynamic changes in the edge environment. Deep reinforcement learning (DRL) provides an effective way to tackle these issues. However, most existing DRL-based methods solely consider either a continuous or a discrete action space, where the limited action space results in accuracy loss and restricts the optimality of offloading decisions. Nevertheless, the edge task offloading problem in practice often confronts both discrete and continuous actions. In this article, we propose a tailored proximal policy optimization (PPO)-based method, named Hybrid-PPO, enhanced by the parameterized discrete-continuous hybrid action space. Assisted with Hybrid-PPO, we further design a novel DRL-based multiserver multitask collaborative partial task offloading scheme adhering to a series of specifically built formal models. Experimental results prove that our approach achieves high offloading efficiency and outperforms the existing state-of-the-art offloading schemes in terms of convergence rate, energy cost, time cost, and generalizability under various network conditions.

21 December 2020 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
JCJingzhou Chen
Jingzhou Chen
SWShihao Wang
Shihao Wang
LCLing Chen
Ling Chen
HCHaibin Cai
Haibin Cai
YQYuntao Qian
Yuntao Qian
When a detection model that has been well-trained on a set of classes faces new classes, incremental learning is always necessary to adapt the model to detect the new classes. In most scenarios, it is required to preserve the learned knowledge of the old classes during incremental learning rather than reusing the training data from the old classes. Since the objects in remote sensing images often appear in various sizes, arbitrary directions, and dense distribution, it further makes incremental learning-based object detection more difficult. In this article, a new architecture for incremental object detection is proposed based on feature pyramid and knowledge distillation. Especially, by means of a feature pyramid network (FPN), the objects with various scales are detected in the different layers of the feature pyramid. Motivated by Learning without Forgetting (LwF), a new branch is expended in the last layer of FPN, and knowledge distillation is applied to the outputs of the old branch to maintain the old learning capability for the old classes. Multitask learning is adopted to jointly optimize the losses from two branches. Experiments on two widely used remote sensing data sets show our promising performance compared with state-of-the-art incremental object detection methods.

30 June 2016
Verified
Book Chapter
Closed access
PDF file
YYYanjiang Yang
Yanjiang Yang
HCHaibin Cai
Haibin Cai
ZWZhuo Wei
Zhuo Wei
HLHaibing Lu
Haibing Lu
KCKim-Kwang Raymond Choo
Kim-Kwang Raymond Choo

10 December 2021 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
ZCZexi Chen
Zexi Chen
Ting WangTing Wang
Ting Wang
HCHaibin Cai
Haibin Cai
Subrota Kumar MondalSubrota Kumar Mondal
Subrota Kumar Mondal
JSJyoti Prakash Sahoo
Jyoti Prakash Sahoo
As an emulous alternative to deep neural networks, Deep Forest emerges with features like low complexity, fewer hyper-parameters, and good robustness, which are predominantly desired in distributed computing applications and ecosystems. Recently, an efficient distributed Deep Forest system, named ForestLayer, was proposed, designing a fine-grained sub-Forest-based task-parallel algorithm to improve the parallel computing efficiency of Deep Forest. However, the sub-Forest splitting of ForestLayer is static and one-off without adaptability to the computing environment, nevertheless, the size of splitting granularity has a significant impact on the system performance. To further improve the computing efficiency and scalability of the distributed Deep Forest, in this paper, we propose a novel distributed Deep Forest algorithm, named BLB-gcForest (Bag of Little Bootstraps-gcForest), which augments the gcForest (multi-Grained Cascade Forest) approach for constructing Deep Forest. BLB-gcForest carries out parallel computation for each tree in sub-Forests at a finer parallel granularity and integrates with the Bag of Little Bootstraps (BLB) mechanism to reduce massive transmitted feature instances for Cascade Forest Layers, utterly improving both computation efficiency and communication efficiency. Moreover, to solve the problem of the forest splitting granularity, we further design an adaptive sub-Forest splitting algorithm to ensure the maximum resource utilization for parallel computation of each sub-Forest. Experimental results on four well-known large-scale datasets, namely YEAST, LETTER, MNIST, CIFAR10, show that the training efficiency of BLB-gcForest achieves up to 20.3x and 1.64x speedups compared with the state-of-the-art gcForest and ForestLayer, respectively while guaranteeing higher accuracy and better robustness