Abstract
1 min readCombination of edge computing technologies and machine learning help to put edge intelligence into practice. Industrial Internet of Things (IIoT) is one of its most typical applications. But this system can be easily attacked in the process of using edge computing center to process localized perception data. Intrusion detection technologies based on machine learning provide strong security for edge computing center, in which the most widely used is gradient boosting decision tree (i.e., GBDT). But still this model faces with problems such as imbalanced data, high dimensional data characteristics, and low efficiency of parameter optimization. To solve these problems, this paper proposes an optimization scheme for GBDT to improve its detection precision and training efficiency. First, to solve the problem of imbalanced data in data set, we propose a margin synthetic minority oversampling technique (i.e., MSMOTE), which can expand the non-noise data with less sample size, namely, small sample, to ensure equilibrium distribution of data. Second, to lower the data feature dimensionality, we propose a recursive feature elimination-hierarchy cross validation algorithm (i.e., RFE-HCV). The new algorithm eliminates redundant data features recursively according to feature weight, to strengthen the relationship between features and goals. It also designs hierarchy system to ensure equal proportionment of data category (attack category) in training set and testing set at cross validation stage. Next, in order to improve the efficiency of parameter optimization in model training process, we develop a flexible grid search algorithm (i.e., FGS) to improve retrieval efficiency of optimum parameters. Finally, the detailed experimental results show that our new scheme ensures data balance in dataset and eliminates redundant data features, and helps the efficiency of parameter optimization increase by three times. Moreover, the new scheme defends against intrusion more effectively.
Discussion(0)
No comments yet. Be the first to comment.