Intrusion detection of manifold regularized broad learning system based on LU decomposition

Broad Learning System (BLS) is proposed as an alternative to deep learning. It has a fast adaptive model selection and online incremental learning capability, which has been successfully applied in many fields. In this paper, the BLS model is introduced into intrusion detection, and considering the weakness of the BLS model in mining the internal structural information of samples, this paper proposes a Manifold Regularized Broad Learning System based on LU decomposition (LU-MRBLS) intrusion detection. Based on the manifold hypothesis, the LU-MRBLS model firstly constructs the graph Laplacian operator in the data input space to mine the potential information of the data. Then, under the manifold regularized framework, the feature nodes, enhancement nodes, and Laplacian matrix are combined to construct the objective function to regularize and optimize the BLS model to avoid the model falling into local optimization. Finally, the LU decomposition method is used to solve the output weight matrix of the MRBLS model, shorten the training time of the MRBLS model, avoid singular value problems of the solution process, and improve the intrusion detection performance of the model. In this paper, we use the KDD Cup99 dataset for parameter selection and apply it to other network models. Through rigorous experiments, the LU-MRBLS model is applied to KDD Cup99, NSL-KDD, UNSW-NB15, and CIDDS-001 datasets with better detection results than the classical machine learning models and the latest intrusion detection models.