Maximum relevance minimum common redundancy feature selection for nonlinear data
Authors:
- Jinxing CheJCJinxing Che
- Youlong YangYYYoulong Yang
- Li LiLLLi Li
- Xuying BaiXBXuying Bai
- Shenghu ZhangSZShenghu Zhang
- Chengzhi DengCDChengzhi Deng
- 1 October 2017
- journal article
- Published by Elsevier in Information Sciences
- Vol. 409-410, 68-86
Abstract
No abstract availableFunding Information
- National Natural Science Foundation of China (71301067, 61573266, 11561047)
- Natural Science Foundation of Jiangxi Province (20142BAB217015)
This publication has 40 references indexed in Scilit:
- A comparison of simulated annealing algorithms for variable selection in principal component analysis and discriminant analysisComputational Statistics & Data Analysis, 2014
- Feature selection with SVD entropy: Some modification and extensionInformation Sciences, 2014
- Data filtering based recursive least squares algorithm for Hammerstein systems using the key-term separation principleInformation Sciences, 2013
- Kernel discriminant analysis for regression problemsPattern Recognition, 2012
- BART: Bayesian additive regression treesThe Annals of Applied Statistics, 2010
- Effective feature selection scheme using mutual informationNeurocomputing, 2005
- Input feature selection for classification problemsIEEE Transactions on Neural Networks, 2002
- Axiomatic approach to feature subset selection based on relevanceIEEE Transactions on Pattern Analysis and Machine Intelligence, 1999
- Neural-network feature selectorIEEE Transactions on Neural Networks, 1997
- Using mutual information for selecting features in supervised neural net learningIEEE Transactions on Neural Networks, 1994