RangeTree:一种C4.5决策树的特征选择算法

Hui Zhu, Siyu Chen, L. Zhu, Hui Li, Xiaofeng Chen
{"title":"RangeTree:一种C4.5决策树的特征选择算法","authors":"Hui Zhu, Siyu Chen, L. Zhu, Hui Li, Xiaofeng Chen","doi":"10.1109/INCoS.2013.13","DOIUrl":null,"url":null,"abstract":"In order to conduct fine-grained network management in mobile network, Traffic Classification or Detection is widely used to divide network traffic into different classes, according to their source applications. Many techniques are exploited in Traffic Classification. Among them, machine learning has grown considerably attention because of its accuracy. Feature selection chooses feature combinations for machine learning algorithms, and has significant influence on the accuracy and efficiency. To discover optimal features, all possible combinations need to be evaluated by testing real classifiers. With numerous features, feature selection can cost an abundance of time and computational resources. This paper proposes a feature selection algorithm for C4.5 Decision Tree. This algorithm utilizes structural characteristics of C4.5 algorithm to exclude some of the combinations without actually testing the classifiers. The simulation results demonstrate that the algorithm can reduce the number of tests in seeking the optimal feature combination.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"338 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"RangeTree: A Feature Selection Algorithm for C4.5 Decision Tree\",\"authors\":\"Hui Zhu, Siyu Chen, L. Zhu, Hui Li, Xiaofeng Chen\",\"doi\":\"10.1109/INCoS.2013.13\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to conduct fine-grained network management in mobile network, Traffic Classification or Detection is widely used to divide network traffic into different classes, according to their source applications. Many techniques are exploited in Traffic Classification. Among them, machine learning has grown considerably attention because of its accuracy. Feature selection chooses feature combinations for machine learning algorithms, and has significant influence on the accuracy and efficiency. To discover optimal features, all possible combinations need to be evaluated by testing real classifiers. With numerous features, feature selection can cost an abundance of time and computational resources. This paper proposes a feature selection algorithm for C4.5 Decision Tree. This algorithm utilizes structural characteristics of C4.5 algorithm to exclude some of the combinations without actually testing the classifiers. The simulation results demonstrate that the algorithm can reduce the number of tests in seeking the optimal feature combination.\",\"PeriodicalId\":353706,\"journal\":{\"name\":\"2013 5th International Conference on Intelligent Networking and Collaborative Systems\",\"volume\":\"338 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-09-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 5th International Conference on Intelligent Networking and Collaborative Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INCoS.2013.13\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INCoS.2013.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

为了在移动网络中进行细粒度的网络管理,流量分类或检测被广泛用于将网络流量根据其来源应用划分为不同的类别。在流量分类中应用了许多技术。其中,机器学习因其准确性而备受关注。特征选择为机器学习算法选择特征组合,对机器学习算法的准确率和效率有重要影响。为了发现最优特征,需要通过测试真实分类器来评估所有可能的组合。由于特征众多,特征选择可能会花费大量的时间和计算资源。本文提出了一种C4.5决策树的特征选择算法。该算法利用C4.5算法的结构特征,在不实际测试分类器的情况下,排除了部分组合。仿真结果表明,该算法可以减少寻找最优特征组合的测试次数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
RangeTree: A Feature Selection Algorithm for C4.5 Decision Tree
In order to conduct fine-grained network management in mobile network, Traffic Classification or Detection is widely used to divide network traffic into different classes, according to their source applications. Many techniques are exploited in Traffic Classification. Among them, machine learning has grown considerably attention because of its accuracy. Feature selection chooses feature combinations for machine learning algorithms, and has significant influence on the accuracy and efficiency. To discover optimal features, all possible combinations need to be evaluated by testing real classifiers. With numerous features, feature selection can cost an abundance of time and computational resources. This paper proposes a feature selection algorithm for C4.5 Decision Tree. This algorithm utilizes structural characteristics of C4.5 algorithm to exclude some of the combinations without actually testing the classifiers. The simulation results demonstrate that the algorithm can reduce the number of tests in seeking the optimal feature combination.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信