Tabu search approaches for solving the two-group classification problem
From MaRDI portal
Publication:541993
DOI10.1007/s10479-009-0581-9zbMath1213.90162OpenAlexW1996116599MaRDI QIDQ541993
Publication date: 8 June 2011
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-009-0581-9
Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A tabu search with an oscillation strategy for the discriminant analysis problem
- Discriminant analysis via mathematical programming: Certain problems and their causes
- Simple but powerful goal programming models for discriminant problems
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- New LP based heuristics for the classification problem
- Feature minimization within decision trees
- Tabu search and finite convergence
- Hybrid extreme point tabu search
- A combinatorial approach to the classification problem
- An iterative mixed integer programming method for classification accuracy maximizing discriminant analysis
- Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List
- Tabu Search—Part II
- Novel approaches to the discrimination problem
- Mathematical Programming for Data Mining: Formulations and Challenges
- Feature selection using tabu search method
This page was built for publication: Tabu search approaches for solving the two-group classification problem