Optimal supervised feature extraction in internet traffic classification

Aliakbarian, M. S ; Sharif University of Technology | 2013

648 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/PACRIM.2013.6625457
  3. Publisher: 2013
  4. Abstract:
  5. Internet traffic classification is important in many aspects of network management such as data exploitation detection, malicious user identification, and restricting application traffic. Previously, features such as port and protocol numbers have been used to classify traffic, but these features can now be changed easily, making their use in traffic classification inadequate. Consequently, traffic classification based on machine learning (ML) is now employed. The number of features used in an ML algorithm has a significant impact on performance, in particular accuracy. In this paper, a minimum best feature set is chosen using a supervised method to obtain uncorrelated features. Outlier removal and data normalization is used to reduce the dimensionality. The data projected into the resulting space is then used to construct the classifier input. Finally, the decision tree, artificial neural network and naïve Bayesian single classifier algorithms, and the bagging and boosting ensemble algorithms, are used for traffic classification. Results are presented which show that the feature space dimension can be reduced to M-1, where M is the number of classes, with no loss in class separability
  6. Keywords:
  7. Feature selection ; Machine learning ; Class separability ; Classifier algorithms ; Dimensionality reduction ; Internet traffic classifications ; Supervised feature extractions ; Traffic classification ; Uncorrelated features ; User identification ; Algorithms ; Decision trees ; Feature extraction ; Learning systems ; Network management ; Neural networks ; Signal processing ; Telecommunication traffic
  8. Source: IEEE Pacific RIM Conference on Communications, Computers, and Signal Processing - Proceedings ; 2013 , Pages 102-107 ; 1555-5798 (ISSN) ; 9781479915019 (ISBN)
  9. URL: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6625457