Network traffic classification gains continuous interesting while many applications emerge on the different kinds of networks with obfuscation techniques. Decision tree is a supervised machine learning method used widely to identify and classify network traffic. In this paper, we introduce a comparative study focusing on two common decision tree methods namely: C4.5 and Random forest. The study offers comparative results in two different factors are accuracy of classification and processing time. C4.5 achieved high percentage of classification accuracy reach to 99.67 for 24000 instances while Random Forest was faster than C4.5 in term of processing time.

Unsupervised leaning is a popular method for classify unlabeled dataset i.e. without prior knowledge about data class. Many of unsupervised learning are used to inspect and classify network flow. This paper presents in-deep study for three unsupervised classifiers, namely: K-means, K-nearest neighbor and Expectation maximization. The methodologies and how it’s employed to classify network flow are elaborated in details. The three classifiers are evaluated using three significant metrics, which are classification accuracy, classification speed and memory consuming. The K-nearest neighbor introduce better results for accuracy and memory; while K-means announce lowest processing time.