基于封装子集选择的高维数据特征选择

G. Manikandan, E. Susi, S. Abirami
{"title":"基于封装子集选择的高维数据特征选择","authors":"G. Manikandan, E. Susi, S. Abirami","doi":"10.1109/ICRTCCM.2017.58","DOIUrl":null,"url":null,"abstract":"In recent years, feature subset selection and classification in high dimensional data is a major challenge faced by the researchers. The main aim of the feature subset selection is to find most informative features from the vast number of features in the high dimensional data. Filter, wrapper and embedded methods are currently used to solve these issues. In this paper, we have incorporated wrapper based subset selection technique for selecting a subset from the high dimensional datasets. In this approach to find the optimal threshold value, the feature subsets are given to the classifier iteratively until the maximum accuracy is obtained. The symmetrical uncertainty method is used to weight the features to predict the predominant feature. For validating the incorporated algorithm, we have used 10-fold cross validation against the two standard classification techniques such as Naive Bayes and Support Vector Machine (SVM) and the results are tabulated and compared. The comparison between the results shows that the proposed method gives the better accuracy and results.","PeriodicalId":134897,"journal":{"name":"2017 Second International Conference on Recent Trends and Challenges in Computational Models (ICRTCCM)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Feature Selection on High Dimensional Data Using Wrapper Based Subset Selection\",\"authors\":\"G. Manikandan, E. Susi, S. Abirami\",\"doi\":\"10.1109/ICRTCCM.2017.58\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In recent years, feature subset selection and classification in high dimensional data is a major challenge faced by the researchers. The main aim of the feature subset selection is to find most informative features from the vast number of features in the high dimensional data. Filter, wrapper and embedded methods are currently used to solve these issues. In this paper, we have incorporated wrapper based subset selection technique for selecting a subset from the high dimensional datasets. In this approach to find the optimal threshold value, the feature subsets are given to the classifier iteratively until the maximum accuracy is obtained. The symmetrical uncertainty method is used to weight the features to predict the predominant feature. For validating the incorporated algorithm, we have used 10-fold cross validation against the two standard classification techniques such as Naive Bayes and Support Vector Machine (SVM) and the results are tabulated and compared. The comparison between the results shows that the proposed method gives the better accuracy and results.\",\"PeriodicalId\":134897,\"journal\":{\"name\":\"2017 Second International Conference on Recent Trends and Challenges in Computational Models (ICRTCCM)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 Second International Conference on Recent Trends and Challenges in Computational Models (ICRTCCM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICRTCCM.2017.58\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Second International Conference on Recent Trends and Challenges in Computational Models (ICRTCCM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICRTCCM.2017.58","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

高维数据的特征子集选择与分类是近年来研究人员面临的主要挑战。特征子集选择的主要目的是从大量的高维数据特征中找出信息量最大的特征。过滤器、包装器和嵌入式方法目前被用来解决这些问题。在本文中,我们将基于包装器的子集选择技术用于从高维数据集中选择子集。在寻找最优阈值的方法中,将特征子集迭代地交给分类器,直到获得最大精度。采用对称不确定度法对特征进行加权,预测优势特征。为了验证合并算法,我们对两种标准分类技术(如朴素贝叶斯和支持向量机(SVM))使用了10倍交叉验证,并将结果制成表格并进行比较。结果表明,该方法具有较好的精度和较好的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Feature Selection on High Dimensional Data Using Wrapper Based Subset Selection
In recent years, feature subset selection and classification in high dimensional data is a major challenge faced by the researchers. The main aim of the feature subset selection is to find most informative features from the vast number of features in the high dimensional data. Filter, wrapper and embedded methods are currently used to solve these issues. In this paper, we have incorporated wrapper based subset selection technique for selecting a subset from the high dimensional datasets. In this approach to find the optimal threshold value, the feature subsets are given to the classifier iteratively until the maximum accuracy is obtained. The symmetrical uncertainty method is used to weight the features to predict the predominant feature. For validating the incorporated algorithm, we have used 10-fold cross validation against the two standard classification techniques such as Naive Bayes and Support Vector Machine (SVM) and the results are tabulated and compared. The comparison between the results shows that the proposed method gives the better accuracy and results.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信