Lagrangian relaxation for SVM feature selection.
Manlio GaudiosoEnrico GorgoneMartine LabbéAntonio M. Rodríguez-ChíaPublished in: Comput. Oper. Res. (2017)
Keyphrases
- lagrangian relaxation
- feature selection
- support vector
- integer programming
- feasible solution
- branch and bound algorithm
- support vector machine
- lower bound
- dual decomposition
- lower and upper bounds
- dynamic programming
- multi class
- linear programming
- np hard
- column generation
- selected features
- support vector machine svm
- knn
- feature space
- text categorization
- shortest path
- relaxation algorithm
- lagrangian heuristic
- text classification
- machine learning
- subgradient method
- neural network
- svm classifier
- kernel methods
- feature subset
- kernel function
- optimal solution
- feature extraction
- tabu search
- upper bound
- linear svm
- logistic regression
- search algorithm