Tri-training algorithm based on cross entropy and K-nearest neighbors for network intrusion detection

• Jia Zhao,
• Song Li,
• Runxiu Wu,
• Yiying Zhang,
• Bo Zhang,
• Longzhe Han,

Vol. 16, No. 12, December 31, 2022
10.3837/tiis.2022.12.006, Download Paper (Free):

• network intrusion detection (NID)
• Semi-supervised learning
• Tri-training
• cross entropy
• k-nearest neighbors

Abstract

To address the problem of low detection accuracy due to training noise caused by mislabeling when Tri-training for network intrusion detection (NID), we propose a Tri-training algorithm based on cross entropy and K-nearest neighbors (TCK) for network intrusion detection. The proposed algorithm uses cross-entropy to replace the classification error rate to better identify the difference between the practical and predicted distributions of the model and reduce the prediction bias of mislabeled data to unlabeled data; K-nearest neighbors are used to remove the mislabeled data and reduce the number of mislabeled data. In order to verify the effectiveness of the algorithm proposed in this paper, experiments were conducted on 12 UCI datasets and NSL-KDD network intrusion datasets, and four indexes including accuracy, recall, F-measure and precision were used for comparison. The experimental results revealed that the TCK has superior performance than the conventional Tri-training algorithms and the Tri-training algorithms using only cross-entropy or K-nearest neighbor strategy.

Statistics

Cite this article