Supervised feature subset selection with ordinal optimization
Authors:
- Dingcheng FengDFDingcheng Feng
- Feng ChenFCFeng Chen
- Wenli XuWXWenli Xu
- 1 January 2014
- journal article
- research article
- Published by Elsevier in Knowledge-Based Systems
- Vol. 56, 123-140
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- A Framework for Feature Selection in ClusteringJournal of the American Statistical Association, 2010
- A novel Markov boundary based feature subset selection algorithmNeurocomputing, 2009
- Using simulated annealing to optimize the feature selection problem in marketing applicationsEuropean Journal of Operational Research, 2006
- Hybrid genetic algorithms for feature selectionIEEE Transactions on Pattern Analysis and Machine Intelligence, 2004
- RANDOM APPROXIMATED GREEDY SEARCH FOR FEATURE SUBSET SELECTIONAsian Journal of Control, 2004
- Fast branch & bound algorithms for optimal feature selectionIEEE Transactions on Pattern Analysis and Machine Intelligence, 2004
- SUPER‐HEURISTICS AND THEIR APPLICATIONS TO COMBINATORIAL PROBLEMSAsian Journal of Control, 1999
- An explanation of ordinal optimization: Soft computing for hard problemsInformation Sciences, 1999
- Wrappers for feature subset selectionArtificial Intelligence, 1997
- Greedy Randomized Adaptive Search ProceduresJournal of Global Optimization, 1995