An enhanced feature selection method comprising rough set and clustering techniques

A. Murugan, T. Sridevi
{"title":"An enhanced feature selection method comprising rough set and clustering techniques","authors":"A. Murugan, T. Sridevi","doi":"10.1109/ICCIC.2014.7238376","DOIUrl":null,"url":null,"abstract":"Feature selection or variable reduction is a fundamental problem in data mining, refers to the process of identifying the few most important features for application of a learning algorithm. The best subset contains the minimum number of dimensions retaining a suitably high accuracy on classifier in representing the original features. The objective of the proposed approach is to reduce the number of input features thus to identify the key features and eliminating irrelevant features with no predictive information using clustering technique, K-nearest neighbors (KNN) and rough set. This paper deals with two partition based clustering algorithm in data mining namely K-Means and Fuzzy C Means (FCM). These two algorithms are implemented for original data set without considering the class labels and further rough set theory implemented on the partitioned data set to generate feature subset after removing the outlier by using KNN. Wisconsin Breast Cancer datasets derived from UCI machine learning database are used for the purpose of testing the proposed hybrid method. The results show that the hybrid method is able to produce more accurate diagnosis and prognosis results than the full input model with respect to the classification accuracy.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"105 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE International Conference on Computational Intelligence and Computing Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIC.2014.7238376","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Feature selection or variable reduction is a fundamental problem in data mining, refers to the process of identifying the few most important features for application of a learning algorithm. The best subset contains the minimum number of dimensions retaining a suitably high accuracy on classifier in representing the original features. The objective of the proposed approach is to reduce the number of input features thus to identify the key features and eliminating irrelevant features with no predictive information using clustering technique, K-nearest neighbors (KNN) and rough set. This paper deals with two partition based clustering algorithm in data mining namely K-Means and Fuzzy C Means (FCM). These two algorithms are implemented for original data set without considering the class labels and further rough set theory implemented on the partitioned data set to generate feature subset after removing the outlier by using KNN. Wisconsin Breast Cancer datasets derived from UCI machine learning database are used for the purpose of testing the proposed hybrid method. The results show that the hybrid method is able to produce more accurate diagnosis and prognosis results than the full input model with respect to the classification accuracy.
一种包含粗糙集和聚类技术的增强特征选择方法
特征选择或变量约简是数据挖掘中的一个基本问题,是指识别几个最重要的特征以应用学习算法的过程。最佳子集包含最小维数,在表示原始特征时保持分类器的适当高精度。该方法的目的是利用聚类技术、k近邻(KNN)和粗糙集来减少输入特征的数量,从而识别关键特征并消除没有预测信息的不相关特征。本文讨论了数据挖掘中两种基于分区的聚类算法K-Means和模糊C均值(FCM)。这两种算法都是在原始数据集上不考虑类标号的情况下实现的,在分割后的数据集上进一步实现粗糙集理论,利用KNN去除离群值后生成特征子集。使用来自UCI机器学习数据库的威斯康星乳腺癌数据集来测试所提出的混合方法。结果表明,在分类精度方面,混合方法比全输入模型能够产生更准确的诊断和预测结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信