A Branch and Bound Algorithm for Feature Subset Selection
From MaRDI portal
Publication:4138131
DOI10.1109/TC.1977.1674939zbMath0363.68059OpenAlexW1523989055WikidataQ56271121 ScholiaQ56271121MaRDI QIDQ4138131
Patrenahalli M. Narendra, Keinosuke Fukunaga
Publication date: 1977
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.1977.1674939
Related Items (66)
Variable selection for Fisher linear discriminant analysis using the modified sequential backward selection algorithm for the microarray data ⋮ Learning Boolean concepts in the presence of many irrelevant features ⋮ Feature subset selection for logistic regression via mixed integer optimization ⋮ Simultaneous feature selection and Gaussian mixture model estimation for supervised classification problems ⋮ Automatic analysis of the structuring of children's drawings and writing ⋮ Self-organizing network for variable clustering ⋮ Feature selection filter for classification of power system operating states ⋮ Robust MPC for tracking constrained unicycle robots with additive disturbances ⋮ SOCP relaxation bounds for the optimal subset selection problem applied to robust linear regression ⋮ The inductive inference of pattern recognition rules which are capable of a linguistic interpretation ⋮ A novel feature selection approach: combining feature wrappers and filters ⋮ Wrappers for feature subset selection ⋮ 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 ⋮ Novel Randomized Feature Selection Algorithms ⋮ Feature selection in machine learning via variable neighborhood search ⋮ Topology Representing Network Map – A New Tool for Visualization of High-Dimensional Data ⋮ A branch-and-bound framework for unsupervised common event discovery ⋮ 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 ⋮ Optimal Boolean lattice-based algorithms for the U-curve optimization problem ⋮ Separating codes and traffic monitoring ⋮ An adaptive heuristic for feature selection based on complementarity ⋮ A multilevel tabu search algorithm for the feature selection problem in biomedical data ⋮ Subset selection algorithm based on mutual information ⋮ 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 ⋮ A general system for heuristic minimization of convex functions over non-convex sets ⋮ 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 ⋮ Optimization of nearest neighbor classifiers via metaheuristic algorithms for credit risk assessment ⋮ Metaheuristics for data mining ⋮ Taxicab correspondence analysis ⋮ New algorithms for computing the least trimmed squares regression estimator ⋮ A discrete particle swarm optimization method for feature selection in binary classification problems ⋮ Feature subset selection by Bayesian networks: A comparison with genetic and sequential algorithms ⋮ FS\(_-\)SFS: a novel feature selection method for support vector machines ⋮ Factor analysis in data mining ⋮ Feature selection algorithms in classification problems: an experimental evaluation ⋮ 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? ⋮ Feature selection using tabu search method ⋮ Application of a niched Pareto genetic algorithm for selecting features for nuclear transients classification ⋮ High-dimensional variable selection via low-dimensional adaptive learning ⋮ Analysis of new variable selection methods for discriminant analysis ⋮ Unnamed Item ⋮ DESIGNING RELEVANT FEATURES FOR CONTINUOUS DATA SETS USING ICA ⋮ Dual‐tree fast exact max‐kernel search ⋮ Feature selection based on a modified fuzzy C-means algorithm with supervision ⋮ Efficient algorithms for computing the best subset regression models for large-scale problems ⋮ Unnamed Item ⋮ Bayesian Model and Dimension Reduction for Uncertainty Propagation: Applications in Random Media ⋮ Adaptive Information-Theoretical Feature Selection for Pattern Classification ⋮ Separating Codes and Traffic Monitoring ⋮ A novel distribution-free hybrid regression model for manufacturing process efficiency improvement ⋮ New bounds for subset selection from conic relaxations ⋮ A variable selection method based on Tabu search for logistic regression models ⋮ Feature selection for face recognition: a memetic algorithmic approach ⋮ Feature Subset Selection by Bayesian network-based optimization ⋮ TCMI: a non-parametric mutual-dependence estimator for multivariate continuous distributions ⋮ Feature selection toolbox ⋮ Unnamed Item ⋮ A weighted wrapper approach to feature selection ⋮ Consistency-based search in feature selection ⋮ A genetic-ELM neural network computational method for diagnosis of the Parkinson disease gait dataset
This page was built for publication: A Branch and Bound Algorithm for Feature Subset Selection
