Alhamza Munther, Alabass Alalousi, Shahrul Nizam, R. R. Othman, Mohammed Anbar
{"title":"网络流量分类-两种常见决策树方法的比较研究:C4.5和随机森林","authors":"Alhamza Munther, Alabass Alalousi, Shahrul Nizam, R. R. Othman, Mohammed Anbar","doi":"10.1109/ICED.2014.7015800","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":143806,"journal":{"name":"2014 2nd International Conference on Electronic Design (ICED)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Network traffic classification — A comparative study of two common decision tree methods: C4.5 and Random forest\",\"authors\":\"Alhamza Munther, Alabass Alalousi, Shahrul Nizam, R. R. Othman, Mohammed Anbar\",\"doi\":\"10.1109/ICED.2014.7015800\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":143806,\"journal\":{\"name\":\"2014 2nd International Conference on Electronic Design (ICED)\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 2nd International Conference on Electronic Design (ICED)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICED.2014.7015800\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 2nd International Conference on Electronic Design (ICED)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICED.2014.7015800","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Network traffic classification — A comparative study of two common decision tree methods: C4.5 and Random forest
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.