A Comparative Study on Network Traffic Clustering

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Accurate network traffic classification is vital to the areas of network security. There are many applications using dynamic ports and encryption to avoid detection, so previous methods such as port number and payload-based classification exist some shortfalls. An alternative approach is to use Machine learning (ML) techniques. Here we will present three clustering algorithms, K-Means, FarthestFirst and Canopy, based on flow statistic features of applications. The performance impact of the data set processed by the PCA dimension reduction algorithm on the above three algorithms will be an important topic for our discussion. Our results show that the classification accuracy and computational performance all have been significantly improved after dimension reduction.

Cite

CITATION STYLE

APA

Liu, Y., Xue, H., Wei, G., Wu, L., & Wang, Y. (2019). A Comparative Study on Network Traffic Clustering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11928 LNCS, pp. 443–455). Springer. https://doi.org/10.1007/978-3-030-36938-5_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free