DocumentCode :
2533277
Title :
Recursive Feature Selection Based on Minimum Redundancy Maximum Relevancy
Author :
Yang, Yuansheng ; Li, Haiyan ; Lin, Xiaohui ; Ming, Di
Author_Institution :
Sch. of Comput. Sci. & Technol., Dalian Univ. of Technol., Dalian, China
fYear :
2010
fDate :
18-20 Dec. 2010
Firstpage :
281
Lastpage :
285
Abstract :
Minimum redundancy maximum relevancy (mRMR) is one of the successful criteria used by many feature selection techniques to evaluate the discriminating abilities of the features. We combined dynamic sample space with mRMR and proposed a new feature selection method. In each iteration, the weighted mRMR values are calculated on dynamic sample space consisting of the current unlabelled samples. The feature with the largest weighted mRMR value among those which can improve the classification performance is preferred to be selected. Five public data sets were used to demonstrate the superiority of our method.
Keywords :
feature extraction; iterative methods; pattern classification; redundancy; set theory; classification performance; data set; iterative method; mRMR; minimum redundancy maximum relevancy; recursive feature selection; Accuracy; Biological system modeling; Classification algorithms; Machine learning; Mutual information; Redundancy; Support vector machines;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel Architectures, Algorithms and Programming (PAAP), 2010 Third International Symposium on
Conference_Location :
Dalian
Print_ISBN :
978-1-4244-9482-8
Type :
conf
DOI :
10.1109/PAAP.2010.52
Filename :
5715095
Link To Document :
بازگشت