Improved KNN Algorithm for Fine-Grained Classification of Encrypted Network Flow

• Main Authors: Chencheng Ma, Xuehui Du, Lifeng Cao
• Format: Article
• Language: English
• Published: MDPI AG 2020-02-01
• Series: Electronics
• Subjects: encrypted network flow classification; k-nearest neighbor algorithm; feature selection and weighted; fine-grained analysis; small training set
• Online Access: https://www.mdpi.com/2079-9292/9/2/324

The fine-grained classification of encrypted traffic is important for network security analysis. Malicious attacks are usually encrypted and simulated as normal application or content traffic. Supervised machine learning methods are widely used for traffic classification and show good performances. However, they need a large amount of labeled data to train a model, while labeled data is hard to obtain. Aiming at solving this problem, this paper proposes a method to train a model based on the K-nearest neighbor (KNN) algorithm, which only needs a small amount of data. Due to the fact that the importance of different traffic features varies, and traditional KNN does not highlight the importance of different features, this study introduces the concept of feature weight and proposes the weighted feature KNN (WKNN) algorithm. Furthermore, to obtain the optimal feature set and the corresponding feature weight set, a feature selection and feature weight self-adaptive algorithm for WKNN is proposed. In addition, a three-layer classification framework for encrypted network flows is established. Based on the improved KNN and the framework, this study finally presents a method for fine-grained classification of encrypted network flows, which can identify the encryption status, application type and content type of encrypted network flows with high accuracies of 99.3%, 92.4%, and 97.0%, respectively.