A Branch and Bound Algorithm for Feature Subset Selection
From MaRDI portal
Cited in
(67)- Analysis of new variable selection methods for discriminant analysis
- Efficient algorithms for computing the best subset regression models for large-scale problems
- A variable selection method based on Tabu search for logistic regression models
- Feature selection for face recognition: a memetic algorithmic approach
- The inductive inference of pattern recognition rules which are capable of a linguistic interpretation
- Wrappers for feature subset selection
- Learning Boolean concepts in the presence of many irrelevant features
- Automatic analysis of the structuring of children's drawings and writing
- Feature Subset Selection by Bayesian network-based optimization
- Self-organizing network for variable clustering
- Robust MPC for tracking constrained unicycle robots with additive disturbances
- Separating codes and traffic monitoring
- An adaptive heuristic for feature selection based on complementarity
- Factor analysis in data mining
- Feature selection based on a modified fuzzy C-means algorithm with supervision
- Feature selection toolbox
- Forecasting financial failure using a Kohonen map: a comparative study to improve model stability over time
- Synergies between operations research and data mining: the emerging use of multi-objective approaches
- Metaheuristics for data mining
- High-dimensional variable selection via low-dimensional adaptive learning
- New bounds for subset selection from conic relaxations
- TCMI: a non-parametric mutual-dependence estimator for multivariate continuous distributions
- A weighted wrapper approach to feature selection
- A branch-and-bound framework for unsupervised common event discovery
- Optimal Boolean lattice-based algorithms for the U-curve optimization problem
- Taxicab correspondence analysis
- A novel distribution-free hybrid regression model for manufacturing process efficiency improvement
- Operations research and data mining
- Linear feature extraction by integrating pairwise and global discriminatory information via sequential forward floating selection and kernel QR factorization with column pivoting
- FS\(_-\)SFS: a novel feature selection method for support vector machines
- Simultaneous feature selection and Gaussian mixture model estimation for supervised classification problems
- Variable selection for Fisher linear discriminant analysis using the modified sequential backward selection algorithm for the microarray data
- Adaptive information-theoretical feature selection for pattern classification
- Separating codes and traffic monitoring
- Novel randomized feature selection algorithms
- Feature subset selection for logistic regression via mixed integer optimization
- Feature selection filter for classification of power system operating states
- SOCP relaxation bounds for the optimal subset selection problem applied to robust linear regression
- Subset selection algorithm based on mutual information
- Topology Representing Network Map – A New Tool for Visualization of High-Dimensional Data
- Application of a niched Pareto genetic algorithm for selecting features for nuclear transients classification
- DESIGNING RELEVANT FEATURES FOR CONTINUOUS DATA SETS USING ICA
- scientific article; zbMATH DE number 61461 (Why is no real title available?)
- A general system for heuristic minimization of convex functions over non-convex sets
- Conceptual base of feature selection consulting system
- Dual‐tree fast exact max‐kernel search
- A genetic-ELM neural network computational method for diagnosis of the Parkinson disease gait dataset
- Bayesian model and dimension reduction for uncertainty propagation: applications in random media
- Notes on the evolution of feature selection methodology
- Feature selection algorithms in classification problems: an experimental evaluation
- New algorithms for computing the least trimmed squares regression estimator
- Feature subset selection by Bayesian networks: A comparison with genetic and sequential algorithms
- Feature selection using tabu search method
- Feature selection in machine learning via variable neighborhood search
- Subset Selection and the Cone of Factor-Width-k Matrices
- Temporal-like bivariate Fay-Herriot model: leveraging past responses and advanced preprocessing for enhanced small area estimation of growing stock volume
- An algorithm for cardinality-constrained optimization with an application to the best subset selection and sparse portfolio problems.
- Consistency-based search in feature selection
- A novel feature selection approach: combining feature wrappers and filters
- A multilevel tabu search algorithm for the feature selection problem in biomedical data
- Improved binary PSO for feature selection using gene expression data
- A comparison of several nearest neighbor classifier metrics using tabu search algorithm for the feature selection problem
- Optimization of nearest neighbor classifiers via metaheuristic algorithms for credit risk assessment
- A discrete particle swarm optimization method for feature selection in binary classification problems
- Sensitivity and specificity based multiobjective approach for feature selection: application to cancer diagnosis
- SVM-FuzCoC: A novel SVM-based feature selection method using a fuzzy complementary criterion
- When do stepwise algorithms meet subset selection criteria?
This page was built for publication: A Branch and Bound Algorithm for Feature Subset Selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4138131)
